{"push_id":757646924,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9144fa0947e5dc867adf1286d037cf365ba626ec","before":"2c6c0b294488402ed5c3f798cc2fb12f856c81dc","commits":[{"sha":"9144fa0947e5dc867adf1286d037cf365ba626ec","author":{"email":"09453b1b6245d5c42ce2644ab82f61a270048f33@gmail.com","name":"Shuai Li"},"message":"DFS bottom-up; one path return : O(n) & O(log(n))\n\nGiven a binary tree, find the maximum path sum.\r\n\r\nThe path may start and end at any node in the tree.\r\n\r\nFor example:\r\nGiven the below binary tree,\r\n\r\n       1\r\n      / \\\r\n     2   3\r\nReturn 6.","distinct":true,"url":"https://api.github.com/repos/shuai-li/leetcode/commits/9144fa0947e5dc867adf1286d037cf365ba626ec"}]}