Middle-题目37:199. Binary Tree Right Side View

原创 2016年05月31日 15:59:37

题目原文:
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

For example:
Given the following binary tree,

   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---

You should return [1, 3, 4].
题目大意:
给出一个二叉树,假设你的视线从右边看过去,返回从上到下你看到的节点(不在最右侧的都被挡上了)。
题目分析:
按层次遍历,求每层最后一个节点即可(即队列中改变层号的节点),在Easy-题目27基础上修改代码即可。
源码:(language:java)

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> rightSideView(TreeNode root) {

        Queue<TreeNode> queue=new LinkedList<TreeNode>();
        Queue<Integer> levelqueue=new LinkedList<Integer>();
        List<Integer> list=new ArrayList<Integer>();
         if(root == null)
            return list;
        queue.add(root);
        levelqueue.add(1);
        //list.add(root.val);

        while(!queue.isEmpty()) {
            TreeNode current = queue.remove();
            int curLevel=levelqueue.remove();

            if(current.left!=null) {
                queue.add(current.left);
                levelqueue.add(curLevel+1);
            }
            if(current.right!=null) {
                queue.add(current.right);
                levelqueue.add(curLevel+1);
            }
            if(levelqueue.isEmpty() == true || levelqueue.peek() == curLevel + 1)
                list.add(current.val);
        }
        return list;
    }
}

成绩:
3ms,beats 10.90%,众数3ms,40.54%

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

【LeetCode-面试算法经典-Java实现】【199-Binary Tree Right Side View(从右边看二叉树)】

【199-Binary Tree Right Side View(从右边看二叉树】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】代码下载【https://github.com/W...

[JAVA]LeetCode199 Binary Tree Right Side View

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nod...
  • fumier
  • fumier
  • 2015年04月09日 19:41
  • 701

LeetCode题解-199-Binary Tree Right Side View

原题 原题链接:https://leetcode.com/problems/binary-tree-right-side-view/ 解法概览 解法1:迭代法,BFS 解法2:...

[LeetCode]199.Binary Tree Right Side View

题目Given a binary tree, imagine yourself standing on the right side of it, return the values of the n...

[Leetcode] 199. Binary Tree Right Side View 解题报告

题目: Given a binary tree, imagine yourself standing on the right side of it, return the values o...

LeetCode - 199. Binary Tree Right Side View

题目要求写出Binary Tree从右侧看的情况,我们首先可以想到的是基于Level Order Traversal的方法,我们只需要将每一层最右侧的节点加入结果中即可,这种思路的代码如下: pub...

210. Course Schedule II\199. Binary Tree Right Side View\279. Perfect Squares

Course Schedule II DESCRIPTION IMPLEMENTATION210. Course Schedule IIDESCRIPTIONThere are a total of ...

Leetcode 199. Binary Tree Right Side View

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nod...

Binary Tree Right Side View - LeetCode 199

题目描述: Given a binary tree, imagine yourself standing on the right side of it, return the values of ...
  • bu_min
  • bu_min
  • 2015年06月10日 19:26
  • 232

【Leetcode】Binary Tree Right Side View #199

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nod...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Middle-题目37:199. Binary Tree Right Side View
举报原因:
原因补充:

(最多只允许输入30个字)