{"push_id":923258830,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"09d74d3533c4778f5fe2898b29dc533ff16eaed6","before":"1433a21715dab918b797cafc45f5391ed87373bb","commits":[{"sha":"b5028eeff38f9ac5cf7ae57282d173f31ba51d68","author":{"email":"ab61f9ef8f1b601f6ed3be801ff2d51dd7310c4c@connect.hku.hk","name":"Hey"},"message":"leetCode, solved 1 (HouseRobberII)","distinct":true,"url":"https://api.github.com/repos/htbkoo/java/commits/b5028eeff38f9ac5cf7ae57282d173f31ba51d68"},{"sha":"51a88092cdf1a13492592431f992cf85dfc5e878","author":{"email":"ab61f9ef8f1b601f6ed3be801ff2d51dd7310c4c@connect.hku.hk","name":"Hey"},"message":"leetCode, solved 1 (MaximumProductSubarray [MyApproach & SuggestedApproach])","distinct":true,"url":"https://api.github.com/repos/htbkoo/java/commits/51a88092cdf1a13492592431f992cf85dfc5e878"},{"sha":"09d74d3533c4778f5fe2898b29dc533ff16eaed6","author":{"email":"ab61f9ef8f1b601f6ed3be801ff2d51dd7310c4c@connect.hku.hk","name":"Hey"},"message":"leetCode, updated MaximumSubarray for correct description and naming","distinct":true,"url":"https://api.github.com/repos/htbkoo/java/commits/09d74d3533c4778f5fe2898b29dc533ff16eaed6"}]}