{"push_id":635803877,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ab12ec86719386a575a1867eb88322750474d519","before":"00af5e0410a7d99ae66a62c28171771b08aef3e7","commits":[{"sha":"ab12ec86719386a575a1867eb88322750474d519","author":{"email":"a6c030e3159c38aabf3f1a9e80898a24d012b5b4@qq.com","name":"zhangyx"},"message":"124 binary tree maximum path sum solution.","distinct":true,"url":"https://api.github.com/repos/Garnel/Flamg/commits/ab12ec86719386a575a1867eb88322750474d519"}]}