{"push_id":3060655917,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f1001f88a633f18fe73990450633e87614b48a52","before":"accd7bb027464e74eb48d8d72f2415cf6965fea0","commits":[{"sha":"f1001f88a633f18fe73990450633e87614b48a52","author":{"name":"shitterlmj2016","email":"7b8d9f986a6bef92ca0eea4c5010ce866a66858d@qq.com"},"message":"用UnionFind解决了最小生成树的问题，还有优化的空间","distinct":true,"url":"https://api.github.com/repos/shitterlmj2016/17630-A5/commits/f1001f88a633f18fe73990450633e87614b48a52"}]}
{"actor":{"display_login":"shitterlmj2016"}}