[Swift]LeetCode655. 输出二叉树 | Print Binary Tree

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

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

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

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

Print a binary tree in an m*n 2D string array following these rules:

1. The row number m should be equal to the height of the given binary tree.
2. The column number n should always be an odd number.
3. The root node's value (in string format) should be put in the exactly middle of the first row it can be put. The column and the row where the root node belongs will separate the rest space into two parts (left-bottom part and right-bottom part). You should print the left subtree in the left-bottom part and print the right subtree in the right-bottom part. The left-bottom part and the right-bottom part should have the same size. Even if one subtree is none while the other is not, you don't need to print anything for the none subtree but still need to leave the space as large as that for the other subtree. However, if two subtrees are none, then you don't need to leave space for both of them.
4. Each unused space should contain an empty string "".
5. Print the subtrees following the same rules.

Example 1:

Input:
     1
    /
   2
Output:
[["", "1", ""],
 ["2", "", ""]]

Example 2:

Input:
     1
    / \
   2   3
    \
     4
Output:
[["", "", "", "1", "", "", ""],
 ["", "2", "", "", "", "3", ""],
 ["", "", "4", "", "", "", ""]]

Example 3:

Input:
      1
     / \
    2   5
   / 
  3 
 / 
4 
Output:

[["",  "",  "", "",  "", "", "", "1", "",  "",  "",  "",  "", "", ""]
 ["",  "",  "", "2", "", "", "", "",  "",  "",  "",  "5", "", "", ""]
 ["",  "3", "", "",  "", "", "", "",  "",  "",  "",  "",  "", "", ""]
 ["4", "",  "", "",  "", "", "", "",  "",  "",  "",  "",  "", "", ""]]

Note: The height of binary tree is in the range of [1, 10].

---

在一个 m*n 的二维字符串数组中输出二叉树，并遵守以下规则：

1. 行数 m 应当等于给定二叉树的高度。
2. 列数 n 应当总是奇数。
3. 根节点的值（以字符串格式给出）应当放在可放置的第一行正中间。根节点所在的行与列会将剩余空间划分为两部分（左下部分和右下部分）。你应该将左子树输出在左下部分，右子树输出在右下部分。左下和右下部分应当有相同的大小。即使一个子树为空而另一个非空，你不需要为空的子树输出任何东西，但仍需要为另一个子树留出足够的空间。然而，如果两个子树都为空则不需要为它们留出任何空间。
4. 每个未使用的空间应包含一个空的字符串""。
5. 使用相同的规则输出子树。

示例 1:

输入:
     1
    /
   2
输出:
[["", "1", ""],
 ["2", "", ""]]

示例 2:

输入:
     1
    / \
   2   3
    \
     4
输出:
[["", "", "", "1", "", "", ""],
 ["", "2", "", "", "", "3", ""],
 ["", "", "4", "", "", "", ""]]

示例 3:

输入:
      1
     / \
    2   5
   / 
  3 
 / 
4 
输出:
[["",  "",  "", "",  "", "", "", "1", "",  "",  "",  "",  "", "", ""]
 ["",  "",  "", "2", "", "", "", "",  "",  "",  "",  "5", "", "", ""]
 ["",  "3", "", "",  "", "", "", "",  "",  "",  "",  "",  "", "", ""]
 ["4", "",  "", "",  "", "", "", "",  "",  "",  "",  "",  "", "", ""]]

注意: 二叉树的高度在范围 [1, 10] 中。

---

16ms

/**
 * Definition for a binary tree node.
 * 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 printTree(_ root: TreeNode?) -> [[String]] {
        let h = getHeight(root)
        let w = 2 << (h - 1) - 1
        var res = [[String]]()
        for _ in 0 ..< h {
            let row = [String].init(repeating: "", count: w)
            res.append(row)
        }
        fill(root, &res, 0, 0, w - 1)
        return res
    }
    
    private func getHeight(_ root: TreeNode?) -> Int {
        guard let node = root else {
            return 0
        }
        return max(getHeight(node.left), getHeight(node.right)) + 1
    }
    
    private func fill(_ root: TreeNode?, _ grid: inout [[String]], _ h: Int, _ l: Int, _ r: Int) {
        guard let node = root else {
            return
        }
        let mid = (l + r) / 2
        grid[h][mid] = String(node.val)
        fill(node.left, &grid, h + 1, l, mid - 1)
        fill(node.right, &grid, h + 1, mid + 1, r)
    }
}

---

Runtime: 20 ms

Memory Usage: 19.2 MB

/**
 * Definition for a binary tree node.
 * 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 printTree(_ root: TreeNode?) -> [[String]] {
        var h:Int = getHeight(root)       
        var w:Int = Int(pow(2,Double(h)) - 1)
        var res:[[String]] = [[String]](repeating:[String](repeating:String(),count:w),count:h)
        helper(root, 0, w - 1, 0, h, &res)
        return res
    }
    
    func getHeight(_ node: TreeNode?) -> Int
    {
        if node == nil {return 0}
        return 1 + max(getHeight(node?.left), getHeight(node?.right))
    }
    
    func helper(_ node: TreeNode?,_ i:Int,_ j:Int,_ curH:Int,_ height:Int,_ res:inout [[String]])
    {
        if node == nil || curH == height {return}
        res[curH][(i + j) / 2] = String(node!.val)
        helper(node!.left, i, (i + j) / 2, curH + 1, height, &res)
        helper(node!.right, (i + j) / 2 + 1, j, curH + 1, height, &res)
    }
}

---

20ms

/**
 * Definition for a binary tree node.
 * 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 printTree(_ root: TreeNode?) -> [[String]] {
        let depth = depthTree(root)
        return helper(depth, root)
    }
    
    private func helper(_ depth: Int, _ root: TreeNode?) -> [[String]] {
        if depth <= 0 { return [] }
        let width = Int(pow(2, Double(depth))) - 1
        var str = [String](repeating: "", count: width)     
        if let root = root {
            let middle = width/2
            str[middle] = "\(root.val)"
        }
        if depth == 1 { return [str] }
        var res = [[String]]()
        res.append(str)
        let resLeft = helper(depth - 1, root?.left)
        let resRight = helper(depth - 1, root?.right)
        for i in 0..<resLeft.count {
            res.append(resLeft[i] + [""] + resRight[i])
        }
        return res
    }
    
    private func depthTree(_ root: TreeNode?) -> Int {
        guard let root = root else { return 0 }
        return 1 + max(depthTree(root.left), depthTree(root.right))
    }
}