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
↓ 3 callersMethodIsFull
** Checks whether the circular deque is full or not. */
Week_01/G20200343030396/LeetCode_641_396.go:128
↓ 3 callersMethod_parent
(self, p, i)
Week_06/G20200343030400/LeetCode_547_400.py:20
↓ 3 callersMethod_parent
(self, parent, i)
Week_06/G20200343030638/LeetCode_547_638.py:20
↓ 3 callersMethod_reverse
(self, nums, start, end)
Week_01/G20200343030638/LeetCode_189(1)_638.py:12
↓ 3 callersMethodbacktrack
(int row, int col)
Week_06/G20200343030590/LeetCode_37_590.java:68
↓ 3 callersMethodclimbStairs
(int n)
Week_06/G20200343030592/LeetCode_70_592.java:13
↓ 3 callersMethodclimbStairs
剪枝 时间复杂度：O() 空间复杂度：O(n) @param n @return
Week_06/G20200343030564/LeetCode_70_564.java:45
↓ 3 callersMethodclimbStairs
(self, n)
Week_06/G20200343030016/LeetCode_70_016.py:8
↓ 3 callersMethodcompare
(int[] o1, int[] o2)
Week_07/G20200343030580/LeetCode_56_580.java:4
↓ 3 callersMethodcontainsKey
(char ch)
Week_06/G20200343030578/LeetCode_212_578.java:48
↓ 3 callersMethodcontainsKey
(char ch)
Week_06/G20200343030592/LeetCode_208_592.java:19
↓ 3 callersFunctiondfs
(node)
Week_06/G20200343030550/LeetCode_547_550.py:8
↓ 3 callersFunctiondfs
(i, j)
Week_06/G20200343030380/Leetcode-130-380.js:17
↓ 3 callersFunctionfastPow
(x, n)
Week_03/G20200343030380/Leetcode-50-380.js:29
↓ 3 callersFunctionfib
(f, s, n)
Week_01/G20200343030430/LeetCode_70_430.js:19
↓ 3 callersFunctionfind
(p)
Week_06/G20200447010018/200.岛屿数量.js:59
↓ 3 callersMethodfind
Week_06/G20200343030558/LeetCode-200-558.cpp:28
↓ 3 callersMethodfind
(int i, int j, int m)
Week_06/G20200343030580/LeetCode_130_580.java:15
↓ 3 callersFunctionfindS
Week_06/G20200343030420/LeetCode_547_420.c:7
↓ 3 callersFunctiongenerateParenthesis
Week_06/G20200343030420/LeetCode_22_420.c:20
↓ 3 callersMethodget
(char ch)
Week_06/G20200343030436/208.实现-trie-前缀树.java:22
↓ 3 callersMethodget
(char v)
Week_06/G20200343030024/LeetCode_208_024.java:72
↓ 3 callersMethodget
(char ch)
Week_06/G20200343030592/LeetCode_208_592.java:23
↓ 3 callersMethodget
(char ch)
Week_06/G20200343030522/LeetCode_208_522.java:39
↓ 3 callersMethodget
(int key)
Week_07/G20200343030020/lru_cache.java:13
↓ 3 callersMethodgetId
()
Week_01/G20200343030022/Customer.java:15
↓ 3 callersMethodgetNext
()
Week_07/G20200343030426/LinkedNode.java:44
↓ 3 callersMethodgetNode
(char c)
Week_06/G20200343030580/LeetCode_208_580.java:51
↓ 3 callersFunctionhelper
(n, memo)
Week_06/G20200447010070/LeetCode_70_070.js:16
↓ 3 callersMethodinArea
(char[][] board, int r, int c)
Week_03/G20200343030022/LeetCode_529_022.java:79
↓ 3 callersFunctioninit
Week_03/G20200343030634/leetcode_127_634.c:12
↓ 3 callersMethodinsert
Inserts a word into the trie.
Week_06/G20200343030520/LeetCode-208-0520.py:10
↓ 3 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030590/LeetCode_641_590.java:67
↓ 3 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030590/LeetCode_641_590.java:72
↓ 3 callersMethodisPowerOfTwo
(self, n)
Week_07/G20200343030016/LeetCode_231_016.py:7
↓ 3 callersMethodisUnValidate
(Character c, int index, Set<Character>[] set)
Week_06/G20200343030580/LeetCode_36_580.java:22
↓ 3 callersFunctionlRUCacheCreate
Week_07/G20200343030420/LeetCode_146_420.c:23
↓ 3 callersFunctionlRUCacheFree
Week_07/G20200343030420/LeetCode_146_420.c:109
↓ 3 callersMethodlemonadeChange
(self, bills)
Week_03/G20200343030016/LeetCode_860_016.py:11
↓ 3 callersFunctionmajorityElement
(nums)
Week_03/G20200343030430/LeetCode_169_430.js:5
↓ 3 callersMethodmaxProfit
谷峰值 时间复杂度：O(n) 空间复杂度：O(1) @param prices @return
Week_03/G20200343030564/LeetCode_122_564.java:51
↓ 3 callersMethodmaxProfit
(self, prices)
Week_03/G20200343030016/LeetCode_122_016.py:9
↓ 3 callersMethodmaxProfit1
叠加每一次的数值 时间复杂度：O(n) 空间复杂度：O(1) @param prices @return
Week_03/G20200343030564/LeetCode_122_564.java:75
↓ 3 callersFunctionmergeSort
(nums, left, right)
Week_07/G20200343030380/Leetcode-493-380.js:13
↓ 3 callersMethodmoveZeroes01
(int[] nums)
Week_01/G20200343030004/src/LeetCode_283_004.java:6
↓ 3 callersMethodmoveZeroes02
(int[] nums)
Week_01/G20200343030004/src/LeetCode_283_004.java:25
↓ 3 callersMethodprintNode
(ListNode curr)
Week_01/G20200343030584/LeetCode_21_584.java:35
↓ 3 callersMethodpush
Week_01/G20200343030462/LeetCode_155_462.cpp:9
↓ 3 callersFunctionref
(arr)
Week_01/G20200343030528/[189]Rotate Array.py:3
↓ 3 callersMethodresverse
(int[] nums, int start, int end)
Week_01/G20200343030022/LeetCode_189_022.java:48
↓ 3 callersFunctionreverse
(nums []int, i, j int)
Week_01/G20200343030008/LeetCode_189_008.go:65
↓ 3 callersFunctionreverse
(nums, start, end)
Week_01/G20200447010070/LeetCode_189_070.js:46
↓ 3 callersFunctionreverse
(nums []int)
Week_01/G20200343030498/LeetCode_189_498.go:39
↓ 3 callersFunctionreverse
(nums []int, start int, end int)
Week_01/G20200343030396/LeetCode_189_396.go:10
↓ 3 callersMethodreverse
(int[] nums,int begin,int end)
Week_00/G20200343030644/java/RotatedArray.java:19
↓ 3 callersMethodreverse
(char[] a, int i, int j)
Week_08/G20200343030004/src/LeetCode_151_004.java:41
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030518/LeetCode_189_518.java:11
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030436/189.旋转数组.java:57
↓ 3 callersMethodreverse
(int[] nums,int begin,int end)
Week_01/G20200343030644/java/RotatedArray.java:19
↓ 3 callersMethodreverse
(int[] nums, int begin, int end)
Week_01/G20200343030632/Leetcode_189_632.java:24
↓ 3 callersMethodreverse
(int[] nums, int startIndex, int endIndex)
Week_01/G20200343030580/LeetCode_189_580.java:13
↓ 3 callersMethodreverse
(int[] nums,int start,int end)
Week_01/G20200343030570/LeetCode_189_570.java:3
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030492/LeetCode_189_492.java:57
↓ 3 callersMethodreverse
对调反转 @param nums @param start @param end
Week_01/G20200343030566/src/main/java/com/sebar/algorithm/Leetcode_189_566.java:69
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030456/LeetCode_189_456.java:23
↓ 3 callersMethodreverse
(int[] nums, int k, int i)
Week_01/G20200343030388/LeetCode_189_388.java:20
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030364/LeetCode_189_364.java:15
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030414/LeetCode_189_414.java:51
↓ 3 callersMethodreverse
倒置
Week_01/G20200343030402/Rotate.java:48
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030564/LeetCode_189_564.java:107
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030422/LeetCode_189_422.java:10
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030532/LeetCode_189_532.java:60
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030576/LeetCode_189_G20200343030576.java:10
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030006/Rotate.java:20
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
Week_01/G20200343030542/LeetCode_189_542.java:12
↓ 3 callersFunctionreverseArray
Week_01/G20200343030420/LeetCode_189_420.c:4
↓ 3 callersMethodreverseArray
(int[] nums,int start,int end)
Week_01/G20200343030004/src/LeetCode_189_004.java:23
↓ 3 callersMethodreverseString
(char[] s, int start, int end)
Week_08/G20200343030580/LeetCode_541_580.java:20
↓ 3 callersFunctionreverse_num
(nums, i, j)
Week_01/G20200343030416/LeetCode_189_416.rb:58
↓ 3 callersMethodrotate
对指定数组的指定范围进行旋转 @param nums 目标数组 @param start 起始位置 @param end 终点位置
Week_01/G20200343030584/LeetCode_189_584.java:22
↓ 3 callersFunctionsearch
(i: int, j: int, node, prefix, visited)
Week_06/G20200343030362/LeetCode_212_362.py:12
↓ 3 callersMethodsearch
(self, word)
Week_06/G20200343030016/LeetCode_208_016.py:20
↓ 3 callersMethodtop
Week_01/G20200343030462/LeetCode_155_462.cpp:31
↓ 3 callersMethodtraverse
(int[] nums, int start, int end)
Week_01/G20200343030536/LeetCode_189_536.java:19
↓ 3 callersMethodturn
(int[] nums, int l, int r)
Week_01/G20200343030378/LeetCode_189_378.java:10
↓ 2 callersMethodGet
(char c)
Week_06/G20200343030526/LeetCode_208_526.cs:45
↓ 2 callersMethodInsert
** Inserts a word into the trie. */
Week_06/G20200343030498/LeetCode_208_498.go:32
↓ 2 callersMethodInsertFront
** Adds an item at the front of Deque. Return true if the operation is successful. */
Week_01/G20200343030396/LeetCode_641_396.go:35
↓ 2 callersMethodInsertLast
** Adds an item at the rear of Deque. Return true if the operation is successful. */
Week_01/G20200343030008/LeetCode_641_008.go:95
↓ 2 callersMethodIsFull
Checks whether the circular deque is full or not. */
Week_01/G20200343030526/Leetcode_641_526.cs:141
↓ 2 callersMethodIsFull
** Checks whether the circular deque is full or not. */
Week_01/G20200343030498/LeetCode_641_498.go:156
↓ 2 callersMethodPop
()
Week_01/G20200343030526/Leetcode_155_526.cs:65
↓ 2 callersFunctionPushQueue
Week_03/G20200343030634/leetcode_126_634.c:115
↓ 2 callersFunctionPushTable
Week_03/G20200343030634/leetcode_126_634.c:54
↓ 2 callersMethodStartsWith
** Returns if there is any word in the trie that starts with the given prefix. */
Week_06/G20200343030498/LeetCode_212_498.go:134
↓ 2 callersFunctionTrans1
(root *Student)
Week_02/G20200343030524/m21.go:25
↓ 2 callersMethod__help
(self,x,n)
Week_03/G20200343030610/LeetCode_50_610.py:15
↓ 2 callersMethod__search
(word)
Week_06/G20200343030380/Leetcode-208-380.js:69
↓ 2 callersMethod_add_node
(self, node)
Week_07/G20200343030638/LeetCode_146_638.py:9
↓ 2 callersMethod_insertNode
(self, node: Node)
Week_07/G20200343030362/LeetCode_146_362.py:10
← previousnext →201–300 of 5,772, ranked by callers