- 博客(21)
- 资源 (5)
- 收藏
- 关注
RSS订阅原创 树-117. 填充每个节点的下一个右侧节点指针 II-PYTHON
class Solution: def processChild(self, childNode, prev, leftmost): if childNode: #没有子节点的情况下停止 if prev: #下层的上一次访问的节点，如果 prev.next = childNode e...
2020-02-27 16:55:40
146
原创 树-116. 填充每个节点的下一个右侧节点指针-PYTHON
只能用迭代法，因为下层的建立间接使用上层的关系，必须在上层建立完成后才可以进行下层的建立，有一个层级依赖的关系，所以不能用递归的方法。"""# Definition for a Node.class Node(object): def __init__(self, val=0, left=None, right=None, next=None): self.val ...
2020-02-27 16:19:26
132
原创 树-113. 路径总和 II-PYTHON
暴力法，注意列表的传递方式，精髓# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solut...
2020-02-27 15:18:52
180
原创 树-112. 路径总和-PYTHON
暴力解法：加的方式# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(obj...
2020-02-27 14:32:26
138
原创 树-108. 将有序数组转换为二叉搜索树-PYTHON
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): ...
2020-02-27 10:36:04
141
原创 树-104. 二叉树的最大深度-PYTHON
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): ...
2020-02-27 09:03:53
199
原创 树-102. 二叉树的层次遍历-PYTHON
迭代法：# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object):...
2020-02-26 16:22:49
206
原创 树-101. 对称二叉树-PYTHON
此题目分解成进阶版的判断子树相同即可# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Nonefrom coll...
2020-02-26 15:53:23
119
原创 树-100. 相同的树-PYTHON
迭代;# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object):...
2020-02-26 12:25:28
185
原创 树.-99. 恢复二叉搜索树.-PYTHON
迭代：# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object):...
2020-02-21 10:31:56
217
原创 树-98. 验证二叉搜索树-PYTHON
递归# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): ...
2020-02-19 14:44:05
206
原创 树-94. 二叉树的中序遍历-PYTHON
迭代# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): ...
2020-02-19 10:18:44
308
原创 字典树-676. 实现一个魔法字典-PYTHON
字典树-++class MagicDictionary: def __init__(self): """ Initialize your data structure here. """ self.trie = dict() #构建字典树 def buildDict(self, words): ...
2020-02-18 21:43:47
208
原创 字典树-648. 单词替换-PYTHON
前缀哈希class Solution(object): def replaceWords(self, dict, sentence): """ :type dict: List[str] :type sentence: str :rtype: str """ rootset = set(di...
2020-02-18 16:37:15
459
原创 字典树-472. 连接词-PYTHON
锁定长度，逐一遍历法class Solution(object): def findAllConcatenatedWordsInADict(self, words): """ :type words: List[str] :rtype: List[str] """ words = sorted(words,...
2020-02-18 15:50:17
472
原创 字典树-421. 数组中两个数的最大异或值-PYTHON
大佬解法，大佬脑子太牛逼了，我是服了，读者自行解读代码。class Solution(object): def findMaximumXOR(self, nums): """ :type nums: List[int] :rtype: int """ res = 0 mask = 0 ...
2020-02-18 13:09:14
286
原创 字典树-336. 回文对-PYTHON
利用逆置原有元素找搭配中间元素如果是回文元素，同时元素左边和右边互为逆置这样的字符串必定为回文，就是利用了这个原理进行class Solution(object): def palindromePairs(self, words): """ :type words: List[str] :rtype: List[List[int]]...
2020-02-17 16:50:42
197
原创 字典树-211. 添加与搜索单词 - 数据结构设计-PYTHON
利用字典集合，利用长度来简化比对的次数，效果还可以class WordDictionary(object): def __init__(self): """ Initialize your data structure here. """ self.d = collections.defaultdict(list) ...
2020-02-17 13:31:53
180
原创 字典树-208. 实现 Trie (前缀树)-PYTHON
python利用字典结构的简便版本（注意看注释理解）class Trie: def __init__(self): """ Initialize your data structure here. """ self.lookup = {} #构建一个字典结构，用于存储元素数据 def in...
2020-02-17 11:29:01
371
原创 二叉搜索树-1038. 从二叉搜索树到更大和树-PYTHON
利用python语言的引用特性。# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solut...
2020-02-16 13:52:32
146
原创 二叉搜索树-BiNode-PYTHON
两种方式都使用了个位数的额外存储空间，并且元素存储地址并没有发生变化，所以满足题意非递归方法# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# ...
2020-02-16 12:21:06
216
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人