{"push_id":3670949400,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"eb6e919ae3d71b425a446e9088fe3944bec00b40","before":"4ee3f86e7957c3fcb803e05bba5d2e25326f8a79","commits":[{"sha":"77e48f8b6c218af15475aeff7908a1be6e654f3e","author":{"name":"wweihhh","email":"f4eb1a116eba52beb59249304b0e4f96cfbb311c@qq.com"},"message":"树的最大深度","distinct":true,"url":"https://api.github.com/repos/wweihhh/javacode/commits/77e48f8b6c218af15475aeff7908a1be6e654f3e"},{"sha":"eb6e919ae3d71b425a446e9088fe3944bec00b40","author":{"name":"wweihhh","email":"f4eb1a116eba52beb59249304b0e4f96cfbb311c@qq.com"},"message":"成为斐波那契数的最小步数","distinct":true,"url":"https://api.github.com/repos/wweihhh/javacode/commits/eb6e919ae3d71b425a446e9088fe3944bec00b40"}]}
{"actor":{"display_login":"wweihhh"}}