{"push_id":2822813081,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"194c8d9f54415f76014a6108f0ded4b5f5c14452","before":"3841c4abc1db4de9c2ab95e09c742ce0bfd1a770","commits":[{"sha":"194c8d9f54415f76014a6108f0ded4b5f5c14452","author":{"name":"yanguokai","email":"b38afec8cdb87128d10cf800360a2222e20ade2e@qq.com"},"message":"Create 3. Longest Substring Without Repeating Characters","distinct":true,"url":"https://api.github.com/repos/yanguokai/leetcode_yan/commits/194c8d9f54415f76014a6108f0ded4b5f5c14452"}]}
{"actor":{"display_login":"yanguokai"}}