{"push_id":1716245423,"size":4,"distinct_size":4,"ref":"refs/heads/master","head":"7613067223f2d2657fe8a554dc011bd8e659a4da","before":"a5fd1c96301f4e1c042ebd9468e55319714dbb96","commits":[{"sha":"80c29244d066266ce9f30b991a6c1a392d7895eb","author":{"name":"nikoGao","email":"69aaf034a8400f19aaa11e3a8dc899a397cf5ed2@sina.com"},"message":"Leetcode Question 279 just use number theory, there is dynamic plan, bfs method","distinct":true,"url":"https://api.github.com/repos/nikoGao/Leetcode/commits/80c29244d066266ce9f30b991a6c1a392d7895eb"},{"sha":"f17cc573ec69b6641807b4f92f580d0823d9621b","author":{"name":"nikoGao","email":"69aaf034a8400f19aaa11e3a8dc899a397cf5ed2@sina.com"},"message":"Leetocde Question 280, first think of the first solution, not familiar with greedy method","distinct":true,"url":"https://api.github.com/repos/nikoGao/Leetcode/commits/f17cc573ec69b6641807b4f92f580d0823d9621b"},{"sha":"6ce06d90d90d1432d7774aa44fa6c57c057297e2","author":{"name":"nikoGao","email":"69aaf034a8400f19aaa11e3a8dc899a397cf5ed2@sina.com"},"message":"Leetcode Question 281, easy than last zigzag question","distinct":true,"url":"https://api.github.com/repos/nikoGao/Leetcode/commits/6ce06d90d90d1432d7774aa44fa6c57c057297e2"},{"sha":"7613067223f2d2657fe8a554dc011bd8e659a4da","author":{"name":"nikoGao","email":"69aaf034a8400f19aaa11e3a8dc899a397cf5ed2@sina.com"},"message":"Leetcode Question 284, class method","distinct":true,"url":"https://api.github.com/repos/nikoGao/Leetcode/commits/7613067223f2d2657fe8a554dc011bd8e659a4da"}]}
{"actor":{"display_login":"nikoGao"}}