題目描述

給定一個(gè)二叉樹(shù)的?根節(jié)點(diǎn)?root，想象自己站在它的右側(cè)，按照從頂部到底部的順序，返回從右側(cè)所能看到的節(jié)點(diǎn)值。

輸入:?[1,2,3,null,5,null,4] 輸出:?[1,3,4] 輸入:?[1,null,3] 輸出:?[1,3] 輸入:?[] 輸出:?[]

解題思路

思路一：采用兩個(gè)隊(duì)列的方法，第一個(gè)隊(duì)列記錄第一層，第二個(gè)隊(duì)列記錄第二層。知道兩個(gè)隊(duì)列都為空的時(shí)候，遍歷結(jié)束。時(shí)間復(fù)雜度和空間復(fù)雜度都是O（N）

但這種方法有一個(gè)不太好的地方，就是代碼偏多，需要定義兩個(gè)隊(duì)列。面試官姐姐可能并不喜歡你的方法。

思路二：采用一個(gè)隊(duì)列+計(jì)數(shù)的方法，每個(gè)層次的遍歷，之前，都先統(tǒng)計(jì)一下這一層有多少個(gè)節(jié)點(diǎn)。如何統(tǒng)計(jì)呢？其實(shí)就是當(dāng)時(shí)隊(duì)列中元素的個(gè)數(shù)。例如，隊(duì)列有n個(gè)節(jié)點(diǎn)，當(dāng)這一層級(jí)的第n個(gè)節(jié)目點(diǎn)出棧的時(shí)候，將該節(jié)點(diǎn)計(jì)入結(jié)果。

解題核心代碼

class Solution {public List<Integer> rightSideView(TreeNode root) {LinkedList<Integer> res = new LinkedList<>();if (root==null){return res;}LinkedList<TreeNode> queue = new LinkedList<>();queue.offer(root);while (!queue.isEmpty()){int size = queue.size();for (int i = 0;i<size;i++){if (i==size-1){res.offer(queue.peek().val);}TreeNode node = queue.poll();if (node.left!=null){queue.offer(node.left);}if (node.right!=null){queue.offer(node.right);}}}return res;} }

解題延申——求左視圖

求左視圖也非常簡(jiǎn)單

if (i==size-1)? 這一行 改為?if (i==0)

即可。

解題本地調(diào)試代碼

??

import java.util.LinkedList; import java.util.List; import java.util.Queue;public class Solution199 {public static void main(String[] args) {String line = "[1,2,3,null,5,null,4]";TreeNode root = stringToTreeNode(line);List<Integer> retRight = new Solution199().rightSideView(root);List<Integer> retLeft = new Solution199().leftSideView(root);String outRight = integerArrayListToString(retRight);String outLeft = integerArrayListToString(retLeft);System.out.println("二叉樹(shù)為：" + line);System.out.println("右視圖為：" + outRight);System.out.println("左視圖為：" + outLeft);}public static TreeNode stringToTreeNode(String input) {input = input.trim();input = input.substring(1, input.length() - 1);if (input.length() == 0) {return null;}String[] parts = input.split(",");String item = parts[0];TreeNode root = new TreeNode(Integer.parseInt(item));Queue<TreeNode> nodeQueue = new LinkedList<>();nodeQueue.add(root);int index = 1;while (!nodeQueue.isEmpty()) {TreeNode node = nodeQueue.remove();if (index == parts.length) {break;}item = parts[index++];item = item.trim();if (!item.equals("null")) {int leftNumber = Integer.parseInt(item);node.left = new TreeNode(leftNumber);nodeQueue.add(node.left);}if (index == parts.length) {break;}item = parts[index++];item = item.trim();if (!item.equals("null")) {int rightNumber = Integer.parseInt(item);node.right = new TreeNode(rightNumber);nodeQueue.add(node.right);}}return root;}public static String integerArrayListToString(List<Integer> nums, int length) {if (length == 0) {return "[]";}StringBuilder result = new StringBuilder();for (int index = 0; index < length; index++) {Integer number = nums.get(index);result.append(Integer.toString(number)).append(", ");}return "[" + result.substring(0, result.length() - 2) + "]";}public static String integerArrayListToString(List<Integer> nums) {return integerArrayListToString(nums, nums.size());}public List<Integer> rightSideView(TreeNode root) {LinkedList<Integer> res = new LinkedList<>();if (root == null) {return res;}LinkedList<TreeNode> queue = new LinkedList<>();queue.offer(root);while (!queue.isEmpty()) {int size = queue.size();for (int i = 0; i < size; i++) {if (i == size - 1) {res.offer(queue.peek().val);}TreeNode node = queue.poll();if (node.left != null) {queue.offer(node.left);}if (node.right != null) {queue.offer(node.right);}}}return res;}public List<Integer> leftSideView(TreeNode root) {LinkedList<Integer> res = new LinkedList<>();if (root == null) {return res;}LinkedList<TreeNode> queue = new LinkedList<>();queue.offer(root);while (!queue.isEmpty()) {int size = queue.size();for (int i = 0; i < size; i++) {if (i == 0) {res.offer(queue.peek().val);}TreeNode node = queue.poll();if (node.left != null) {queue.offer(node.left);}if (node.right != null) {queue.offer(node.right);}}}return res;} }class TreeNode {int val;TreeNode left;TreeNode right;TreeNode() {}TreeNode(int val) {this.val = val;}TreeNode(int val, TreeNode left, TreeNode right) {this.val = val;this.left = left;this.right = right;} }

輸出為

總結(jié)

以上是生活随笔為你收集整理的Leetcode-199二叉树的右视图（二叉树左视图）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。