Path Sum

又：无意中重新翻到此题，重新写了遍，发觉代码要比一年前写的好不少，逻辑跟解答类似，看来代码还是要不断写不断提高呀。

bool travsePath(struct TreeNode *node, int sum, int pathsum) {
    if (node == NULL)
        return false;
    if (node->left == NULL && node->right == NULL) {
        if (sum == pathsum + node->val)
            return true;
        else
            return false;
    }
    
    return travsePath(node->left, sum, pathsum + node->val) || travsePath(node->right, sum, pathsum + node->val);
}
bool hasPathSum(struct TreeNode *root, int sum) {
    if (root == NULL)
        return false;
    
    bool result = false;
    result = travsePath(root, sum, 0);
    
    return result;
}

限定了要到叶子，如果不限定的话难度就大了。记得当时写的时候在如何递归返回bool结果时老错，后来加了个if判断才行。不过方法还是蠢了。

如下：

bool sumTraverse(struct TreeNode *root, int sum, int *num) {
    if (root == NULL)
        return false;
    *num += root->val;
    if (root->left == NULL && root->right == NULL) {
        if (*num == sum)
            return true;
        else {
            *num -= root->val;
            return false;
        }
    }
    if (sumTraverse(root->left, sum, num))
        return true;
    if (sumTraverse(root->right, sum, num))
        return true;
    *num -= root->val;
    return false;
}
bool hasPathSum(struct TreeNode *root, int sum) {
    if (root == NULL)
        return false;
    bool result = false;
    int num = 0;
    result = sumTraverse(root, sum, &num);
    return result;
}

将解答代码贴上以作对比：

class Solution {
public:
bool hasPathSum(TreeNode *root, int sum) {
if (root == nullptr) return false;
if (root->left == nullptr && root->right == nullptr) // leaf
return sum == root->val;
return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);
}
};