{"push_id":2484616835,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"ce0ddc6015b52d53bc2673275b78d9bb370fa403","before":"e382497dab2f7bbc6c53137a865c71f9d963311e","commits":[{"sha":"8528357865e798d91706c0e15ca651ff57f11b7e","author":{"name":"Deng Haijun","email":"703a34b3a0a0e6fdd4047fd85ee2a7f2e862ac6d@sina.com"},"message":"leetcode 654. Maximum Binary Tree pass","distinct":true,"url":"https://api.github.com/repos/hbdhj/python/commits/8528357865e798d91706c0e15ca651ff57f11b7e"},{"sha":"023def5dfee29129705fa416453b961d2fc578c9","author":{"name":"Deng Haijun","email":"703a34b3a0a0e6fdd4047fd85ee2a7f2e862ac6d@sina.com"},"message":"leetcode 669. Trim a Binary Search Tree pass","distinct":true,"url":"https://api.github.com/repos/hbdhj/python/commits/023def5dfee29129705fa416453b961d2fc578c9"},{"sha":"ce0ddc6015b52d53bc2673275b78d9bb370fa403","author":{"name":"Deng Haijun","email":"703a34b3a0a0e6fdd4047fd85ee2a7f2e862ac6d@sina.com"},"message":"leetcode 566. Reshape the Matrix and 763. Partition Labels","distinct":true,"url":"https://api.github.com/repos/hbdhj/python/commits/ce0ddc6015b52d53bc2673275b78d9bb370fa403"}]}
{"actor":{"display_login":"hbdhj"}}