{"push_id":1257071178,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"0759b86aaceb21368743c65f1d09f98cec0e4cfd","before":"3db5cd141b2c808aa0f4a9a0eb14a8decf9ea471","commits":[{"sha":"0759b86aaceb21368743c65f1d09f98cec0e4cfd","author":{"name":"lixinchn","email":"0108cd50d024c1fb1fc9ba7c0afa68abe8f1f773@gmail.com"},"message":"binary tree maximum path sum","distinct":true,"url":"https://api.github.com/repos/lixinchn/LeetCode/commits/0759b86aaceb21368743c65f1d09f98cec0e4cfd"}]}
{"actor":{"display_login":"lixinchn"}}