{"push_id":1208395951,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4c2bc1e1f7c68387af4df86afa3253e6a06396eb","before":"e23f59eaf296c24a07c5453988f8a5ddc2eecbef","commits":[{"sha":"4c2bc1e1f7c68387af4df86afa3253e6a06396eb","author":{"name":"Xiaoying","email":"97023cc721589c5e96269d0aceb4da7a8fb7ffeb@gmail.com"},"message":"[209. Minimum Size Subarray Sum][]committed by LeetCode Extension","distinct":true,"url":"https://api.github.com/repos/yqliving/leetcode/commits/4c2bc1e1f7c68387af4df86afa3253e6a06396eb"}]}
{"actor":{"display_login":"yqliving"}}