103. 二叉树的锯齿形层序遍历
给你二叉树的根节点 root ,返回其节点值的 锯齿形层序遍历 。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
示例 1:
输入:root = [3,9,20,null,null,15,7]
输出:[[3],[20,9],[15,7]]
示例 2:
输入:root = [1]
输出:[[1]]
示例 3:
输入:root = []
输出:[]
提示:
树中节点数目在范围 [0, 2000] 内
-100 <= Node.val <= 100
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
代码:
from leetcode_python.utils import *
class Solution:
def __init__(self):
pass
def zigzagLevelOrder(self, root: TreeNode) -> List[List[int]]:
if not root:return []
res = []
this_line = [root]
reverse = False
while this_line:
res_line = []
next_line = []
for node in this_line:
res_line.append(node.val)
if node.left:next_line.append(node.left)
if node.right:next_line.append(node.right)
if reverse:
res.append(res_line[::-1])
else:
res.append(res_line)
reverse = not reverse
this_line = next_line
return res
def levelOrder_102_二叉树的层序遍历(self, root: TreeNode) -> List[List[int]]:
if not root:return []
res = []
this_line = [root]
while this_line:
res_line = []
next_line = []
for node in this_line:
res_line.append(node.val)
if node.left:next_line.append(node.left)
if node.right:next_line.append(node.right)
res.append(res_line)
this_line = next_line
return res
def test(data_test):
s = Solution()
data = data_test # normal
# data = [list2node(data_test[0])] # list转node
return s.multiply(*data)
def test_obj(data_test):
result = [None]
obj = Solution(*data_test[1][0])
for fun, data in zip(data_test[0][1::], data_test[1][1::]):
if data:
res = obj.__getattribute__(fun)(*data)
else:
res = obj.__getattribute__(fun)()
result.append(res)
return result
if __name__ == '__main__':
datas = [
[],
]
for data_test in datas:
t0 = time.time()
print('-' * 50)
print('input:', data_test)
print('output:', test(data_test))
print(f'use time:{time.time() - t0}s')
备注:
GitHub:https://github.com/monijuan/leetcode_python
CSDN汇总:模拟卷Leetcode 题解汇总_卷子的博客-CSDN博客
可以加QQ群交流:1092754609
leetcode_python.utils详见汇总页说明
先刷的题,之后用脚本生成的blog,如果有错请留言,我看到了会修改的!谢谢!