{"push_id":2613481179,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"e85fce057c28c2552b6734f2a8319467b9e9632f","before":"763c714a3f151fe04a8f0b6ffa13ac70dfea574a","commits":[{"sha":"b85a4871505027925dda919a21008ec44f6c5aa2","author":{"name":"maple","email":"0d2a383509071362517c208065703eeb1246ad9b@qq.com"},"message":"判断括号匹配问题","distinct":true,"url":"https://api.github.com/repos/treasureb/LeetCode/commits/b85a4871505027925dda919a21008ec44f6c5aa2"},{"sha":"e85fce057c28c2552b6734f2a8319467b9e9632f","author":{"name":"maple","email":"0d2a383509071362517c208065703eeb1246ad9b@qq.com"},"message":"判断一颗树是否为二叉镜像树,待完善","distinct":true,"url":"https://api.github.com/repos/treasureb/LeetCode/commits/e85fce057c28c2552b6734f2a8319467b9e9632f"}]}
{"actor":{"display_login":"treasureb"}}