{"push_id":909370812,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ebe67f3de2957da54a5e366be69694102d7ba46e","before":"d4bdcd3ebf1f84b874667be4a38a6788e959bac2","commits":[{"sha":"ebe67f3de2957da54a5e366be69694102d7ba46e","author":{"email":"a17fed27eaa842282862ff7c1b9c8395a26ac320@mikecoder.net","name":"Mike Tang"},"message":"python/oj.leetcode/LongestIncreasingSubsequence.py","distinct":true,"url":"https://api.github.com/repos/MikeCoder/oj-code/commits/ebe67f3de2957da54a5e366be69694102d7ba46e"}]}