MCPcopy Create free account

hub / github.com/acm-clan/algorithm-stone / functions

Functions957 in github.com/acm-clan/algorithm-stone

⨍ Functions 957◇ Types & classes 462
MethodexclusiveTime
user/leetcode/636.函数的独占时间.cpp:10
Methodf
user/leetcode/745.前缀和后缀搜索.cpp:68
MethodfallingSquares
user/leetcode/699.掉落的方块.cpp:10
Methodfib
user/leetcode/509.斐波那契数.cpp:10
Methodfind
user/leetcode/1261.在受污染的二叉树中查找元素.cpp:23
Methodfind132pattern
user/leetcode/456.132-模式.cpp:10
MethodfindAllConcatenatedWordsInADict
user/leetcode/472.连接词.cpp:39
MethodfindBottomLeftValue
user/leetcode/513.找树左下角的值.cpp:21
MethodfindCheapestPrice
user/leetcode/787.k-站中转内最便宜的航班.cpp:10
MethodfindCircleNum
user/leetcode/547.省份数量.cpp:29
MethodfindContentChildren
(self, g: List[int], s: List[int])
user/leetcode/455.分发饼干.py:9
MethodfindDisappearedNumbers
user/leetcode/448.找到所有数组中消失的数字.cpp:10
MethodfindFrequentTreeSum
user/leetcode/508.出现次数最多的子树元素和.cpp:19
MethodfindKthLargest
user/leetcode/215.数组中的第k个最大元素.cpp:12
MethodfindLUSlength
user/leetcode/521.最长特殊序列-ⅰ.cpp:10
MethodfindLadders
user/leetcode/126.单词接龙-ii.cpp:10
MethodfindMaximizedCapital
user/leetcode/502.ipo.cpp:10
MethodfindMaximumXOR
user/leetcode/421.数组中两个数的最大异或值.cpp:73
MethodfindMedian
user/leetcode/295.数据流的中位数.cpp:43
MethodfindMedianSortedArrays
user/leetcode/4.寻找两个正序数组的中位数.cpp:16
MethodfindMin
user/leetcode/154.寻找旋转排序数组中的最小值-ii.cpp:10
MethodfindMode
user/leetcode/501.二叉搜索树中的众数.cpp:47
MethodfindPaths
user/leetcode/576.出界的路径数.cpp:13
MethodfindRedundantConnection
user/leetcode/684.冗余连接.cpp:10
MethodfindRightInterval
user/leetcode/436.寻找右区间.cpp:32
MethodfindSecondMinimumValue
user/leetcode/671.二叉树中第二小的节点.cpp:21
MethodfindSubstring
user/leetcode/30.串联所有单词的子串.cpp:10
MethodfindTarget
user/leetcode/653.两数之和-iv-输入-bst.cpp:36
MethodfindTilt
user/leetcode/563.二叉树的坡度.cpp:29
MethodfindWord
user/leetcode/336.回文对.cpp:34
MethodfindWords
user/leetcode/212.单词搜索-ii.cpp:57
Methodfind_element
(self, node, val, new_val)
animations/segmenttree.py:137
Methodfindlocation
user/leetcode/436.寻找右区间.cpp:10
MethodfirstBadVersion
user/leetcode/278.第一个错误的版本.cpp:19
MethodfirstUniqChar
user/leetcode/387.字符串中的第一个唯一字符.cpp:10
Methodflatten
user/leetcode/430.扁平化多级双向链表.cpp:14
Methodflatten
user/leetcode/114.二叉树展开为链表.cpp:33
Methodfollow
Follower follows a followee. If the operation is invalid, it should be a * no-op. */
user/leetcode/355.设计推特.cpp:40
MethodfrequencySort
user/leetcode/451.根据字符出现频率排序.cpp:22
MethodfullJustify
user/leetcode/68.文本左右对齐.cpp:10
Methodfun
user/leetcode/745.前缀和后缀搜索.cpp:35
MethodfurthestBuilding
user/leetcode/1642.可以到达的最远建筑.cpp:10
Methodgenerate
user/leetcode/118.杨辉三角.cpp:12
MethodgenerateParenthesis
user/leetcode/22.括号生成.cpp:10
MethodgenerateTrees
user/leetcode/95.不同的二叉搜索树-ii.cpp:21
Methodget
(self, key, timestamp)
user/leetcode/981.基于时间的键值存储.py:15
Methodget
Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
user/leetcode/707. 设计链表.cpp:25
Methodget
templates/red-black-tree.cpp:146
MethodgetAllElements
user/leetcode/1305.两棵二叉搜索树中的所有元素.cpp:19
MethodgetCoprimes
user/leetcode/1766.互质树.cpp:10
MethodgetDecimalValue
user/leetcode/1290.二进制链表转整数.cpp:18
MethodgetFront
Get the front item from the deque. */
user/leetcode/641.设计循环双端队列.cpp:36
MethodgetInheritanceOrder
user/leetcode/1600.皇位继承顺序.cpp:22
MethodgetInternal
templates/red-black-tree.cpp:132
MethodgetInternal
templates/rb.cpp:151
MethodgetIntersectionNode
user/leetcode/160. 相交链表.cpp:20
MethodgetIntervals
user/leetcode/352.将数据流变为多个不相交区间.cpp:65
MethodgetLeft
user/leetcode/327.区间和的个数.cpp:60
MethodgetMin
user/leetcode/155.最小栈.cpp:27
MethodgetMinDistSum
user/leetcode/1515.服务中心的最佳位置.cpp:10
MethodgetMinimumDifference
user/leetcode/530.二叉搜索树的最小绝对差.cpp:26
MethodgetNewsFeed
Retrieve the 10 most recent tweet ids in the user's news feed. Each item * in the news feed must be posted by users who the user followed or by the
user/leetcode/355.设计推特.cpp:26
MethodgetRandom
Returns a random node's value. */
user/leetcode/382.链表随机节点.cpp:29
MethodgetRear
Get the last item from the deque. */
user/leetcode/641.设计循环双端队列.cpp:41
MethodgetSkyline
user/leetcode/218.天际线问题.cpp:10
MethodgetTargetCopy
user/leetcode/1379.找出克隆二叉树中的相同节点.cpp:20
Functionget_db
(f)
src/util.py:24
Methodget_edge
(self, i, j)
animations/src/algo_segtree.py:143
Functionget_file_content
(file)
src/util.py:14
Functionget_images
(f)
src/util.py:32
Methodget_level
(self, problem)
src/codeforces.py:51
Functionget_map
(f)
src/util.py:28
Methodget_node
(self, i)
animations/src/algo_graph.py:79
Methodget_page_problems
(self, page_id)
src/codeforces.py:89
Methodget_problem
(self, id)
src/leetcode.py:99
Methodget_problem
(self, title)
src/codeforces_view.py:22
Functionget_root
(d, f)
src/util.py:20
Methodget_short
user/leetcode/648.单词替换.cpp:49
MethodgoodNodes
user/leetcode/1448.统计二叉树中好节点的数目.cpp:21
MethodguessNumber
user/leetcode/374.猜数字大小.cpp:19
MethodhasCycle
user/leetcode/141. 环形链表.cpp:18
MethodhasNext
user/leetcode/173.二叉搜索树迭代器.cpp:29
MethodhasNext
user/leetcode/341.扁平化嵌套列表迭代器.cpp:39
MethodhasPathSum
user/leetcode/112.路径总和.cpp:40
Methodhide_all
(self)
animations/src/algo_segtree.py:64
Methodincrement
user/leetcode/1381.设计一个支持增量操作的栈.cpp:22
Methodinit_messaged
(self, msg, delay=0)
animations/src/algo_scene.py:93
Methodinit_points
(self)
animations/src/algo_logo.py:7
MethodinorderTraversal
user/leetcode/94.二叉树的中序遍历.cpp:28
Methodinsert
user/leetcode/732.我的日程安排表-iii.cpp:30
Methodinsert
user/leetcode/745.前缀和后缀搜索.cpp:18
Methodinsert
user/leetcode/421.数组中两个数的最大异或值.cpp:19
Methodinsert
user/leetcode/57.插入区间.cpp:10
Methodinsert
user/leetcode/472.连接词.cpp:14
Methodinsert
user/leetcode/327.区间和的个数.cpp:42
Methodinsert
Inserts a word into the trie. */
user/leetcode/208.实现-trie-前缀树.cpp:36
Methodinsert
user/leetcode/336.回文对.cpp:21
Methodinsert
templates/red-black-tree.cpp:153
Methodinsert
templates/rb.cpp:172
MethodinsertFixup
1 父子节点之间不能出现两个连续的红节点 2 任何一个节点向下遍历到其子孙的叶子节点，所经过的黑节点个数必须相等 */
templates/red-black-tree.cpp:176
← previousnext →501–600 of 957, ranked by callers