{"push_id":762459033,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"bb835b8a05c630640c3c3beb42a45a5f852f9db2","before":"d7741f05f99ae4fc69730e665f4ce52fda40657b","commits":[{"sha":"bb835b8a05c630640c3c3beb42a45a5f852f9db2","author":{"email":"082989522eaed47fb9bbe7c84c19f140bfb15aa2@hotmail.com","name":"WEIJIAN WANG"},"message":"Create 3.Longest SubString without Repeating Characters","distinct":true,"url":"https://api.github.com/repos/wwj722/LeetCode/commits/bb835b8a05c630640c3c3beb42a45a5f852f9db2"}]}