{"push_id":1470516255,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"eb2155c189a7feb48bffa30e3a0344ae2dbd1303","before":"e36c023ad016a55f5b37e7761e26c0a127fcd86d","commits":[{"sha":"eb2155c189a7feb48bffa30e3a0344ae2dbd1303","author":{"name":"xlmabc","email":"7751e843141b5fc998f8e07dbea4df2d994d269e@mail.bnu.edu.cn"},"message":"3. Longest Substring Without Repeating Characters","distinct":true,"url":"https://api.github.com/repos/xlmabc/Leetcode/commits/eb2155c189a7feb48bffa30e3a0344ae2dbd1303"}]}
{"actor":{"display_login":"xlmabc"}}