{"push_id":2541186936,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3177177e4a444efa724a3ca319d3a6d100bc59ae","before":"82cf1468fa0987f7a4badea223c50de446115af5","commits":[{"sha":"3177177e4a444efa724a3ca319d3a6d100bc59ae","author":{"name":"Binbin Qian","email":"ed88f8ecac9dcdf4cc62111657c2a15a8b6c011b@hotmail.com"},"message":"64. Minimum Path Sum","distinct":true,"url":"https://api.github.com/repos/qianbinbin/leetcode/commits/3177177e4a444efa724a3ca319d3a6d100bc59ae"}]}
{"actor":{"display_login":"qianbinbin"}}