{"push_id":1001824575,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"e4c17046a0c809dbc524e7cd44c8ac0ba46168d1","before":"9260cc7d40eab1faebc02e47a736d4fedfd0d9ca","commits":[{"sha":"e4c17046a0c809dbc524e7cd44c8ac0ba46168d1","author":{"email":"e4b87807f81b006d5c7730f25f11c09644cb269e@gmail.com","name":"damon"},"message":"LongestSubstringWithoutRepeatingCharacters\nO(n^3)算法","distinct":true,"url":"https://api.github.com/repos/damon-cwz/leetCode/commits/e4c17046a0c809dbc524e7cd44c8ac0ba46168d1"}]}