{"push_id":1110909682,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"abf3c2206cc0e0c47af5c5da3caec1cd9278354e","before":"ea66c0a47f44a00433820dcd793b7ad597b57b6d","commits":[{"sha":"abf3c2206cc0e0c47af5c5da3caec1cd9278354e","author":{"email":"08d947ec87f46571851cb277ebadfcc59f47e827@nyu.edu","name":"Haolin Ju"},"message":"[300. Longest Increasing Subsequence][Accepted]committed by LeetCode Extension","distinct":true,"url":"https://api.github.com/repos/haolin29/Leetcode/commits/abf3c2206cc0e0c47af5c5da3caec1cd9278354e"}]}