[Swift]LeetCode314. 二叉树的竖直遍历 $ Binary Tree Vertical Order Traversal

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10706508.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column).

If two nodes are in the same row and column, the order should be from left to right.

Examples:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its vertical order traversal as:

[
  [9],
  [3,15],
  [20],
  [7]
]

Given binary tree [3,9,20,4,5,2,7],

     3
   /   \
  9    20
 / \   / \
4   5 2   7

return its vertical order traversal as:

[
  [4],
  [9],
  [3,5,2],
  [20],
  [7]
]

---

给定二叉树，返回其节点值的垂直顺序遍历。（即自上而下逐列）。

 

如果两个节点在同一行和同一列中，则顺序应该从左到右。

 

实例：

给定的二叉树[3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

返回其垂直顺序遍历为：

[
  [9],
  [3,15],
  [20],
  [7]
]

给定二叉树

[3,9,20,4,5,2,7],

     3
   /   \
  9    20
 / \   / \
4   5 2   7

返回其垂直顺序遍历为：

[
  [4],
  [9],
  [3,5,2],
  [20],
  [7]
]

---

Solution:

public class TreeNode {
    public var val: Int
    public var left: TreeNode?
    public var right: TreeNode?
    public init(_ val: Int) {
        self.val = val
        self.left = nil
        self.right = nil
    }
}

class Solution {
    func verticalOrder(_ root: TreeNode?) ->[[Int]] {
        var res:[[Int]] = [[Int]]()
        if root == nil {return res}
        var m:[Int:[Int]] = [Int:[Int]]()
        var q:[(Int,TreeNode?)] = [(Int,TreeNode?)]()
        q.append((0, root))
        while(!q.isEmpty)
        {
            var a:(Int,TreeNode?) = q.first!
            q.popLast()
            m[a.0,default:[Int]()].append(a.1!.val)
            if a.1?.left != nil
            {
                q.append((a.0 - 1, a.1!.left))
            }
            if a.1?.right != nil
            {
                q.append((a.0 + 1, a.1!.right))
            }
        }
        for a in m
        {
            res.append(a.1)
        }
        return res             
    }
}