5.4.4—二叉树的递归—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]
]

#include "BinaryTree.h"
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;
vector<int> path;
//===求出二叉树和为给定值的所有路径
void PathSum(BinaryTreeNode *proot, vector<int> &path, vector<vector<int>> &result,int sum)
{
	if (proot == NULL)
		return;
	path.push_back(proot->m_nValue);
	if (proot->m_pLeft == NULL&&proot->m_pRight == NULL)
	{
		if (proot->m_nValue == sum)
			result.push_back(path);
	}
	PathSum(proot->m_pLeft, path, result, sum-proot->m_nValue);
	PathSum(proot->m_pRight, path, result, sum-proot->m_nValue);
	path.pop_back();
}
vector<vector<int>> AllPathSum(BinaryTreeNode *proot, int sum)
{
	vector<vector<int>> result;
	vector<int> path;
	PathSum(proot, path, result,sum);
	return result;
}

// ====================测试代码====================
//            8
//        6      
//      5   7  
//   10  2
//  9

int main()
{
	//===
	BinaryTreeNode* pNode8 = CreateBinaryTreeNode(8);
	BinaryTreeNode* pNode6 = CreateBinaryTreeNode(6);
	BinaryTreeNode* pNode10 = CreateBinaryTreeNode(10);
	BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
	BinaryTreeNode* pNode7 = CreateBinaryTreeNode(7);
	BinaryTreeNode* pNode9 = CreateBinaryTreeNode(9);
	BinaryTreeNode* pNode2 = CreateBinaryTreeNode(2);

	ConnectTreeNodes(pNode8, pNode6, NULL);
	ConnectTreeNodes(pNode6, pNode5, pNode7);
	ConnectTreeNodes(pNode5, pNode10, pNode2);
	ConnectTreeNodes(pNode10, pNode9, NULL);
	
	//===
	//PrintTree(pNode8);
	//===
	int k = 21;
	vector<vector<int>> res = AllPathSum(pNode8, k);
	for (int i = 0; i < res.size(); i++)
	{
		for (int j = 0; j < res[i].size(); j++)
			cout << res[i][j] << " ";
		cout << endl;
	}
	DestroyTree(pNode8);
}