{"push_id":3100439216,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9daf16e601066503db96aac651a91003825d8278","before":"a35873d316dc8053abf34e6a33c5fe022d1c5ef3","commits":[{"sha":"9daf16e601066503db96aac651a91003825d8278","author":{"name":"ghxuan","email":"e05d08fd36b5f22ab3329ce578b18593d0cbd0c7@outlook.com"},"message":"无重复字符的最长子串","distinct":true,"url":"https://api.github.com/repos/ghxuan/leetcode/commits/9daf16e601066503db96aac651a91003825d8278"}]}
{"actor":{"display_login":"ghxuan"}}