{"push_id":1170218685,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ed4b245036bfd1840dbbd82151460f9eca14794f","before":"bdcb1d7b47ade9ab22bab752ecc2369313634cb1","commits":[{"sha":"ed4b245036bfd1840dbbd82151460f9eca14794f","author":{"name":"LIU Chengyang","email":"c272ed5a05302822c0ff17b82640329ff98fc7dd@qq.com"},"message":"Create 104. Maximum Depth of Binary Tree.cpp","distinct":true,"url":"https://api.github.com/repos/goodgooodstudy/leetcode/commits/ed4b245036bfd1840dbbd82151460f9eca14794f"}]}
{"actor":{"display_login":"goodgooodstudy"}}