·
·
文章目录
  1. 题目介绍
  2. 复杂度
  3. 解题思路

Populating Next Right Pointers in Each Node

题目介绍

LeetCode 116. Populating Next Right Pointers in Each Node

复杂度

时间复杂度: O(n), 空间复杂度: O(n)

解题思路

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
public class Node {
public var val: Int
public var left: Node?
public var right: Node?
public var next: Node?
public init(_ val: Int) {
self.val = val
self.left = nil
self.right = nil
self.next = nil
}
}

class Solution {
func connect(_ root: Node?) -> Node? {
dfs(root)
return root
}

func dfs(_ root: Node?) {
guard let root = root else {
return
}
var left = root.left
var right = root.right
while left != nil {
left!.next = right
left = left?.right
right = right?.left
}
dfs(root.left)
dfs(root.right)
}
}
**版权声明**

Ivan’s Blog by Ivan Ye is licensed under a Creative Commons BY-NC-ND 4.0 International License.
叶帆创作并维护的叶帆的博客博客采用创作共用保留署名-非商业-禁止演绎4.0国际许可证

本文首发于Ivan’s Blog | 叶帆的博客博客( http://yeziahehe.com ),版权所有,侵权必究。

本文链接:http://yeziahehe.com/2020/05/06/PopulatingNextRightPointersInEachNode/

支持一下
扫一扫,支持yeziahehe
  • 微信扫一扫
  • 支付宝扫一扫