{"push_id":2977292337,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"92b77e9e62427b6c8f330db82d45242fb2d3e9eb","before":"fa4afd397b6b95545c87c5d3c2a909a50127d31f","commits":[{"sha":"92b77e9e62427b6c8f330db82d45242fb2d3e9eb","author":{"name":"junzhepan","email":"596727c8a0ea4db3ba2ceceedccbacd3d7b371b8@watch0ut.com"},"message":"Add No. 104. Maximum Depth of Binary Tree.","distinct":true,"url":"https://api.github.com/repos/jack0pan/leetcode/commits/92b77e9e62427b6c8f330db82d45242fb2d3e9eb"}]}
{"actor":{"display_login":"jack0pan"}}