LeetCode-Binary Tree Maximum Path Sum

题目

Binary Tree Maximum Path Sum

1
/ \
2   3

6

解法

/**
* Definition for binary tree
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int maxPathSum(TreeNode root) {
int result = 0;
Queue<TreeNode> q = new LinkedList<TreeNode>();
Queue<Integer> intQ = new LinkedList<Integer>();
TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
if(root == null)
return 0;
if(root.left == null && root.right == null)
return root.val;
q.offer(root);
intQ.offer(root.val);
while(q.isEmpty()){
TreeNode t = q.poll();
int tVal = (int) intQ.poll();
if(t.left!=null){
q.offer(t.left);
intQ.offer(tVal + t.left.val);
}
if(t.right!=null){
q.offer(t.right);
intQ.offer(tVal + t.right.val);
}
if(t.right == null || t.left == null){
map.put(tVal,tVal);
}
}
if(!map.isEmpty()){
result = Integer.valueOf(map.lastKey().toString());
map.remove(result);
}
if(!map.isEmpty())
result += Integer.valueOf(map.lastKey().toString());
return result;

}
}

结果

Submission Result: Wrong Answer

返回