二叉树
BlackMan_阿伟
不积跬步无以至千里
展开
-
《Leetcode of July》
1104. 二叉树寻路 class Solution: def pathInZigZagTree(self, label: int) -> List[int]: depth = 0 for i in range(1,10000): if label>=2**(i-1) and label<2**(i): depth = i break原创 2021-07-29 15:12:25 · 148 阅读 · 0 评论 -
《Leetcode of July》
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def distanceK(self, root: TreeNode, target: TreeNode, k: int) -> Li...原创 2021-07-28 11:41:19 · 139 阅读 · 0 评论