本文共 1221 字,大约阅读时间需要 4 分钟。
思路:
就是层次遍历。在没排最结尾的位置添加一个标志。然后把最后一个输出就好了/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public ListrightSideView(TreeNode root) { List result=new LinkedList (); if(root==null) { return result; } Queue queue=new LinkedList (); queue.add(root); queue.add(null); TreeNode current; TreeNode cache=root; while(queue.size()>=1) { current=queue.poll(); if(current==null) { queue.add(null); result.add(cache.val); if(queue.size()==1) { break; } else { continue; } } cache=current; if(current.left!=null) { queue.add(current.left); } if(current.right!=null) { queue.add(current.right); } } return result; }}
转载地址:http://bduvb.baihongyu.com/