{"push_id":655846617,"size":1,"distinct_size":1,"ref":"refs/heads/DFS","head":"4c6ad451a0d50a42ebaff0a4abe6f7d4f052f6cb","before":"9c5ae97c8a233fbac73744e7410e62d78e1c6208","commits":[{"sha":"4c6ad451a0d50a42ebaff0a4abe6f7d4f052f6cb","author":{"email":"b381d7c4b0d6a450fb440ec4a07567d27bd37eb8@gmail.com","name":"Gia Huang"},"message":"Create 152-Maximum Product Subarray.java","distinct":true,"url":"https://api.github.com/repos/huangjieSC/Leetcode/commits/4c6ad451a0d50a42ebaff0a4abe6f7d4f052f6cb"}]}