{"push_id":1040012019,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"fcc72dbb4255332540c10549b333a6a05882ab78","before":"a5f3d030260b76cdf5c89896f94bfa0efb509833","commits":[{"sha":"fcc72dbb4255332540c10549b333a6a05882ab78","author":{"email":"b8bbb2836133f8b4186384c253cb90cf76b871c7@aliyun.com","name":"Marcus Chang"},"message":"LintCode Algorithm Practice\n\nChapter 9 added http://www.lintcode.com/zh-cn/problem/k-sum-ii/\n\nMarcus_Chang\n\n2016-MAR-29","distinct":true,"url":"https://api.github.com/repos/MarcusChang/LintCode_Practice/commits/fcc72dbb4255332540c10549b333a6a05882ab78"}]}