{"push_id":3052744468,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6b70630063fd6f4874a9ab59742686f2a0d43163","before":"23ddf3d95df8991afbe02d83c975e70b00694c67","commits":[{"sha":"6b70630063fd6f4874a9ab59742686f2a0d43163","author":{"name":"wallacegui","email":"80668561a1cc502c7c393e7d0ae49cd4f63f5589@sina.com"},"message":"Create 124. 二叉树中的最大路径和.py","distinct":true,"url":"https://api.github.com/repos/wallacegui/leetcode/commits/6b70630063fd6f4874a9ab59742686f2a0d43163"}]}
{"actor":{"display_login":"wallacegui"}}