leetcode problem Path Sum (series)

Path Sum 1

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,

      5
     / \
    4   8
   /   / \
  11  13  4
 /  \      \
7    2      1
return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

solution

递归调用，注意结束条件

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {
        if (root == NULL) return false;
        bool res = false;
        if (root->left == NULL && root->right == NULL) return sum == root->val;
        if (root->left != NULL) res = res || hasPathSum(root->left,sum - root->val);
        if (root->right != NULL) res = res || hasPathSum(root->right,sum - root->val);
        return res;
    }
};

result:

Runtime: 16 ms, faster than 99.58% of C++ online submissions for Path Sum.
Memory Usage: 19.9 MB, less than 55.56% of C++ online submissions for Path Sum.

20190412

Path Sum 2

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,

      5
     / \
    4   8
   /   / \
  11  13  4
 /  \    / \
7    2  5   1

Return:

[
   [5,4,11,2],
   [5,8,4,5]
]

Solution

好慢啊

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> Mycombine(vector<vector<int>> vec, int num) {
        if (vec.size() == 0) return vec;
        for(int i = 0 ; i < vec.size(); ++i)
            vec[i].insert(vec[i].begin(),num);
        return vec;
    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<vector<int> > res;
        if (root == NULL) return res;
        if (root->left == NULL && root->right == NULL && root->val == sum) 
        {
            vector<int>tmp(1,sum);
            res.push_back(tmp);
            return res;
        }
        vector<vector<int>> Res;
        if (root->left != NULL) {
            Res = Mycombine(pathSum(root->left, sum - root->val),root->val);
            res.insert(res.end(), Res.begin(), Res.end());
        }
        if (root->right != NULL) {
            Res = Mycombine(pathSum(root->right, sum - root->val),root->val);
            res.insert(res.end(), Res.begin(), Res.end());
        }
        return res;
    }
};

result:

Runtime: 44 ms, faster than 13.37% of C++ online submissions for Path Sum II.
Memory Usage: 36.5 MB, less than 25.54% of C++ online submissions for Path Sum II.

Path Sum 3

You are given a binary tree in which each node contains an integer value.

Find the number of paths that sum to a given value.

The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).

The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.

Example:

root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8

      10
     /  \
    5   -3
   / \    \
  3   2   11
 / \   \
3  -2   1

Return 3. The paths that sum to 8 are:

1.  5 -> 3
2.  5 -> 2 -> 1
3. -3 -> 11

Solution

懒了懒了，看了discussion的讨论才写的。。。。（下次可不能这样啊）

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int pathSum(TreeNode* root, int sum) {
        if (!root) return 0;
        return pathFromNode(root, sum) + pathSum(root->left,sum) + pathSum(root->right, sum);
    }
    int pathFromNode(TreeNode* root, int sum) {
        if(!root) return 0;
        return (root->val == sum? 1:0) + pathFromNode(root->left,sum-root->val) +  pathFromNode(root->right,sum-root->val);
    }
};

result:

Runtime: 28 ms, faster than 73.31% of C++ online submissions for Path Sum III.
Memory Usage: 14.5 MB, less than 100.00% of C++ online submissions for Path Sum III.