{"push_id":3408406504,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f657c3a106aefec8bc9573f94b113568d9b10c74","before":"bcd76911fb4cc345c8d292d71e460d6a8e3d3a57","commits":[{"sha":"f657c3a106aefec8bc9573f94b113568d9b10c74","author":{"name":"tanwei","email":"13c2f65c281efe36e965eaf309922c785205ef52@qq.com"},"message":"暴力法解决无重复字符串的最长字串","distinct":true,"url":"https://api.github.com/repos/wulikanhua/LeetCode/commits/f657c3a106aefec8bc9573f94b113568d9b10c74"}]}
{"actor":{"display_login":"wulikanhua"}}