112 Path Sum
2015-03-17 11:49
176 查看
方法一:(深度优先搜索遍历,注意边界条件处理,以及初始根为空的情况) class Solution { public: bool hasPathSum(TreeNode *root, int sum) { bool f=false; if(root==NULL) return false; if(root->left==NULL&&root->right==NULL){ if(sum==root->val) return true; else return false; } if(root->left!=NULL){ f=f||hasPathSum(root->left, sum-root->val); } if(root->right!=NULL){ f=f||hasPathSum(root->right, sum-root->val); } return f; } };
相关文章推荐
- LeetCode 112 Path Sum
- Leetcode 笔记 112 - Path Sum
- [leetcode 112]Path Sum
- 【leetcode】【112】Path Sum
- leetcode 112 Path Sum
- Leetcode 112 Path Sum
- 112. Path Sum(DFS)
- Leetcode 112 path sum & 113 path sum 2
- [LeetCode#110, 112, 113]Balanced Binary Tree, Path Sum, Path Sum II
- leetcode 112: Path Sum
- Leetcoede 112 Path Sum 二叉树
- Leetcode 112 Path Sum
- 【LeetCode】112 - Path Sum
- leetcode112 Path Sum
- LeetCode112 Path Sum
- 第十三周:112. Path Sum
- [Leetcode 11] 112 Path Sum
- leetcode_question_112 Path Sum
- LeetCode112——Path Sum
- [LeetCode 112] Path Sum