{"push_id":1123575905,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7a91f83d9c73b708ebf699f6a96279b2344fb25e","before":"52d79d86ced5450bdeb08539b5514dea7e66aeac","commits":[{"sha":"7a91f83d9c73b708ebf699f6a96279b2344fb25e","author":{"email":"7b8f3e1e3463a016ec2cf68823d24400e6ba2509@gmail.com","name":"ndhuanhuan"},"message":"Create 3. *Longest Substring Without Repeating Characters.py","distinct":true,"url":"https://api.github.com/repos/ndhuanhuan/14summer_practice/commits/7a91f83d9c73b708ebf699f6a96279b2344fb25e"}]}
{"actor":{"display_login":"ndhuanhuan"}}