MCPcopy Create free account

hub / github.com/algorithm006-class02/algorithm006-class02 / functions

Functions5,772 in github.com/algorithm006-class02/algorithm006-class02

⨍ Functions 5,772◇ Types & classes 2,815
↓ 1,099 callersMethodsize
Week_06/G20200343030544/LeetCode_547_544.cpp:27
↓ 602 callersFunctionlen
Week_03/G20200343030634/leetcode_127_634.c:46
↓ 405 callersMethodpush
(n)
Week_01/G20200343030374/summary.js:7
↓ 303 callersMethodget
根据字符编码值的差值为下标进行存取 @param ch @return
Week_06/G20200343030426/TrieNode.java:45
↓ 279 callersMethodput
根据字符编码值的差值为下标进行存取 @param ch @param node
Week_06/G20200343030426/TrieNode.java:55
↓ 233 callersMethodpop
(n)
Week_01/G20200343030374/summary.js:13
↓ 230 callersMethodmax
()
Week_01/G20200343030374/summary.js:18
↓ 218 callersMethodpush_back
Week_01/G20200343030374/summary.cxx:11
↓ 203 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030608/实现双端队列.py:66
↓ 140 callersMethodcontainsKey
根据字符编码值的差值为下标进行存取 @param ch @return
Week_06/G20200343030426/TrieNode.java:35
↓ 131 callersMethodcontains
(char ch)
Week_06/G20200343030522/LeetCode_208_522.java:35
↓ 118 callersMethodremove
采用递归实现
Week_06/G20200343030440/leetcode_208_440.php:77
↓ 116 callersFunctionmax
(a int, b int)
Week_05/G20200343030026/LeetCode_221_026.go:27
↓ 80 callersFunctionmin
(x, y, z int)
Week_05/G20200343030008/LeetCode_72_008.go:68
↓ 65 callersMethodsize
()
Week_07/G20200343030584/LeetCode_146_584.java:114
↓ 58 callersFunctionhelper
(node, list)
Week_02/G20200447010024/LeetCode_590_024.js:48
↓ 57 callersMethodfind
Week_06/G20200343030454/LeetCode_547.cpp:23
↓ 56 callersFunctionsort
Week_03/G20200343030430/LeetCode_169_430.js:7
↓ 55 callersFunctionprint
(col, n)
Week_03/G20200343030430/LeetCode_51_430.js:40
↓ 52 callersMethodget
Week_05/G20200343030636/LeetCode_647_636.cpp:63
↓ 52 callersMethodtoString
()
Week_07/G20200343030584/LeetCode_56_584.java:72
↓ 51 callersMethodequals
(int[] a, int[] b)
Week_08/G20200343030580/LeetCode_438_580.java:28
↓ 48 callersMethodjoin
Week_06/G20200343030622/LeetCode_547_622.cc:14
↓ 47 callersFunctionswap
(nums, i, j)
Week_02/G20200343030374/LeetCode_46_374.js:20
↓ 43 callersFunctionfind
(p)
Week_06/G20200343030030/LeetCode_200_030.js:23
↓ 40 callersMethodaddFirst
(Node x)
Week_07/G20200343030584/LeetCode_146_584.java:84
↓ 33 callersMethodforEach
(TreeNode root, List<Integer> list)
Week_02/G20200343030020/binary-tree-inorder-traversal.java:9
↓ 32 callersMethodinsert
Inserts a word into the trie.
Week_06/G20200343030608/实现Trie.py:10
↓ 32 callersMethodtop
(int K)
Week_07/G20200343030436/1244.力扣排行榜.java:19
↓ 31 callersFunctionbacktrack
(nums, step = 0, res = [])
Week_02/G20200343030374/LeetCode_46_374.js:8
↓ 29 callersMethodindexOf
(int[] inorder, int fpoi, int lpoi, int num)
Week_02/G20200343030580/LeetCode_105_580.java:28
↓ 28 callersFunctionlru_print
* Your LRUCache struct will be instantiated and called as such: * LRUCache* obj = lRUCacheCreate(capacity); * int param_1 = lRUCacheGet(obj, key);
Week_07/G20200343030420/LeetCode_146_420.c:134
↓ 25 callersFunctiondfs
* Note: The returned array must be malloced, assume caller calls free(). */
Week_06/G20200343030420/LeetCode_22_420.c:4
↓ 24 callersMethodremoveLast
()
Week_07/G20200343030380/Leetcode-146-380.js:32
↓ 23 callersFunctiondfs
Week_03/G20200343030420/LeetCode_529_420.c:1
↓ 22 callersMethodremove
(DoubleNode node)
Week_07/G20200343030402/[146]LRU缓存机制.java:83
↓ 21 callersMethodgetValue
()
Week_07/G20200343030426/LinkedNode.java:28
↓ 20 callersMethodnode
(int i, int j)
Week_06/G20200343030436/130.被围绕的区域.java:194
↓ 20 callersFunctionreverse
Week_08/G20200343030420/LeetCode_557_420.c:1
↓ 20 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20190343020006/Rotate.java:20
↓ 19 callersMethodcount
()
Week_05/G20200343030012/LeetCode_547_012.java:61
↓ 19 callersMethodgetKey
()
Week_07/G20200343030426/LinkedNode.java:20
↓ 18 callersMethodput
(char ch, TrieNode node)
Week_06/G20200343030578/LeetCode_208_578.java:49
↓ 17 callersFunctionlRUCacheGet
Week_07/G20200343030420/LeetCode_146_420.c:54
↓ 16 callersFunctionpreorder
(root)
Week_02/G20200343030430/LeetCode_589_430.js:12
↓ 15 callersFunctiondfs
(nums, size, depth, path, used, arr)
Week_02/G20200343030416/LeetCode_46_416.rb:27
↓ 15 callersFunctionhelper
递归 超时
Week_05/G20200343030498/LeetCode_322_498.go:28
↓ 15 callersFunctionreverse
Week_01/G20200343030450/Leetcode-189-450.c:1
↓ 14 callersMethodprint
二维数组打印 @param param
Week_06/G20200343030426/MultiArrayUtils.java:17
↓ 13 callersMethodget
(int key)
Week_07/G20200343030584/LeetCode_146_584.java:30
↓ 13 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030022/LeetCode_641_022.java:73
↓ 13 callersFunctionmin
(a, b int)
Week_05/G20200343030498/LeetCode_64_498.go:39
↓ 13 callersMethodpush
(int x)
Week_01/G20200343030542/LeetCode_155_542.java:13
↓ 12 callersMethodget
(char ch)
Week_06/G20200343030578/LeetCode_208_578.java:45
↓ 12 callersFunctiongetIndex
Week_02/G20200343030420/LeetCode_105_420.c:9
↓ 11 callersMethodContainsKey
(char c)
Week_06/G20200343030526/LeetCode_208_526.cs:46
↓ 11 callersFunctionDFS
(root)
Week_02/G20200343030430/LeetCode_111_430.js:36
↓ 11 callersFunctionlRUCachePut
Week_07/G20200343030420/LeetCode_146_420.c:65
↓ 11 callersMethodpow
(double x, double n)
Week_03/G20200343030020/powx-n.java:27
↓ 11 callersMethodpush
Week_01/G20200343030400/LeetCode_155_400.cpp:10
↓ 11 callersMethodtoArray
()
Week_07/G20200343030584/LeetCode_56_584.java:68
↓ 10 callersMethodcontainsKey
(char ch)
Week_06/G20200343030578/LeetCode_208_578.java:41
↓ 10 callersFunctionempty
Week_03/G20200343030634/leetcode_127_634.c:20
↓ 10 callersMethodisLetter
(char c)
Week_08/G20200343030580/LeetCode_917_580.java:28
↓ 10 callersMethodpop
Week_01/G20200343030400/LeetCode_155_400.cpp:19
↓ 10 callersMethodput
(int key, int value)
Week_07/G20200343030584/LeetCode_146_584.java:39
↓ 10 callersMethodtoString
()
Week_01/G20200343030004/src/LeetCode_21_004.java:9
↓ 10 callersMethodtop
Week_01/G20200343030400/LeetCode_155_400.cpp:26
↓ 9 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030518/LeetCode_641_518.java:102
↓ 9 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030542/LeetCode_641_542.java:87
↓ 9 callersMethodremove
(node)
Week_07/G20200343030380/Leetcode-146-380.js:28
↓ 9 callersMethodreverse
(char[] s_arr, int i, int j)
Week_08/G20200343030436/151.翻转字符串里的单词.java:37
↓ 9 callersMethodrotate
(int[] nums, int k)
Week_01/G20200343030004/src/LeetCode_189_004.java:5
↓ 8 callersMethodfind
Week_06/G20200343030374/LeetCode_130_374.cxx:78
↓ 8 callersFunctiongenerateParenthesis
:type n: int :rtype: List[str]
Week_02/G20200343030550/LeetCode_22_550.py:1
↓ 8 callersMethodisMine
(char[][] board, int i, int j, int in, int jn)
Week_03/G20200343030580/LeetCode_529_580.java:50
↓ 8 callersFunctionlowestCommonAncestor
* 二叉树的定义决定了其处理非常适合使用递归。待处理节点如果是p或q或NULL，直接返回待处理节点， * 否则递归其左子树和右子树，返回结果记为resLeft和resRight，氛围四种情况： * 1. resLeft和resRight均不为空，说明p和q分居待处理节点的左子树和右子树上，直接返
Week_02/G20200343030420/LeetCode_236_420.c:16
↓ 8 callersMethodput
(char ch, TrieNode node)
Week_06/G20200343030436/208.实现-trie-前缀树.java:25
↓ 8 callersMethodremove
(Node x)
Week_07/G20200343030584/LeetCode_146_584.java:95
↓ 8 callersMethodswap
(int[] nums, int i, int j)
Week_02/G20200343030390/homework/Leetcode_47_390.java:49
↓ 7 callersMethodPush
(int x)
Week_01/G20200343030526/Leetcode_155_526.cs:52
↓ 7 callersMethodget
(char ch)
Week_06/G20200343030386/LeetCode_208_386.java:86
↓ 7 callersMethodget
(int key)
Week_07/G20200343030386/LeetCode_146_386.java:90
↓ 7 callersMethodisBetween
(String substring)
Week_08/G20200343030578/LeetCode_91_578.java:80
↓ 7 callersMethodisBetween
(String substring)
Week_05/G20200343030578/LeetCode_91_578.java:80
↓ 7 callersMethodpop
()
Week_01/G20200343030542/LeetCode_155_542.java:20
↓ 7 callersMethodput
(char ch, TrieNode node)
Week_06/G20200343030590/LeetCode_208_590.java:22
↓ 7 callersFunctionreverse
(node)
Week_02/G20200343030380/Leetcode-226-380.js:16
↓ 7 callersFunctiontraverse_node
(node, level)
Week_02/G20200343030398/LeetCode_429_398.py:35
↓ 7 callersFunctionunion
(p, q)
Week_06/G20200343030380/Leetcode-547-380.js:28
↓ 6 callersMethodIsEmpty
** Checks whether the circular deque is empty or not. */
Week_01/G20200343030396/LeetCode_641_396.go:122
↓ 6 callersFunctionbuildTree
* 二叉树的前序遍历：root->leftTree->rightTree; 二叉树的中序遍历：leftTree->root->rightTree; * 通过前序遍历确定root，然后在中序遍历中找到root所在位置，root前面的为左子树，后面的为右子树 * 递归处理左子树和右子树，结束条件为
Week_02/G20200343030420/LeetCode_105_420.c:21
↓ 6 callersFunctioncmp_lt
(x, y)
Week_01/G20200343030608/heapq.py:4
↓ 6 callersFunctiondfs
(n, row, cols, pie, na)
Week_07/G20200343030380/Leetcode-52-380.js:19
↓ 6 callersMethodget
Week_06/G20200343030622/LeetCode_208_622.cc:14
↓ 6 callersFunctionhelp
(root, res)
Week_02/G20200343030382/Leetcode_94_382.js:12
↓ 6 callersMethodinsert
(String word)
Week_06/G20200343030376/LeetCode_208_376.java:20
↓ 6 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030640/640_wekk_01_middle_641.py:82
↓ 6 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030584/LeetCode_641_584.java:118
↓ 6 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030536/LeetCode_641_536.java:82
next →1–100 of 5,772, ranked by callers