{"push_id":1177227258,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"521f437b82001b2aff794be08f96b26f7afdd50b","before":"c023530906b30001d797e3725d346d9e44732ab7","commits":[{"sha":"05d975cba90a1142b947090cea754f2b96bdde5d","author":{"name":"郑钦洪","email":"e564fb93c93ab6dcfcb7120203bb6eebbd3ec436@qq.com"},"message":"剑指offer:面试题39:二叉树的深度","distinct":true,"url":"https://api.github.com/repos/iKingsly/iKYLeetCode/commits/05d975cba90a1142b947090cea754f2b96bdde5d"},{"sha":"be03aef7d52a6aaf80a92143e2487427986c6e77","author":{"name":"郑钦洪","email":"e564fb93c93ab6dcfcb7120203bb6eebbd3ec436@qq.com"},"message":"判断一颗树是否为平衡二叉树","distinct":true,"url":"https://api.github.com/repos/iKingsly/iKYLeetCode/commits/be03aef7d52a6aaf80a92143e2487427986c6e77"},{"sha":"521f437b82001b2aff794be08f96b26f7afdd50b","author":{"name":"郑钦洪","email":"e564fb93c93ab6dcfcb7120203bb6eebbd3ec436@qq.com"},"message":"顺序栈","distinct":true,"url":"https://api.github.com/repos/iKingsly/iKYLeetCode/commits/521f437b82001b2aff794be08f96b26f7afdd50b"}]}
{"actor":{"display_login":"iKingsly"}}