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]
]

题意： 给定一个数sum，找到所有从根结点到叶节点的path, 要求这条path上的所有结点的val值的和为sum。

思路：要存储路径的结点的值。递归思路借鉴112 Path Sum, 不过一个是求存在，一个是求所有。注意理解递归过程中数组内存的分配和释放。

/**
 * 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) {
		vector<vector<int>> p;
		if (root){
			vector<int> m;
			hasPathSum(root, sum, m, p);
		}
		return p;
	}

	void hasPathSum(TreeNode* root, int sum, vector<int> m, vector<vector<int>>& p){
		if (root == NULL)
			return;
		if (root->val == sum && root->left == NULL && root->right == NULL){
			m.push_back(root->val);
			p.push_back(m);
			return;
		}		
		else{
			m.push_back(root->val);
			int val = sum - root->val;
			hasPathSum(root->left, val, m, p);
			hasPathSum(root->right, val, m, p);
		}
	}
};