{"push_id":1217144927,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4c5ffbdbcef71eaff394bb74f476347f1523bba9","before":"3f39bf729cb41411814961775461cae8f2d1f463","commits":[{"sha":"4c5ffbdbcef71eaff394bb74f476347f1523bba9","author":{"name":"gatieme","email":"41da7f377fe7ec0e36445d3a90354997a3216398@163.com"},"message":"剑指Offer–024-二叉搜索树的后序遍历序列--http://blog.csdn.net/gatieme/article/details/51213665","distinct":true,"url":"https://api.github.com/repos/gatieme/CodingInterviews/commits/4c5ffbdbcef71eaff394bb74f476347f1523bba9"}]}
{"actor":{"display_login":"gatieme"}}