{"push_id":1164964255,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"e108d520a74a8f83e4a8b793e237f196487fe7ff","before":"4e661e028cddb8af2bcbfa7421ae33899ebf5524","commits":[{"sha":"7b47ce159bf1c644e3ac58df09ec2ae2989c3237","author":{"name":"Yanzhe Chen","email":"af6bd10323b59cccb38530a61e1dbd42793a9397@gmail.com"},"message":"Refine Problem 64. Minimum Path Sum","distinct":true,"url":"https://api.github.com/repos/yanzhe-chen/leetcode/commits/7b47ce159bf1c644e3ac58df09ec2ae2989c3237"},{"sha":"e108d520a74a8f83e4a8b793e237f196487fe7ff","author":{"name":"Yanzhe Chen","email":"af6bd10323b59cccb38530a61e1dbd42793a9397@gmail.com"},"message":"Refine Problem 64. Minimum Path Sum","distinct":true,"url":"https://api.github.com/repos/yanzhe-chen/leetcode/commits/e108d520a74a8f83e4a8b793e237f196487fe7ff"}]}
{"actor":{"display_login":"yanzhe-chen"}}