{"push_id":3074862154,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"145a6b46a07e1413812921e49f89dbe5564abfbd","before":"fdcbf13cdf4fe6aee132261bd27a870ab5b9ecb8","commits":[{"sha":"145a6b46a07e1413812921e49f89dbe5564abfbd","author":{"name":"aiyane","email":"4560aab04a4dbaa86f1652ddfaefc41c5b563351@gmail.com"},"message":"长度最小的子数组","distinct":true,"url":"https://api.github.com/repos/Aiyane/aiyane-LeetCode/commits/145a6b46a07e1413812921e49f89dbe5564abfbd"}]}
{"actor":{"display_login":"Aiyane"}}