MCPcopy Create free account

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

Functions7,451 in github.com/algorithm004-03/algorithm004-03

↓ 1,121 callersMethodadd
(self, value, preNode)
Week 01/id_738/LeetCode_641_738.py:20
↓ 701 callersMethodsize
()
Week 07/id_273/LeetCode_146_273.java:97
↓ 313 callersMethodmin
(int a,int b,int c)
Week 05/id_388/LeeCode_72_388.java:75
↓ 278 callersMethodput
Week 02/id_183/Leetcode_146_183.cpp:32
↓ 267 callersMethodget
Week 02/id_183/Leetcode_146_183.cpp:19
↓ 255 callersMethodget
:type key: int :rtype : int
Week 07/id_298/lru-cache.py:10
↓ 245 callersMethodcontains
(char c)
Week 06/id_598/LeetCode_212_598.java:101
↓ 226 callersMethodadd
(char ch)
Week 06/id_213/Trie.java:12
↓ 194 callersMethodsort
(String s)
Week 02/id_708/LeetCode_49_708.java:17
↓ 192 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_113/LeetCode641.py:64
↓ 192 callersMethodpush
(self, x: int)
Week 02/id_718/155.min-stack.py:17
↓ 186 callersMethodcontainsKey
(char ch)
Week 06/id_708/LeetCode_208_708.java:14
↓ 169 callersMethodpush
(self, x: int)
Week 01/id_718/155.min-stack.py:17
↓ 159 callersMethodremove
(Node node)
Week 07/id_363/LeetCode_146_363.java:160
↓ 156 callersMethodequals
(Object obj)
Week 06/id_273/LeetCode_773_273.java:144
↓ 132 callersMethodpush_back
(self, node)
Week 07/id_278/Leetcode_146_278.py:16
↓ 126 callersMethodoffer
(Queue<String> q, String s, Set<String> visited)
Week 06/id_098/LeetCode_773_098.java:38
↓ 105 callersMethodput
:type key: int :type value: int :rtype void
Week 07/id_298/lru-cache.py:20
↓ 98 callersMethodpop
(self)
Week 02/id_718/155.min-stack.py:22
↓ 96 callersMethodtoString
()
Week 01/id_178/ListNode.java:15
↓ 93 callersMethodpop
(self)
Week 01/id_718/155.min-stack.py:22
↓ 87 callersMethodsize
()
Week 01/id_708/LeetCode_641_708.java:63
↓ 80 callersMethodisEmpty
()
Week 02/id_733/LeetCode_94_733.go:88
↓ 67 callersMethodinsert
Inserts a word into the trie.
Week 06/id_213/Trie.java:37
↓ 64 callersMethodfill
(n)
Week 06/id_738/pratice/LeetCode_37_738.py:25
↓ 61 callersMethodget
(int key)
Week 01/id_273/LeetCode_146_273.java:14
↓ 51 callersMethodput
(int key, int value)
Week 01/id_273/LeetCode_146_273.java:26
↓ 49 callersMethodsort
(int[] src, int[] dest, int s, int e)
Week 07/id_098/LeetCode_493_098.java:9
↓ 45 callersMethodaddFirst
(Node node)
Week 07/id_363/LeetCode_146_363.java:142
↓ 41 callersMethodCount
()
Week 06/id_128/LeetCode_547_128.cs:65
↓ 41 callersFunctionmax
(x, y int)
Week 05/id_733/LeetCode_152_733.go:20
↓ 37 callersFunctiondfs
(i)
Week 06/id_023/leetCode_547_023.js:11
↓ 37 callersFunctiondfs
(board,x,y)
Week 03/id_003/529.扫雷.js:7
↓ 34 callersFunctiondfs
(row, column)
Week 02/id_023/leetCode_051_023.js:8
↓ 30 callersMethodaddLast
(DLinkNode node)
Week 07/id_708/LeetCode146_708.java:27
↓ 30 callersFunctionmax
(x, y int)
Week 08/id_733/LeetCode_85_733.go:46
↓ 27 callersFunctionmin
(a,b int)
Week 05/id_343/LeetCode_64.go:1
↓ 27 callersMethodprint
(int[] board, char[] buffer)
Week 07/id_468/leetcode51_7_468.java:68
↓ 25 callersFunctionmax
(arr)
Week 03/id_008/LeetCode_515_008.js:36
↓ 24 callersMethodcount
()
Week 06/id_318/LeetCode_547_318.java:48
↓ 24 callersMethodremoveLast
()
Week 07/id_363/LeetCode_146_363.java:151
↓ 21 callersFunctionsort
(s)
Week 02/id_003/字母异位词分组.js:22
↓ 20 callersMethodgetValue
Gets the value for this pair. @return value for this pair
Week 03/id_138/LeetCode_127_138.java:39
↓ 19 callersMethodpop
()
Week 02/id_733/LeetCode_94_733.go:92
↓ 19 callersMethodsort
(String str)
Week 02/id_098/LeetCode_49_098.java:50
↓ 17 callersFunctioncount
(num)
Week 07/id_533/LeetCode_338.js:15
↓ 17 callersFunctionswap
Week 01/id_123/LeetCode_283_123.c:1
↓ 16 callersFunctionbacktrack
(nums, result, i)
Week 02/id_228/LeetCode_46_228.js:15
↓ 16 callersFunctionreverse
(nums, st, ed)
Week 01/id_088/rotate.js:52
↓ 16 callersMethodtoArray
()
Week 07/id_338/LeetCode_56_338.java:19
↓ 16 callersMethodtoString
()
Week 07/id_708/LeetCode146_708.java:13
↓ 15 callersFunctionmax
(m, n int)
Week 01/id_313/LeetCode_42_313.go:25
↓ 15 callersFunctionmin
(x, y int)
Week 08/id_733/LeetCode_85_733.go:54
↓ 15 callersMethodtop
(self)
Week 02/id_718/155.min-stack.py:28
↓ 14 callersMethodgetKey
Gets the key for this pair. @return key for this pair
Week 03/id_138/LeetCode_127_138.java:28
↓ 14 callersFunctionmin
(x, y int)
Week 05/id_733/LeetCode_64_733.go:28
↓ 14 callersMethodpow
(double x, int n)
Week 02/id_368/LeetCode_50_368.java:18
↓ 14 callersMethodremove
(Node node)
Week 07/id_273/LeetCode_146_273.java:82
↓ 14 callersMethodremoveFirst
()
Week 07/id_708/LeetCode146_708.java:39
↓ 14 callersMethodreverse
(char[] charArr, int start, int end)
Week 08/id_273/LeetCode_151_273.java:25
↓ 13 callersMethodget
(int key)
Week 07/id_063/Leetcode_146_063.java:69
↓ 13 callersMethodswap
swap board where x = zeroX, y = zeroY @param x @param y @return State
Week 06/id_273/LeetCode_773_273.java:103
↓ 13 callersMethodtoString
()
Week 01/id_588/LeetCode_641_588.java:96
↓ 12 callersFunctionhelper
(root)
Week 02/id_228/LeetCode_590_228.js:14
↓ 11 callersMethodget
(int key)
Week 07/id_363/LeetCode_146_363.java:42
↓ 11 callersMethodisMatch
(String s,String p)
Week 08/id_693/LeetCode_10_693.java:20
↓ 11 callersMethodlongestValidParentheses
(String s)
Week 05/id_418/LeetCode_32_418.java:62
↓ 11 callersMethodmySqrt
(int x)
Week 03/id_693/practise/LeetCode_69_693.java:12
↓ 11 callersMethodpop
()
Week 01/id_693/practise/LeetCode_155_693.java:28
↓ 10 callersMethodget
(char ch)
Week 06/id_083/LeetCode_208_083.java:21
↓ 10 callersMethodisEmpty
()
Week 01/id_308/LeedCode_641.js:48
↓ 10 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_098/LeetCode_641_098.java:60
↓ 10 callersMethodnode
(int i, int j)
Week 06/id_578/LeetCode_130_578.java:45
↓ 10 callersMethodnode
方便构建树的辅助方法: @param values @return
Week 02/id_038/week-02-038/src/main/java/com/github/kylefeng/week02/Helper.java:19
↓ 10 callersMethodpush
(int x)
Week 01/id_693/practise/LeetCode_155_693.java:21
↓ 10 callersMethodreverse
(int[] nums, int start, int end)
Week 01/id_728/189_Rotate.java:8
↓ 10 callersMethodtoLowerCase
(String str)
Week 08/id_273/LeetCode_709_273.java:8
↓ 9 callersMethodcanJump
(int[] nums)
Week 03/id_613/java/src/main/Leetcode55SolutionOne.java:11
↓ 9 callersMethodfind
(int[] parent, int i)
Week 06/id_158/547.朋友圈.cs:43
↓ 9 callersMethodfind
(cur, p, q)
Week 02/id_738/LeetCode_236_738.py:23
↓ 9 callersMethodget
(char ch)
Week 06/id_443/LeetCode_208_443.java:100
↓ 9 callersFunctionmin
(x, y int)
Week 03/id_733/LeetCode_529_733.go:77
↓ 9 callersMethodpush
(r byte)
Week 08/id_733/LeetCode_438_733.go:42
↓ 9 callersMethodput
(int key, int value)
Week 07/id_363/LeetCode_146_363.java:46
↓ 9 callersMethodput
(int key, int value)
Week 07/id_063/Leetcode_146_063.java:79
↓ 9 callersMethodtoString
()
Week 06/id_593/LeetCode_547_593.java:92
↓ 8 callersFunctioncount
(x, y)
Week 03/id_008/LeetCode_529_008.js:40
↓ 8 callersFunctionfind
(i, j, node)
Week 06/id_533/LeetCode_212.js:29
↓ 8 callersMethodisAnagram
判断两个字符串是否为两个有效的字母异位词。 @param str1 字符串1 @param str2 字符串2 @return boolean
Week 02/id_038/week-02-038/src/main/java/com/github/kylefeng/week02/LeetCode_242_038.java:24
↓ 8 callersFunctionisEmpty
(self)
Week 01/id_673/design-circular-deque.py:263
↓ 8 callersMethodisEmpty
()
Week 01/id_468/leetcode641_1_468.java:79
↓ 8 callersMethodpop
(r byte)
Week 08/id_733/LeetCode_438_733.go:49
↓ 8 callersMethodput
(int key, int value)
Week 07/id_273/LeetCode_146_273.java:28
↓ 7 callersMethodRemove
(c *cacheNode)
Week 07/id_733/LeetCode_146_733.go:61
↓ 7 callersMethodbinarySearch
(int[] nums, int left, int right, int target)
Week 03/id_613/java/src/main/Leetcode33SolutionOne.java:43
↓ 7 callersFunctionfind
(parent []int, i int)
Week 06/id_198/LeetCode_547_198.simple.go:3
↓ 7 callersMethodget
(char ch)
Week 06/id_713/LeetCode_212_WordSearchII.java:139
↓ 7 callersMethodget
(char ch)
Week 06/id_328/ImplementTriePrefixTree.java:55
↓ 7 callersMethodget
(int key)
Week 07/id_273/LeetCode_146_273.java:18
↓ 7 callersMethodget
(int key)
Week 07/id_693/LeetCode_146_693.java:32
next →1–100 of 7,451, ranked by callers