Leetcode 112. 路径总和
发布时间:2020-12-14 03:23:27 所属栏目:大数据 来源:网络整理
导读:/* * * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x),left(NULL),right(NULL) {} * }; */ class Solution { public : bool visit(TreeNode* r, int want, int now)
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x),left(NULL),right(NULL) {} * }; */ class Solution { public: bool visit(TreeNode* r,int want,int now) { if(r==NULL) return false; if(r->left==NULL && r->right==NULL) { //leaf return (now+r->val==want); } else { return visit(r->left,want,now+r->val) || visit(r->right,now+r->val); } } bool hasPathSum(TreeNode* root,int sum) { if(root == NULL) return false; return visit(root,sum,0); } }; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |