LeetCode-Path_Sum_III

最新推荐文章于 2019-03-16 22:53:45 发布

学习NLP的Annie

最新推荐文章于 2019-03-16 22:53:45 发布

阅读量128

点赞数

分类专栏： LeetCode‘Exercise 文章标签： Leet Code Path Sum III

本文链接：https://blog.csdn.net/tel_annie/article/details/80334399

版权

LeetCode‘Exercise 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

题目：

You are given a binary tree in which each node contains an integer value.

Find the number of paths that sum to a given value.

The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).

The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.

Example:

root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8

      10
     /  \
    5   -3
   / \    \
  3   2   11
 / \   \
3  -2   1

Return 3. The paths that sum to 8 are:

1.  5 -> 3
2.  5 -> 2 -> 1
3. -3 -> 11

翻译：

你被给定一棵每个节点包含一个数值的二叉树。

找到路径和为给定数字的路径个数。

这个路径不需要从根节点开始或者到叶节点结束，但是它必须是向下的（从父亲节点到孩子节点）。

这棵树有不超过1000个节点，并且值的范围在-1000000到1000000。

例子：

root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8

      10
     /  \
    5   -3
   / \    \
  3   2   11
 / \   \
3  -2   1

返回 3. 路径和为 8 的有:

1.  5 -> 3
2.  5 -> 2 -> 1
3. -3 -> 11

思路：

利用前序遍历，对每个节点处理，利用pre来记录之前路径的和，然后定义cur为pre加上当前节点值，如果cur等于sum，那么返回结果时要加1，然后对当前节点的左右子节点进行递归。

C++代码（Visual Studio 2017）：

#include "stdafx.h"
#include <iostream>
using namespace std;

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

class Solution {
public:
	int pathSum(TreeNode* root, int sum) {
		if (root == NULL)
			return 0;
		return sumUp(root, 0, sum) + pathSum(root->left, sum) + pathSum(root->right, sum);
	}
private:
	int sumUp(TreeNode* node, int pre, int sum) {
		if (node == NULL)
			return 0;
		int cur = pre + node->val;
		return (cur == sum) + sumUp(node->left, cur, sum) + sumUp(node->right, cur, sum);
	}
};

int main()
{
	Solution s;
	int sum = 8;
	TreeNode* root = new TreeNode(10);
	root->left = new TreeNode(5);
	root->right = new TreeNode(-3);
	root->left->left = new TreeNode(3);
	root->left->right = new TreeNode(2);
	root->right->right = new TreeNode(11);
	root->left->left->left = new TreeNode(3);
	root->left->left->right = new TreeNode(-2);
	root->left->right->right = new TreeNode(1);
	int result;
	result = s.pathSum(root, sum);
	cout << result;
    return 0;
}