{"push_id":2989610922,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"e07461c3725e558876689d1a2a0ae0f390f5afc4","before":"f5f456e62ed03906532c7685f26f7e927e35e5e3","commits":[{"sha":"e50293d38e10c3127f307c44dde26d9a7021e92e","author":{"name":"XuYibo","email":"fdca1dd960f04a542f1d17cffd95688aae7b535a@outlook.com"},"message":"平方和","distinct":true,"url":"https://api.github.com/repos/myjavaxp/leetcode/commits/e50293d38e10c3127f307c44dde26d9a7021e92e"},{"sha":"e07461c3725e558876689d1a2a0ae0f390f5afc4","author":{"name":"XuYibo","email":"fdca1dd960f04a542f1d17cffd95688aae7b535a@outlook.com"},"message":"动态规划解决435号问题","distinct":true,"url":"https://api.github.com/repos/myjavaxp/leetcode/commits/e07461c3725e558876689d1a2a0ae0f390f5afc4"}]}
{"actor":{"display_login":"myjavaxp"}}