199. 二叉树的右视图 (Swift版本)

题目

给定一个二叉树的 根节点 root，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。

示例1:

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

示例2:

输入: [1,null,3]
输出: [1,3]

示例3:

输入: []
输出: []

提示/限定条件

• 二叉树的节点个数的范围是 [0,100]
• -100 <= Node.val <= 100

Show The Swift Code

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public var val: Int
 *     public var left: TreeNode?
 *     public var right: TreeNode?
 *     public init() { self.val = 0; self.left = nil; self.right = nil; }
 *     public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
 *     public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
 *         self.val = val
 *         self.left = left
 *         self.right = right
 *     }
 * }
 */
class Solution {
    func rightSideView(_ root: TreeNode?) -> [Int] {
        var result = [[Int]]()
        guard let root = root else {
            return [Int]()
        }
        var levelResult = [Int]()
        var levelNodes: [TreeNode] = [root]
        var nextLevelNodes = [TreeNode]()
        while !levelNodes.isEmpty {
            let item = levelNodes.removeFirst()
            levelResult.append(item.val)
            if let left = item.left {
                nextLevelNodes.append(left)
            }
            if let right = item.right {
                nextLevelNodes.append(right)
            }
            if levelNodes.isEmpty {
                result.append(levelResult)
                levelResult.removeAll()
                levelNodes.append(contentsOf: nextLevelNodes)
                nextLevelNodes.removeAll()
            }
        }
        return result.map { $0.last! }

    }
}