tree：二叉树根到叶子节点的路径和2

Leetcode, PathSum2

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

struct TreeNode
{
	int _val;
	TreeNode *_left;
	TreeNode *_right;
	TreeNode(int x) : _val(x), _left(nullptr), _right(nullptr) { }
};

void pathSum(TreeNode *root, int sum, vector<int> &cur, vector<vector<int>> &result)
{
	if (root == nullptr) return;

	cur.push_back(root->_val);
	if (root->_left == nullptr && root->_right == nullptr)
	{
		if (root->_val == sum)
			result.push_back(cur);
	}

	pathSum(root->_left, sum - root->_val, cur, result);
	pathSum(root->_right, sum - root->_val, cur, result);

	cur.pop_back();
}
//时间复杂度O（n）,空间复杂度O（logn）
vector<vector<int>> solution(TreeNode *root, int sum)
{
	vector<vector<int>> result;
	vector<int> cur;	//中间结果
	pathSum(root, sum, cur, result);
	return result;
}

int main()
{
	TreeNode *node5 = new TreeNode(5);
	TreeNode *node4 = new TreeNode(4);
	TreeNode *node8 = new TreeNode(8);
	TreeNode *node11 = new TreeNode(11);
	TreeNode *node7 = new TreeNode(7);
	TreeNode *node2 = new TreeNode(2);
	TreeNode *node13 = new TreeNode(13);
	TreeNode *node4_2 = new TreeNode(4);
	TreeNode *node5_2 = new TreeNode(5);
	TreeNode *node1 = new TreeNode(1);
	node5->_left = node4;
	node5->_right = node8;
	node4->_left = node11;
	node11->_left = node7;
	node11->_right = node2;
	node8->_left = node13;
	node8->_right = node4_2;
	node4_2->_left = node5_2;
	node4_2->_right = node1;
	auto res = solution(node5, 22); //{5,4,11,2} {5,8,4,5}

	return 0;
}