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
↓ 2 callersMethodhelper
(int n, int k, int begin, Stack<Integer> pre)
Week_02/G20200343030584/LeetCode_77_584.java:45
↓ 2 callersFunctioninorderTraversal
(root)
Week_02/G20200343030430/LeetCode_94_430.js:12
↓ 2 callersMethodinsert
(self, word: str)
Week_06/G20200343030016/LeetCode_208_016.py:13
↓ 2 callersMethodinsert
* Inserts a word into the trie. * @param String $word * @return NULL */
Week_06/G20200343030032/LeetCode_208_032.php:29
↓ 2 callersFunctionisAnagram
(s, t)
Week_02/G20200343030550/LeetCode_242_550.py:11
↓ 2 callersMethodisAnagram
(self, s, t)
Week_07/G20200343030016/LeetCode_242_016.py:8
↓ 2 callersMethodisBoarder
(int i, int n, int m)
Week_06/G20200343030580/LeetCode_130_580.java:64
↓ 2 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030492/LeetCode_641_492.java:92
↓ 2 callersMethodisEnd
()
Week_06/G20200343030578/LeetCode_208_578.java:57
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not. :rtype: bool
Week_01/G20200343030488/641.设计循环双端队列.py:91
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030518/LeetCode_641_518.java:109
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030640/640_wekk_01_middle_641.py:88
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030490/LeetCode_641_490.java:135
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030436/641.设计循环双端队列.java:92
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030022/LeetCode_641_022.java:78
↓ 2 callersMethodisFull
()
Week_01/G20200343030024/LeetCode_622_024.java:73
↓ 2 callersMethodisFull
()
Week_01/G20200343030024/LeetCode_622_024.java:151
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030584/MyCircularDeque2.java:124
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030580/LeetCode_641_580.java:111
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030492/LeetCode_641_492.java:175
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030566/src/main/java/com/sebar/algorithm/Leetcode_641_566.java:123
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030536/LeetCode_641_536.java:87
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030608/实现双端队列.py:72
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030402/MyCircularDeque.java:124
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030620/LeetCode_641_620.py:72
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030422/LeetCode_641_442.java:79
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030386/LeetCode_641_386.java:77
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030378/LeetCode_641_378.java:87
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030548/LeetCode_641_548.java:78
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030542/LeetCode_641_542.java:94
↓ 2 callersFunctionisInvalid
(board, row, col)
Week_03/G20200343030380/Leetcode-529-380.js:52
↓ 2 callersMethodisIsomorphicHelper
(String s, String t)
Week_08/G20200343030436/205.同构字符串.java:23
↓ 2 callersMethodisPalindrome
(String s, int i, int j)
Week_08/G20200343030518/leetcode_680_518.java:12
↓ 2 callersMethodisPalindrome
(String s,int i,int j)
Week_08/G20200343030436/680.验证回文字符串-ⅱ.java:24
↓ 2 callersMethodisPalindrome
(String s, int from, int to)
Week_08/G20200343030590/LeetCode_680_590.java:70
↓ 2 callersMethodisPalindromeRange
(String s, int i, int j)
Week_08/G20200343030590/LeetCode_680_590.java:39
↓ 2 callersMethodisParalindrome
(String s, int i, int j)
Week_08/G20200343030566/Leetcode_680_566.java:22
↓ 2 callersMethodisValidCoords
(char[][] board, int row, int col)
Week_03/G20200343030590/LeetCode_529_590.java:59
↓ 2 callersMethodis_contains_key
Week_06/G20200343030622/LeetCode_208_622.cc:9
↓ 2 callersMethodjudge
(String s, int i, int j)
Week_08/G20200343030386/LeetCode_680_386.java:45
↓ 2 callersFunctionjump
Week_03/G20200343030420/LeetCode_45_420.c:1
↓ 2 callersFunctionlRUCacheAdd
Week_07/G20200343030420/LeetCode_146_420.c:35
↓ 2 callersFunctionlRUCacheAddMoveToTail
Week_07/G20200343030420/LeetCode_146_420.c:47
↓ 2 callersFunctionlRUCacheDel
Week_07/G20200343030420/LeetCode_146_420.c:42
↓ 2 callersFunctionladderLength
leetcode submit region begin(Prohibit modification and deletion)
Week_03/G20200343030008/LeetCode_127_008.go:40
↓ 2 callersMethodlemonadeChange
贪心算法 时间复杂度：O(n) 空间复杂度：O(1) @param bills @return
Week_03/G20200343030564/LeetCode_860_564.java:61
↓ 2 callersFunctionlenPalinadrome
(i, j)
Week_08/G20200343030362/LeetCode_5_362.py:5
↓ 2 callersMethodmajorityElement
(self, nums)
Week_03/G20200343030398/LeetCode_169_398.py:13
↓ 2 callersFunctionmaxDepth
(root)
Week_02/G20200343030430/LeetCode_104_430.js:12
↓ 2 callersFunctionmaxInt
(a, b int)
Week_08/G20200343030008/LeetCode_300_008.go:48
↓ 2 callersMethodmaxProfit
暴力法 时间复杂度：O(n^2) 空间复杂度：O(1) @param prices @return
Week_03/G20200343030564/LeetCode_121_564.java:44
↓ 2 callersMethodmaxProfit2
一次循环优化 @param prices @return
Week_03/G20200343030564/LeetCode_121_564.java:81
↓ 2 callersMethodmergeSort
(int[] nums, int s, int e)
Week_07/G20200343030020/reverse-pairs.java:6
↓ 2 callersFunctionmergeTwoLists
Week_01/G20200343030558/LeetCode-21-558.cpp:11
↓ 2 callersMethodmergeTwoLists
Week 01 LeetCode 21 21.合并两个有序链表
Week_01/G20200343030376/LeetCode_21_376.java:6
↓ 2 callersFunctionmin
(a int, b int)
Week_05/G20200343030026/LeetCode_221_026.go:35
↓ 2 callersFunctionminDepth
(root)
Week_02/G20200343030430/LeetCode_111_430.js:12
↓ 2 callersMethodmockListNode
(int startVal,int endMockVal)
Week_01/G20200343030004/src/LeetCode_21_004.java:37
↓ 2 callersMethodmoveToHead
(DLinkNode node)
Week_07/G20200343030436/146.lru缓存机制.java:49
↓ 2 callersMethodmoveToHead
(DLinkedNode node)
Week_07/G20200343030024/LeetCode_146_024.java:27
↓ 2 callersMethodmoveToHead
(CacheNode node)
Week_07/G20200343030580/LeetCode_146_580.java:76
↓ 2 callersMethodmoveToHead
(DlNode node)
Week_07/G20200343030404/LeetCode_146_404.java:38
↓ 2 callersMethodmoveToHead
@param node
Week_07/G20200343030426/LRUCache146.java:127
↓ 2 callersMethodmoveToHead
(DLinkedNode node)
Week_07/G20200343030368/LeetCode_146_368.java:25
↓ 2 callersMethodmoveToHead
(DLinkedNode node)
Week_07/G20200343030422/LeetCode_146_422.java:27
↓ 2 callersMethodmoveToHead
(DLinkedNode node)
Week_07/G20200343030386/LeetCode_146_386.java:69
↓ 2 callersMethodmove_node_to_tail
(self, key)
Week_07/G20200343030496/LeetCode_146_496.py:21
↓ 2 callersMethodmove_to_tail
(self,key)
Week_07/G20200343030620/LeetCode_146_620.py:13
↓ 2 callersFunctionmyCircularDequeGetFront
Get the front item from the deque. */
Week_01/G20200343030400/LeetCode_239_400.c:72
↓ 2 callersFunctionmyCircularDequeIsFull
Checks whether the circular deque is full or not. */
Week_01/G20200343030400/LeetCode_239_400.c:33
↓ 2 callersFunctionmyCircularDequeIsFull
Checks whether the circular deque is full or not. */
Week_01/G20200343030400/LeetCode_641_400.c:29
↓ 2 callersFunctionmyPow
(x, n)
Week_03/G20200343030430/LeetCode_50_430.js:6
↓ 2 callersFunctionmyPow
(x, n)
Week_03/G20200343030610/LeetCode_50_610.py:71
↓ 2 callersMethodmyRob
(int[] nums)
Week_05/G20200343030022/LeetCode_213_022.java:14
↓ 2 callersFunctionnodeConstructor
(next *node, pre *node, data int)
Week_01/G20200343030396/LeetCode_641_396.go:16
↓ 2 callersMethodnumCount
(int[] nums, int num, int lo, int hi)
Week_03/G20200343030378/LeetCode_169_378.java:25
↓ 2 callersMethodparent
(i int)
Week_06/G20200343030398/LeetCode_547_398.go:21
↓ 2 callersMethodplaceNextNumbers
(int row, int col)
Week_06/G20200343030590/LeetCode_37_590.java:47
↓ 2 callersMethodplaceNumber
(int d, int row, int col)
Week_06/G20200343030590/LeetCode_37_590.java:24
↓ 2 callersMethodpop_front
Week_01/G20200343030374/summary.cxx:17
↓ 2 callersFunctionpreorderTraversal
* Note: The returned array must be malloced, assume caller calls free(). */
Week_02/G20200343030420/LeetCode_144_420.c:19
↓ 2 callersFunctionpush
Week_03/G20200343030634/leetcode_127_634.c:30
↓ 2 callersMethodpush
(self, x: int)
Week_01/G20200343030632/Leetcode_155_632.py:17
↓ 2 callersMethodput
(char ch, TrieNode node)
Week_06/G20200343030592/LeetCode_208_592.java:27
↓ 2 callersMethodput
(int key, int value)
Week_07/G20200343030578/LeetCode_146_578.java:43
↓ 2 callersMethodputFirst
(DoubleNode node)
Week_07/G20200343030402/[146]LRU缓存机制.java:76
↓ 2 callersFunctionquickSortString
/
Week_07/G20200343030420/LeetCode_242_420.c:2
↓ 2 callersMethodreach
(TreeNode root,int value)
Week_02/G20200343030368/LeetCode_236_368.java:11
↓ 2 callersFunctionremoveDuplicates
leetcode submit region begin(Prohibit modification and deletion)
Week_01/G20200343030008/LeetCode_26_008.go:51
↓ 2 callersMethodremoveDuplicates
(int[] nums)
Week_01/G20200343030364/LeetCode_26_364.java:25
↓ 2 callersMethodremoveDuplicates3
(int[] nums)
Week_01/G20200343030584/LeetCode_26_584.java:45
↓ 2 callersMethodremoveNode
(DLinkNode node)
Week_07/G20200343030436/146.lru缓存机制.java:42
↓ 2 callersMethodremoveNode
(DLinkedNode node)
Week_07/G20200343030024/LeetCode_146_024.java:19
↓ 2 callersMethodremoveNode
删除结点 @param node
Week_07/G20200343030426/LRUCache146.java:106
↓ 2 callersMethodremoveNode
(DLinkedNode node)
Week_07/G20200343030368/LeetCode_146_368.java:18
↓ 2 callersMethodremoveNode
(DLinkedNode node)
Week_07/G20200343030422/LeetCode_146_422.java:19
↓ 2 callersMethodremoveNode
(DLinkedNode node)
Week_07/G20200343030386/LeetCode_146_386.java:62
↓ 2 callersFunctionreverse
Week_08/G20200343030420/LeetCode_541_420.c:1
↓ 2 callersMethodreverseChars
反转数组 @param chars
Week_08/G20200343030566/Leetcode_151_566.java:92
↓ 2 callersMethodreverseString
(char[] s, int start, int end)
Week_08/G20200343030580/LeetCode_151_580.java:24
← previousnext →401–500 of 5,772, ranked by callers