{"push_id":1246777829,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"01148b1225cba2144c999e56c1a81ce619b8c0f3","before":"957e621cdf6251c0ffc74a089ce2cffbcea4ce38","commits":[{"sha":"01148b1225cba2144c999e56c1a81ce619b8c0f3","author":{"name":"jiangran910126","email":"54c65cffc42b8e57fbbb3008384bf38a80352821@gmail.com"},"message":"[64. Minimum Path Sum][]","distinct":true,"url":"https://api.github.com/repos/jiangran910126/Leetcode/commits/01148b1225cba2144c999e56c1a81ce619b8c0f3"}]}
{"actor":{"display_login":"jiangran910126"}}