11 2019 档案

摘要:` 阅读全文
posted @ 2019-11-12 17:13 两只老虎111 阅读(260) 评论(0) 推荐(0)
摘要:```python= def level_traverse_tree(node: TreeNode): ret = [] if node is not None: cur = [node] while cur: tmp = [] next_cur = [] for item in cur: if item: tmp.append(item.value) next_cur.extend([item. 阅读全文
posted @ 2019-11-06 13:48 两只老虎111 阅读(135) 评论(0) 推荐(0)