{"push_id":573949067,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"bb261673b4cf75c228c36a8766cbe479775a052b","before":"a4e4a4dba512607bf0bd5be6dd4112ec59fa4220","commits":[{"sha":"bb261673b4cf75c228c36a8766cbe479775a052b","author":{"email":"9411c4d30939cb69b3fd4b925c91078ad35d16a8@qq.com","name":"guhaohit"},"message":"Climbing Stairs\n\n简单的动态规划","distinct":true,"url":"https://api.github.com/repos/guhaohit/leetcode/commits/bb261673b4cf75c228c36a8766cbe479775a052b"}]}