上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 51 下一页
摘要: 方法一:迭代代码一: class Solution(object): # 迭代 def preorderTraversal(self, root): """ :type root: TreeNode :rtype: List[int] """ if not root: return [] pre_s 阅读全文
posted @ 2020-08-30 16:58 人间烟火地三鲜 阅读(110) 评论(0) 推荐(0)
摘要: class Solution(object): def sumNumbers(self, root): """ :type root: TreeNode :rtype: int """ if not root: return 0 return self.dfs(root, 0) def dfs(se 阅读全文
posted @ 2020-08-30 16:54 人间烟火地三鲜 阅读(140) 评论(0) 推荐(0)
摘要: class Solution(object): def flatten(self, root): """ :type root: TreeNode :rtype: None Do not return anything, modify root in-place instead. """ if no 阅读全文
posted @ 2020-08-30 16:53 人间烟火地三鲜 阅读(102) 评论(0) 推荐(0)
摘要: 方法一 class Solution(object): def pathSum(self, root, sum): """ :type root: TreeNode :type sum: int :rtype: List[List[int]] """ ans = [] if not root: re 阅读全文
posted @ 2020-08-30 16:51 人间烟火地三鲜 阅读(80) 评论(0) 推荐(0)
摘要: class Solution(object): def hasPathSum(self, root, sumt): """ :type root: TreeNode :type sumt: int :rtype: bool """ if not root and sum: return False 阅读全文
posted @ 2020-08-30 16:48 人间烟火地三鲜 阅读(122) 评论(0) 推荐(0)
摘要: 方法一:自底向上 class Solution(object): # 法一:自底向上 def isBalanced(self, root): """ :type root: TreeNode :rtype: bool """ return self.helper(root) >= 0 def hel 阅读全文
posted @ 2020-08-30 16:45 人间烟火地三鲜 阅读(121) 评论(0) 推荐(0)
摘要: Python3代码 class Solution: def sortedArrayToBST(self, nums: List[int]) -> TreeNode: if not nums: return None mid = len(nums) // 2 root = TreeNode(nums[ 阅读全文
posted @ 2020-08-30 16:39 人间烟火地三鲜 阅读(159) 评论(0) 推荐(0)
摘要: class Solution(object): def levelOrderBottom(self, root): """ :type root: TreeNode :rtype: List[List[int]] """ if not root: return [] level_queue = [] 阅读全文
posted @ 2020-08-30 16:36 人间烟火地三鲜 阅读(120) 评论(0) 推荐(0)
摘要: class Solution(object): def buildTree(self, inorder, postorder): """ :type inorder: List[int] :type postorder: List[int] :rtype: TreeNode """ # 用字典存储中 阅读全文
posted @ 2020-08-30 16:32 人间烟火地三鲜 阅读(117) 评论(0) 推荐(0)
摘要: class Solution(object): def buildTree(self, preorder, inorder): """ :type preorder: List[int] :type inorder: List[int] :rtype: TreeNode """ self.prein 阅读全文
posted @ 2020-08-30 16:30 人间烟火地三鲜 阅读(130) 评论(0) 推荐(0)
上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 51 下一页