{"push_id":2386201388,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"eb5a52a30ee3b3b98f869e0fec8a3e3e0d8a292b","before":"75f933332752f879037576925aa08b19e7fef975","commits":[{"sha":"eb5a52a30ee3b3b98f869e0fec8a3e3e0d8a292b","author":{"name":"jihaojie","email":"a167a594569dcb82ccb98534b9287bd2e4ef9b47@qq.com"},"message":"连续子数组的最大和","distinct":true,"url":"https://api.github.com/repos/jihaojie/leetcode/commits/eb5a52a30ee3b3b98f869e0fec8a3e3e0d8a292b"}]}
{"actor":{"display_login":"jihaojie"}}