[LeetCode] Binary Tree Maximum Path Sum

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int ret;
    
    int DFS(TreeNode *root) {
        if (!root) return 0;
        
        int left  = DFS(root->left);
        int right = DFS(root->right);
        
        int val = root->val;
        if (left > 0)  val += left;
        if (right > 0) val += right;
        
        ret = max(ret, val);
        
        if (left <= 0 && right <= 0)
            return root->val;
        else
            return max(left, right) + root->val;
    }
    
    int maxPathSum(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (!root) return 0;
        
        ret = root->val;
        
        DFS(root);
        
        return ret;
    }
};

Small Case: 8ms

Large Case: 140ms

Time: O(n)

Space: O(1)