MCPcopy Create free account

hub / github.com/JiayangWu/LeetCode-Python / functions

Functions2,012 in github.com/JiayangWu/LeetCode-Python

⨍ Functions 2,012◇ Types & classes 1,570
↓ 1 callersMethodloop
(self, M, x)
0547.朋友圈/0547-朋友圈.py:30
↓ 1 callersMethodmaxProfit2
:type prices: List[int] :rtype: int
0188.买卖股票的最佳时机IV/0188-买卖股票的最佳时机IV.py:27
↓ 1 callersMethodmerge
:type intervals: List[List[int]] :rtype: List[List[int]]
0057.插入区间/0057-插入区间.py:10
↓ 1 callersMethodmerge
(self, l1, l2)
0148.排序链表/0148-排序链表.py:38
↓ 1 callersMethodmoveOutside
(self, cur_row, cur_col, n)
2120.执行所有后缀指令/2120-执行所有后缀指令.py:26
↓ 1 callersMethodmoveOutside
(self, cur_row, cur_col, n)
LeetCode-Python/2120.执行所有后缀指令/2120-执行所有后缀指令.py:26
↓ 1 callersMethodnext
:rtype: int
0284.顶端迭代器/0284-顶端迭代器.py:42
↓ 1 callersMethodnodeInMatrix
(self, row, col, m, n)
LeetCode-Python/2684.矩阵中移动的最大次数/2684-矩阵中移动的最大次数.py:41
↓ 1 callersMethodnodeInMatrix
(self, row, col, m, n)
2684.矩阵中移动的最大次数/2684-矩阵中移动的最大次数.py:41
↓ 1 callersMethodpartition
(self, nums, left, right)
0215.数组中的第K个最大元素/0215-数组中的第K个最大元素 2.py:18
↓ 1 callersMethodpartition
(self, nums, left, right)
0215.数组中的第K个最大元素/0215-数组中的第K个最大元素.py:18
↓ 1 callersMethodpossible
(self, num)
2698.求一个整数的惩罚数/2698-求一个整数的惩罚数.py:11
↓ 1 callersMethodpossible
(self, num)
LeetCode-Python/2698.求一个整数的惩罚数/2698-求一个整数的惩罚数.py:11
↓ 1 callersMethodpreorder
(self, cur)
1600.皇位继承顺序/1600-皇位继承顺序.py:33
↓ 1 callersMethodpreviousSolution
(self, words, word1, word2)
0245.最短单词距离III/0245-最短单词距离III.py:23
↓ 1 callersMethodremove
Removes a value from the set. Returns true if the set contained the specified element. :type val: int :rtype: bool
0380.常数时间插入、删除和获取随机元素/0380-常数时间插入、删除和获取随机元素.py:26
↓ 1 callersMethodremoveLastElement
(self)
0146.LRU缓存机制/0146-LRU缓存机制.py:60
↓ 1 callersMethodremoveLastNode
(self)
面试题16.25.LRU缓存/面试题16.25-LRU缓存.py:63
↓ 1 callersMethodreverse
(self, node)
LeetCode-Python/0092.反转链表II/0092-反转链表II.py:33
↓ 1 callersMethodreverseList
(self, head)
0143.重排链表/0143-重排链表.py:42
↓ 1 callersMethodsearchHelper
(self, dic, word)
0211.添加与搜索单词-数据结构设计/0211-添加与搜索单词-数据结构设计.py:31
↓ 1 callersMethodsortedArrayToBST
(self, nums: List[int])
LeetCode-Python/0109.有序链表转换二叉搜索树/0109-有序链表转换二叉搜索树.py:23
↓ 1 callersMethodunion
(self, p, q)
0261.以图判树/0261-以图判树.py:11
↓ 1 callersMethodunion
(self, p, q)
0323.无向图中连通分量的数目/0323-无向图中连通分量的数目.py:21
↓ 1 callersMethodunion
(self, p, q)
1559.二维网格图中探测环/1559-二维网格图中探测环.py:42
↓ 1 callersMethodunion
(self, p, q)
1584.连接所有点的最小费用/1584-连接所有点的最小费用.py:18
↓ 1 callersMethodunion
(self, p, q)
1319.连通网络的操作次数/1319-连通网络的操作次数.py:17
↓ 1 callersMethodwork
(self, input)
0241.为运算表达式设计优先级/0241-为运算表达式设计优先级.py:13
MethodCheckPermutation
(self, s1: str, s2: str)
面试题 01.02.判定是否互为字符重排/面试题 01.02-判定是否互为字符重排.py:2
MethodCheckPermutation
(self, s1: str, s2: str)
LeetCode-Python/面试题 01.02.判定是否互为字符重排/面试题 01.02-判定是否互为字符重排.py:2
MethodFront
Get the front item from the queue. :rtype: int
0622.设计循环队列/0622-设计循环队列.py:46
MethodHeight
(node)
0543.二叉树的直径/0543-二叉树的直径.py:16
MethodMyStack
Initialize your data structure here. */
0225.用队列实现栈/0225-用队列实现栈.cpp:4
MethodRear
Get the last item from the queue. :rtype: int
0622.设计循环队列/0622-设计循环队列.py:54
MethodSum
(weight, l)
0339.嵌套列表权重和/0339-嵌套列表权重和.py:50
MethodSumOfTree
(node)
1339.分裂二叉树的最大乘积/1339-分裂二叉树的最大乘积.py:16
Method__init__
Initialize your data structure here.
0705.设计哈希集合/0705-设计哈希集合.py:3
Method__init__
:type rectangle: List[List[int]]
1476.子矩形查询/1476-子矩形查询.py:3
Method__init__
:type capacity: int
1172.餐盘栈/1172-餐盘栈.py:3
Method__init__
(self, head: Optional[ListNode])
0382.链表随机节点/0382-链表随机节点.py:9
Method__init__
Initialize your data structure here.
0380.常数时间插入、删除和获取随机元素/0380-常数时间插入、删除和获取随机元素.py:4
Method__init__
:type nums: List[int]
0303.区域和检索-数组不可变/0303-区域和检索-数组不可变.py:3
Method__init__
Initialize your data structure here. :type size: int
0346.数据流中的移动平均值/0346-数据流中的移动平均值.py:4
Method__init__
(self)
0933.最近的请求次数/0933-最近的请求次数.py:3
Method__init__
:type length: int
1146.快照数组/1146-快照数组.py:3
Method__init__
(self, key, val, pre = None, next = None)
面试题16.25.LRU缓存/面试题16.25-LRU缓存.py:2
Method__init__
:type capacity: int
面试题16.25.LRU缓存/面试题16.25-LRU缓存.py:9
Method__init__
(self, root: Optional[TreeNode])
1261.在受污染的二叉树中查找元素/1261-在受污染的二叉树中查找元素.py:9
Method__init__
(self, edges)
0684.冗余连接/0684-冗余连接.py:2
Method__init__
Initialize your data structure here.
0820.单词的压缩编码/0820-单词的压缩编码.py:2
Method__init__
(self)
面试题59-II.队列的最大值/面试题59-II-队列的最大值.py:3
Method__init__
initialize your data structure here.
0155.最小栈/0155-最小栈 2.py:3
Method__init__
initialize your data structure here.
0155.最小栈/0155-最小栈.py:3
Method__init__
(self, n)
1115.交替打印FooBar/1115-交替打印FooBar.py:3
Method__init__
(self, book: List[str])
面试题 16.02.单词频率/面试题 16.02-单词频率.py:4
Method__init__
Initialize your data structure here. :type iterator: Iterator
0284.顶端迭代器/0284-顶端迭代器.py:23
Method__init__
Initialize your data structure here. :type nestedList: List[NestedInteger]
0341.扁平化嵌套列表迭代器/0341-扁平化嵌套列表迭代器.py:28
Method__init__
Initialize your data structure here.
0359.日志速率限制器/0359-日志速率限制器.py:3
Method__init__
(self, n)
0261.以图判树/0261-以图判树.py:2
Method__init__
:type root: TreeNode
0173.二叉搜索树迭代器/0173-二叉搜索树迭代器.py:10
Method__init__
:type kingName: str
1600.皇位继承顺序/1600-皇位继承顺序.py:2
Method__init__
Initialize your data structure here.
0677.键值映射/0677-键值映射.py:3
Method__init__
initialize your data structure here.
0295.数据流的中位数/0295-数据流的中位数.py:10
Method__init__
Initialize your data structure here. :type n: int
0348.判定井字棋胜负/0348-判定井字棋胜负.py:3
Method__init__
Initialize your data structure here.
0362.敲击计数器/0362-敲击计数器.py:4
Method__init__
(self, m)
0323.无向图中连通分量的数目/0323-无向图中连通分量的数目.py:2
Method__init__
Initialize your data structure here. Set the size of the queue to be k. :type k: int
0622.设计循环队列/0622-设计循环队列.py:3
Method__init__
(self)
1396.设计地铁系统/1396-设计地铁系统.py:3
Method__init__
Initialize your data structure here.
0212.单词搜索II/0212-单词搜索II.py:2
Method__init__
Initialize your data structure here.
0232.用栈实现队列/0232-用栈实现队列.py:3
Method__init__
Initialize your data structure here.
0170.两数之和III-数据结构设计/0170-两数之和III-数据结构设计.py:3
Method__init__
(self)
2336.无限集中的最小数字/2336-无限集中的最小数字.py:4
Method__init__
:type v: List[List[int]]
0251.展开二维向量/0251-展开二维向量.py:3
Method__init__
:type big: int :type medium: int :type small: int
1603.设计停车系统/1603-设计停车系统.py:3
Method__init__
:type big: int :type medium: int :type small: int
1603.设计停车系统/1603-设计停车系统 2.py:3
Method__init__
Initialize your data structure here. :type v1: List[int] :type v2: List[int]
0281.锯齿迭代器/0281-锯齿迭代器.py:3
Method__init__
(self)
0004.寻找两个有序数组的中位数/0004-寻找两个有序数组的中位数.py:3
Method__init__
(self)
2671.频率跟踪器/2671-频率跟踪器.py:4
Method__init__
(self)
1166.设计文件系统/1166-设计文件系统.py:3
Method__init__
(self, k: int, nums: List[int])
剑指 Offer II 059.数据流的第K大数值/剑指 Offer II 059-数据流的第K大数值.py:3
Method__init__
(self, head: Optional[ListNode])
LeetCode-Python/0382.链表随机节点/0382-链表随机节点.py:9
Method__init__
(self, root: Optional[TreeNode])
LeetCode-Python/1261.在受污染的二叉树中查找元素/1261-在受污染的二叉树中查找元素.py:9
Method__init__
(self)
LeetCode-Python/0155.最小栈/0155-最小栈.py:3
Method__init__
(self, book: List[str])
LeetCode-Python/面试题 16.02.单词频率/面试题 16.02-单词频率.py:4
Method__init__
(self)
LeetCode-Python/2336.无限集中的最小数字/2336-无限集中的最小数字.py:4
Method__init__
(self, big: int, medium: int, small: int)
LeetCode-Python/1603.设计停车系统/1603-设计停车系统.py:3
Method__init__
(self)
LeetCode-Python/2671.频率跟踪器/2671-频率跟踪器.py:4
Method__init__
(self, k: int, nums: List[int])
LeetCode-Python/剑指 Offer II 059.数据流的第K大数值/剑指 Offer II 059-数据流的第K大数值.py:3
Method__init__
(self, k: int, nums: List[int])
LeetCode-Python/0703.数据流中的第K大元素/0703-数据流中的第K大元素.py:3
Method__init__
(self, root: TreeNode)
LeetCode-Python/剑指 Offer II 055.二叉搜索树迭代器/剑指 Offer II 055-二叉搜索树迭代器.py:8
Method__init__
(self, n: int)
LeetCode-Python/1756.设计最近使用（MRU）队列/1756-设计最近使用（MRU）队列.py:3
Method__init__
initialize your data structure here.
LeetCode-Python/面试题 03.02.栈的最小值/面试题 03.02-栈的最小值.py:3
Method__init__
initialize your data structure here.
面试题30.包含min函数的栈/面试题30-包含min函数的栈.py:3
Method__init__
:type maxSize: int
1381.设计一个支持增量操作的栈/1381-设计一个支持增量操作的栈.py:3
Method__init__
(self)
1244.力扣排行榜/1244-力扣排行榜.py:5
Method__init__
(self, key, val, pre, nxt)
0146.LRU缓存机制/0146-LRU缓存机制.py:2
Method__init__
:type capacity: int
0146.LRU缓存机制/0146-LRU缓存机制.py:9
Method__init__
Initialize your data structure here @param maxNumbers - The maximum numbers that can be stored in the phone directory. :type
0379.电话目录/0379-电话目录.py:3
Method__init__
(self, grid)
1559.二维网格图中探测环/1559-二维网格图中探测环.py:22
Method__init__
(self, n)
1584.连接所有点的最小费用/1584-连接所有点的最小费用.py:3
← previousnext →101–200 of 2,012, ranked by callers