LeetCode 113.路径总和 II

题目：

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

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

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

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \    / \
        7    2  5   1
返回:

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

代码：

#include <vector>
using namespace std;


struct TreeNode {
public:
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) {
		this->val = x;
		this->left = NULL;
		this->right = NULL;
	}
};

void searchDFS(TreeNode* root, int sum, int pre_sum, vector<vector<int>>& result, vector<int>& item) {
	if (!root)  return;
	pre_sum += root->val;
	item.push_back(root->val);
	if (!root->left && !root->right && pre_sum == sum)
		result.push_back(item);
	if (root->left) {
		searchDFS(root->left, sum, pre_sum, result, item);//递归
	}
	if (root->right) {
		searchDFS(root->right, sum, pre_sum, result, item);//递归
	}
	item.pop_back();//回溯

}

vector<vector<int>> pathSum(TreeNode* root, int sum) {
	vector<vector<int>> result;
	vector<int> item;
	searchDFS(root, sum, 0, result, item);
	return result;

}

int main(int argc, char *argv[]) {
	TreeNode a(5);
	TreeNode b(4);
	TreeNode c(8);
	TreeNode d(11);
	TreeNode e(13);
	TreeNode f(4);
	TreeNode g(7);
	TreeNode h(2);
	TreeNode i(5);
	TreeNode j(1);
	a.left = &b;
	a.right = &c;
	b.left = &d;
	c.left = &e;
	c.right = &f;
	d.left = &g;
	d.right = &h;
	f.left = &i;
	f.right = &j;
	vector<vector<int>> result = pathSum(&a, 22);

    for (int i = 0; i < result.size(); i++) {
		for (int j = 0; j < result[i].size(); j++)
			printf("[%d]", result[i][j]);
		printf("\n");
	}
}