{"push_id":1224520579,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"eabb125a591df409db5e20a2f6ec01bc8e4aa192","before":"b28db75811c49bd4f8344fc5a3fa0e8faacd9461","commits":[{"sha":"eabb125a591df409db5e20a2f6ec01bc8e4aa192","author":{"name":"zhangpu0703","email":"539b39362474d06063ad57dcf889e82bd89a890d@hotmail.com"},"message":"[3. Longest Substring Without Repeating Characters][Accepted]committed by LeetCode Extension","distinct":true,"url":"https://api.github.com/repos/zhangpu0703/LeetCode/commits/eabb125a591df409db5e20a2f6ec01bc8e4aa192"}]}
{"actor":{"display_login":"zhangpu0703"}}