{"push_id":1188451121,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3333bc1f3f1b39e62e87675b757f127dd2efbfac","before":"ab8057957265b48d4f9898e6950005b6194c3109","commits":[{"sha":"3333bc1f3f1b39e62e87675b757f127dd2efbfac","author":{"name":"csxuejin","email":"a270dc6ea373d4f3e03b99c5e22c0134e2e3ef2a@qq.com"},"message":"Longest Substring Without Repeating Characters","distinct":true,"url":"https://api.github.com/repos/csxuejin/LeetcodeCpp/commits/3333bc1f3f1b39e62e87675b757f127dd2efbfac"}]}
{"actor":{"display_login":"csxuejin"}}