{"push_id":2667827546,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"e0203fc4ee5c0d99f3dfea3f0cb821a420084c7a","before":"fa792bbe727df9a65a22541d9952b26f78698b21","commits":[{"sha":"e0203fc4ee5c0d99f3dfea3f0cb821a420084c7a","author":{"name":"jian wang","email":"c68a2e97bdba0e02bf939c7772d9fba3d8ef1741@outlook.com"},"message":"Create 对动态规划（Dynamic Programming）的理解：从穷举开始","distinct":true,"url":"https://api.github.com/repos/lavalake/leetcode-java/commits/e0203fc4ee5c0d99f3dfea3f0cb821a420084c7a"}]}
{"actor":{"display_login":"lavalake"}}