不是很难 写的有一点点小问题
什么时候我能逢题就做出来做对呢
class Solution {
List<Integer> list = new ArrayList<>();
public List<Integer> rightSideView(TreeNode root) {
rightview(root, 0);
return list;
}
public void rightview(TreeNode root,int deep){
if (root == null) return;
if(deep == list.size()) list.add(root.val);
deep ++;
rightview(root.right, deep);
rightview(root.left, deep);
}
}