{"push_id":1238711598,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"162d53e51b3c0ec2fbae0bddf1589e6bd3d201b4","before":"cae151fb57f09d65262d1bba6c32a99e4e581d33","commits":[{"sha":"162d53e51b3c0ec2fbae0bddf1589e6bd3d201b4","author":{"name":"sailll choi","email":"68ed82e9164b336afb5b7fc6487f93cd0dc5e00b@sina.cn"},"message":"leetcode 268 using reverse\n\nreverse strategy","distinct":true,"url":"https://api.github.com/repos/sailll/leetcode-solution-by-myself/commits/162d53e51b3c0ec2fbae0bddf1589e6bd3d201b4"}]}
{"actor":{"display_login":"sailll"}}