113. Path Sum II

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

For 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]
]
/**
 * 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> > pathSum(TreeNode* root, int sum) {
		if (root == NULL){
			return res;
		}
		vector<int> path;
		helper(root, sum, path, 0);
		return res;
	}
private:
	void helper(TreeNode* root, int sum, vector<int>& path, int cur){
		cur += root->val;
		path.push_back(root->val);
		if (root->left == NULL&&root->right == NULL){
			if (cur == sum){
				res.push_back(path);
				//return;//不能要，后面要pop_back
			}
		}
		if (root->left){
			helper(root->left, sum, path, cur);
		}
		if (root->right){
			helper(root->right, sum, path, cur);
		}
		path.pop_back();
	}
	vector<vector<int> >res;
};