{"push_id":1185694400,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"cbbb18cedd9f9bd844465e840df1c6b7d1f263b1","before":"50e44af4a720f471fb5530dfa61759ca21212b6a","commits":[{"sha":"cbbb18cedd9f9bd844465e840df1c6b7d1f263b1","author":{"name":"Mingxiang Zhu","email":"7ce7d8d972e4edde755f8c187557cf99949801c1@qq.com"},"message":"[368. Largest Divisible Subset][Accepted]committed by LeetCode Extension","distinct":true,"url":"https://api.github.com/repos/zmxrice/leetcodetraining/commits/cbbb18cedd9f9bd844465e840df1c6b7d1f263b1"}]}
{"actor":{"display_login":"zmxrice"}}