（LeetCode）Path Sum空指针异常问题
2014-11-30 15:16
316 查看
在做LeetCode的
代码：
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean Tree(TreeNode node, int result){
if(node.left==null&&node.right==null){
if(result-node.val==0)
return true;
}else{
Tree(node.left,result-node.val);
Tree(node.right,result-node.val);
}
return false;
}
public boolean hasPathSum(TreeNode root, int sum) {
if(root==null){
return false;
}else{
return Tree(root,sum);
}
}
}
错误：
Path Sum
这一道题的时候遇到遇到空指针的错误，请大神指导代码：
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean Tree(TreeNode node, int result){
if(node.left==null&&node.right==null){
if(result-node.val==0)
return true;
}else{
Tree(node.left,result-node.val);
Tree(node.right,result-node.val);
}
return false;
}
public boolean hasPathSum(TreeNode root, int sum) {
if(root==null){
return false;
}else{
return Tree(root,sum);
}
}
}
错误：
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 之K-Sum 问题(个人理解) 双指针大法(总结)
- LeetCode 二叉树路径问题 Path SUM（①②③）总结
- [LeetCode] Path Sum II, 关于效率的两个问题： vector还是queue？ 传递引用还是拷贝？
- leetCode 113. Path Sum II 二叉树问题 | Medium
- DP问题：leetcode（64） Minimum Path Sum
- Leetcode之Minimum Path Sum 问题
- leetcode 32: Minimum Path Sum
- [Leetcode] Path Sum II
- LeetCode: Path Sum
- LeetCode: Path Sum II
- [LeetCode] Path Sum II 解题报告
- LeetCode Path Sum II
- [LeetCode] Binary Tree Maximum Path Sum
- 解决 RNI接口调用出现的异常UnsatisfiedLinkError: no jtokyocabinet in java.library.path 及 wrong ELF class: ELFCLASS64问题
- [leetcode]Binary Tree Maximum Path Sum
- leetcode4: Binary Tree Maximum Path Sum
- LeetCode : Minimum Path Sum
- LeetCode: Minimum Path Sum
- ConcurrentHashMap报空指针异常问题
- [LeetCode] Path Sum II