LeetCode113.路径之和2

给定一个二叉树和一个目标和，找到所有从根节点到叶子节点路径总和等于给定目标和的路径。

说明: 叶子节点是指没有子节点的节点。

示例:
给定如下二叉树，以及目标和 sum = 22，

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

返回:
[
[5,4,11,2],
[5,8,4,5]
]

思路:先序遍历。每遍历一个结点就将其值加入路径数组path中，并更新路径和path_sum，当遍历到叶子节点时，检查path_sum是否等于sum，等于的话，就将其path加入路径数组result中。在向上层回溯时要将当前节点的值从path中拿出，并更新path_sum。

#include<iostream>
#include<vector>
using namespace std;

struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x),left(NULL),right(NULL){}
};

class Solution {
	vector<int> path;
	vector<vector<int>> result;
	int path_sum;
public:
	 vector<vector<int>> pathSum(TreeNode* root, int sum) {
		preOrder(root,sum);
		return result;
	}
	
	void preOrder(TreeNode *node,int sum) {
		if(!node) {
			return;
		}
		path.push_back(node->val);
		path_sum += node->val;
		if(node->left == NULL && node->right == NULL && path_sum == sum) {
			result.push_back(path);
		} 
		preOrder(node->left,sum);
		preOrder(node->right,sum);
		//向上层回溯时，要将当前节点的值从path中拿出，并更新path_sum
		path.pop_back();
		path_sum -= node->val;
	}
};

int main() {
	TreeNode a(5);
	TreeNode b(4);
	TreeNode c(8);
	TreeNode d(11);
	TreeNode e(14);
	TreeNode f(4);
	TreeNode g(7);
	TreeNode h(2);
	TreeNode x(5);
	TreeNode y(1);
	a.left = &b;
	a.right = &c;
	b.left = &d;
	c.left = &e;
	c.right = &f;
	d.left = &g;
	d.right = &h;
	f.left = &x;
	f.right = &y;
	vector<vector<int> > res;
	Solution s;
	res = s.pathSum(&a,22);
	for(int i = 0; i < res.size(); i++) {
		for(int j = 0; j < res[i].size(); j++) {
			cout<<"["<<res[i][j]<<"]";
		}
		cout<<endl;
	} 
	return 0;
}