{"push_id":1268404507,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"685314d3b9a6a0ef7f56cf427d8c0df47cea91f2","before":"f1c0287e66cd6a90e9e9d03feefb3da0b5c52126","commits":[{"sha":"685314d3b9a6a0ef7f56cf427d8c0df47cea91f2","author":{"name":"qq783175223","email":"3f9291712e15380fdc6bc30923ca590a566ea0d5@qq.com"},"message":"二叉树的层次遍历","distinct":true,"url":"https://api.github.com/repos/qq783175223/LintCodeInJava/commits/685314d3b9a6a0ef7f56cf427d8c0df47cea91f2"}]}
{"actor":{"display_login":"qq783175223"}}