{"push_id":1124583142,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"e7da0c89483c7a65d1bf4a2b063fc005492a481d","before":"8d9f65c10ba97713b684d86185b4dc0230f8354e","commits":[{"sha":"e7da0c89483c7a65d1bf4a2b063fc005492a481d","author":{"email":"87050e6a258a88fe4e1043688deb74800c27f69d@hotmail.com","name":"rubyway"},"message":"Create 最长无重复字符的子串","distinct":true,"url":"https://api.github.com/repos/rubyway/lintcode/commits/e7da0c89483c7a65d1bf4a2b063fc005492a481d"}]}
{"actor":{"display_login":"rubyway"}}