LintCode 246: Binary Tree Path Sum II

246. Binary Tree Path Sum II
     中文English
     Your are given a binary tree in which each node contains a value. Design an algorithm to get all paths which sum to a given value. The path does not need to start or end at the root or a leaf, but it must go in a straight line down.

Example
Example 1:

Input:
{1,2,3,4,#,2}
6
Output:
[
[2, 4],
[1, 3, 2]
]
Explanation:
The binary tree is like this:
1
/
2 3
/ /
4 2
for target 6, it is obvious 2 + 4 = 6 and 1 + 3 + 2 = 6.
Example 2:

Input:
{1,2,3,4}
10
Output:
[]
Explanation:
The binary tree is like this:
1
/
2 3
/
4
for target 10, there is no way to reach it.

解法1：DFS
注意：

1. 这个跟Binary Tree Path Sum不一样，不能用target - root->val，因为这个sum可能是path上的一端，不一定是从头到尾。
2. vector的子段赋值是
   vv.push_back(vector(v.begin() + i, v.end()));

代码如下：

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */


class Solution {
public:
    /*
     * @param root: the root of binary tree
     * @param target: An integer
     * @return: all valid paths
     */
    vector<vector<int>> binaryTreePathSum2(TreeNode * root, int target) {
        if (!root) return vv;
        vector<int> v;
        helper(root, target, v);
        return vv;
    }

private:
    vector<vector<int>> vv;
    void helper(TreeNode * root, int target, vector<int> & v) {
        if (!root) return;

        v.push_back(root->val);

        int sum = 0, n = v.size();
        for (int i = n - 1; i >= 0; --i) {
            sum += v[i];
            if (sum == target) {
                vv.push_back(vector<int>(v.begin() + i, v.end()));
            }
                
        }
        
        helper(root->left, target, v);
        helper(root->right, target, v);

        v.pop_back();
    }
};