MCPcopy Create free account

hub / github.com/algorithm004-01/algorithm004-01 / functions

Functions6,280 in github.com/algorithm004-01/algorithm004-01

⨍ Functions 6,280◇ Types & classes 2,806
↓ 921 callersMethodadd
(DoubleLinkedListNode newNode)
Week 07/id_491/LeetCode_146_491.java:16
↓ 808 callersMethodsize
()
Week 02/id_416/MyMap.java:10
↓ 678 callersMethodget
(K k)
Week 02/id_416/MyMap.java:8
↓ 398 callersMethodpush
:type x: int :rtype: None
Week 01/id_251/LeetCode_155_251.py:46
↓ 377 callersMethodput
(K k,V v)
Week 02/id_416/MyMap.java:6
↓ 240 callersMethodpop
:rtype: None
Week 01/id_251/LeetCode_155_251.py:58
↓ 232 callersMethodadd
(char ch)
Week 06/id_281/LeetCode_208_281.java:12
↓ 219 callersMethodsort
(int[] content)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/binaryheap/HeapSort.java:61
↓ 200 callersMethodcontains
(char c)
Week 06/id_131/LeetCode_208_131.java:66
↓ 189 callersMethodcontainsKey
(char ch)
Week 06/id_306/TrieNode.java:18
↓ 122 callersMethodequals
(Object obj)
Week 06/id_306/SlidingPuzzle.java:120
↓ 119 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_641/Leetcode641.java:88
↓ 105 callersMethodtoString
()
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/cache/LRUCache.java:128
↓ 100 callersMethodremove
(Node x)
Week 07/id_306/DoubleList.java:28
↓ 93 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/array/queue/MyCircularDeque.java:120
↓ 90 callersFunctionmax
(a, b int)
Week 05/id_451/LeetCode_32_451.go:2
↓ 66 callersMethodisEmpty
()
Week 06/id_716/LeetCode_208_716.java:96
↓ 61 callersMethodasList
(int[] arr)
Week 07/id_081/InsertSort.java:28
↓ 50 callersFunctionmin
(a, b int)
Week 05/id_451/LeetCode_64_451.go:1
↓ 48 callersMethodAdd
(n int)
Week 08/id_451/LeetCode_300_451.go:5
↓ 40 callersMethodremove
删除
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/binaryheap/SmallHeap.java:41
↓ 39 callersMethodsplit
(String s)
Week 08/id_506/LeetCode_557_506.java:11
↓ 37 callersMethodcount
()
Week 06/id_676/547.朋友圈.java:38
↓ 35 callersMethodjoin
(int m, int n)
Week 06/id_161/NumIslands.java:58
↓ 28 callersMethodinsert
(String word)
Week 06/id_081/Tire.java:8
↓ 27 callersMethodisEmpty
()
Week 02/id_716/stack.go:19
↓ 26 callersFunctionfind
(i)
Week 06/id_551/LeetCode_547_551.py:5
↓ 26 callersMethodput
(K key, V value)
Week 02/id_416/MyHashMap.java:30
↓ 24 callersMethodaddFirst
(Node x)
Week 07/id_306/DoubleList.java:19
↓ 24 callersFunctionhelper
(root, lower, upper)
Week 02/id_521/98.验证二叉搜索树.js:20
↓ 22 callersFunctionmin
(a, b int)
Week 05/id_531/leetCode_64_531.go:39
↓ 22 callersMethodtoArray
()
Week 07/id_046/LeetCode_56_046.java:10
↓ 21 callersMethodset
(Integer key, Integer value)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/cache/LRUCache.java:61
↓ 20 callersMethodpush
(int x)
Week 01/id_431/LeetCode_115_431.java:16
↓ 19 callersMethodgetKey
()
Week 02/id_416/MyMap.java:13
↓ 19 callersMethodset
(char c, TrieNode next)
Week 06/id_131/LeetCode_208_131.java:58
↓ 19 callersFunctionsort
(nums)
Week 01/id_441/three_sum.js:68
↓ 18 callersFunctiondfs
(start, n, k, result, temp)
Week 03/id_256/LeetCode_77_256.js:20
↓ 18 callersMethodgetValue
()
Week 02/id_416/MyMap.java:14
↓ 17 callersFunctionmax
(m, n int)
Week 01/id_716/LeetCode_42_716.go:35
↓ 17 callersMethodremoveLast
()
Week 07/id_306/DoubleList.java:35
↓ 17 callersMethodtop
:rtype: int
Week 01/id_251/LeetCode_155_251.py:66
↓ 16 callersFunctiondfs
(i, j, str, node)
Week 06/id_016/LeetCode_212_016.js:106
↓ 15 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_371/LeetCode_641_371.java:118
↓ 15 callersMethodremoveFirst
(Entry firstEntry)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/cache/LRUCache.java:82
↓ 15 callersMethodsort
(String str)
Week 02/id_466/LeetCode_49_466.java:62
↓ 15 callersMethoduniquePaths
:type m: int :type n: int :rtype: int
Week 05/id_251/LeetCode_62_251.py:41
↓ 14 callersMethodcontainsKey
(char ch)
Week 06/id_471/LeetCode_208_471.java:63
↓ 14 callersMethodget
(int key)
Week 07/id_466/LeetCode_146_466.java:84
↓ 13 callersMethodadd
(Node node)
Week 07/id_466/LeetCode_146_466.java:125
↓ 13 callersMethodpop
()
Week 07/id_491/LeetCode_146_491.java:24
↓ 12 callersMethodcomputeIfAbsent
(char c)
Week 06/id_466/LeetCode_208_466.java:101
↓ 12 callersMethodcount
Week 06/id_151/LeetCode_547_151.cpp:36
↓ 12 callersFunctionmin
(m, n int)
Week 01/id_716/LeetCode_42_716.go:28
↓ 12 callersMethodpush
(int x)
Week 01/id_371/Leetcode_155_371.java:29
↓ 12 callersMethodremove
(Node node)
Week 07/id_466/LeetCode_146_466.java:132
↓ 11 callersMethodfind
(int i)
Week 03/id_306/NumIslands_Union.java:29
↓ 11 callersMethodinsert
Inserts a word into the trie. */
Week 06/id_151/LeetCode_208_151.cpp:19
↓ 11 callersMethodpop
()
Week 01/id_431/LeetCode_115_431.java:28
↓ 11 callersMethodreplace
(String s, int index, char c)
Week 03/id_436/Leetcode_127_436.java:38
↓ 11 callersFunctionreverse
(nums, start, end)
Week 01/id_591/rotate-array.js:14
↓ 10 callersMethodreverse
(int[] nums,int start,int end)
Week 01/id_756/2.旋转数组.java:43
↓ 10 callersMethodstartsWith
Returns if there is any word in the trie that starts with the given prefix.
Week 06/id_081/Tire.java:29
↓ 9 callersFunctionbacktrack
(S='', left=0, right=0)
Week 06/id_246/LeetCode_22_246.py:19
↓ 9 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_556/LeetCode_641_556.java:117
↓ 9 callersMethodpop
()
Week 01/id_371/Leetcode_155_371.java:35
↓ 9 callersMethodput
(int key, int value)
Week 07/id_466/LeetCode_146_466.java:89
↓ 8 callersFunctionDFS
(node, visited, level)
Week 03/id_521/102.二叉树的层次遍历.js:8
↓ 8 callersMethodPop
()
Week 02/id_716/stack.go:30
↓ 8 callersFunctionhelper2
(root *TreeNode, res *[]int)
Week 02/id_531/leetCode_145_531.go:12
↓ 8 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_431/LeetCode_641_431.java:80
↓ 8 callersMethodupdate
(int idx, int delta)
Week 07/id_466/LeetCode_493_466.java:144
↓ 7 callersMethodCounter
<summary> 计数器 一个循环，同时对计数器中的对应字母进行增加和减少，最后判断计数器中有没有不为零的。 时间复杂度是O(n)。 </summary> <param name="s"></param> <param name="t"></param> <returns></returns>
Week 02/id_171/ValidAnagramSol.cs:28
↓ 7 callersMethodPush
(value interface{})
Week 02/id_716/stack.go:23
↓ 7 callersMethodaddFirst
在链表头部添加节点 @param x
Week 07/id_371/Leetcode_146_371.java:47
↓ 7 callersFunctionbacktrack
(first=1, curr=[])
Week 02/id_246/LeetCode_77_246.py:22
↓ 7 callersMethodfind
(int p)
Week 06/id_711/Leetcode_130_711.java:16
↓ 7 callersMethodhammingWeight
(int n)
Week 07/id_466/LeetCode_191_466.java:71
↓ 7 callersFunctionhelper
(nums, left, right)
Week 03/id_361/leetCode_153_361.js:48
↓ 7 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_476/LeetCode_641_476.java:131
↓ 7 callersMethodisEmpty
()
Week 01/id_241/LeetCode_641_241.java:67
↓ 7 callersMethodisEmpty
()
Week 01/id_421/LeetCode_641_421.java:67
↓ 7 callersFunctionrevert
(array)
Week 03/id_251/还原一个被旋转的排序列表.py:6
↓ 7 callersFunctionsink
(i,j)
Week 03/id_336/LeetCode_336_200.js:13
↓ 7 callersMethodsort
(String str)
Week 02/id_716/LeetCode_49_716.java:30
↓ 7 callersMethodsubNode
(char c)
Week 06/id_501/week06/Trie.java:124
↓ 6 callersFunctionDFS
(queens, xy_dif, xy_sum)
Week 06/id_246/LeetCode_51_246.py:11
↓ 6 callersMethodIsEmpty
** Checks whether the circular deque is empty or not. */
Week 01/id_011/design-circular-deque.go:105
↓ 6 callersFunctionclimb_stairs_different
(n)
Week 05/id_251/爬楼梯问题扩展.py:37
↓ 6 callersFunctionclimb_stairs_different_
(n)
Week 05/id_251/爬楼梯问题扩展.py:50
↓ 6 callersMethodcontainsKey
(char ch)
Week 06/id_371/Leetcode_208_371.java:26
↓ 6 callersMethodcountBits
(int num)
Week 07/id_466/LeetCode_338_466.java:51
↓ 6 callersMethodfillSetMap
(Map<String, Set<String>> map1, Map<String, Set<String>> map2, String word)
Week 06/id_466/LeetCode_127_466.java:603
↓ 6 callersMethodfillSetMap
(Map<String, Set<String>> map1, Map<String, Set<String>> map2, String word)
Week 03/id_466/LeetCode_127_466.java:603
↓ 6 callersMethodfind
(self, i)
Week 06/id_251/并查集代码模板.py:10
↓ 6 callersFunctionhelper
(root *TreeNode, res *[]int)
Week 02/id_531/leetCode_94_531.go:15
↓ 6 callersMethodisEmpty
Checks whether the circular deque is empty or not. :rtype: bool
Week 01/id_251/LeetCode_641_251.py:219
↓ 6 callersMethodisEmpty
()
Week 01/id_241/LeetCode_641_241.java:218
↓ 6 callersMethodisEmpty
()
Week 01/id_421/LeetCode_641_421.java:218
↓ 6 callersMethodisZero
(char c)
Week 08/id_716/LeetCode_91_716.java:104
next →1–100 of 6,280, ranked by callers