LeetCode437.路径总和3

给定一个二叉树，它的每个结点都存放着一个整数值。

找出路径和等于给定数值的路径总数。

路径不需要从根节点开始，也不需要在叶子节点结束，但是路径方向必须是向下的（只能从父节点到子节点）。

二叉树不超过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

#include <iostream>
#include <queue>
#include<vector>
#include <cstdlib>
#include <cstring>
#include<algorithm>
using namespace std;
struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(NULL), right(NULL) {}
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

class Solution {
	int reuslt = 0;
public:
	//先序遍历每个结点 
    int pathSum(TreeNode* root, int sum) {
		if(!root) {
			return result;
		}	
		dfs(root,sum);
		pathSum(root->left,sum);
		pathSum(root->right,sum);
	}
	
	//以每个节点为起始点dfs寻找满足条件的路径
	void dfs(TreeNode *node,int sum) {
		if(!node) {
			return;
		}	
		sum -= node->val;
		if(sum == 0) {
			result++;
		}
		dfs(node->left,sum);
		dfs(node->right,sum);
	}
	
	TreeNode* inputTree()
	{
	    int n,count=0;
	    char item[100];
	    cin>>n;
	    if (n==0)
	        return NULL;
	    cin>>item;
	    TreeNode* root = new TreeNode(atoi(item));
	    count++;
	    queue<TreeNode*> nodeQueue;
	    nodeQueue.push(root);
	    while (count<n)
	    {
	        TreeNode* node = nodeQueue.front();
	        nodeQueue.pop();
	        cin>>item;
	        count++;
	        if (strcmp(item,"null")!=0)
	        {
	            int leftNumber = atoi(item);
	            node->left = new TreeNode(leftNumber);
	            nodeQueue.push(node->left);
	        }
	        if (count==n)
	            break;
	        cin>>item;
	        count++;
	        if (strcmp(item,"null")!=0)
	        {
	            int rightNumber = atoi(item);
	            node->right = new TreeNode(rightNumber);
	            nodeQueue.push(node->right);
	        }
	    }
	    return root;
	}
};

int main()
{
	TreeNode* root;
	root=inputTree();
	int sum;
    cin>>sum;
    int res=Solution().pathSum(root,sum);
    cout<<res<<endl;
	return 0; 
}