{"push_id":1123746682,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"07c91267626c411bdfcc6c6711b338232dba3e1c","before":"0184482ba96d3ee8e3a9d134c70ec6a27582af6c","commits":[{"sha":"07c91267626c411bdfcc6c6711b338232dba3e1c","author":{"email":"cb814878f82b54feac57f7b9ff3697ddcee9f788@gmail.com","name":"xuchaoUCAS"},"message":"[124. Binary Tree Maximum Path Sum][]committed by LeetCode xuchao@ucas","distinct":true,"url":"https://api.github.com/repos/xuchaoUCAS/leetcode/commits/07c91267626c411bdfcc6c6711b338232dba3e1c"}]}
{"actor":{"display_login":"xuchaoUCAS"}}