{"push_id":2619728720,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d3c7e9d9c7a9d453a5a318c4ebc470e6b755abf2","before":"ed5e2f745a23342234f2004948dde23f4a689a40","commits":[{"sha":"d3c7e9d9c7a9d453a5a318c4ebc470e6b755abf2","author":{"name":"Neo0one","email":"a17caff59d568bcf4d20dd2f6133150de34b1197@vip.qq.com"},"message":"Update 3. Longest Substring Without Repeating Characters","distinct":true,"url":"https://api.github.com/repos/Neo0one/Leetcode/commits/d3c7e9d9c7a9d453a5a318c4ebc470e6b755abf2"}]}
{"actor":{"display_login":"Neo0one"}}