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
↓ 6 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030386/LeetCode_641_386.java:72
↓ 6 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030548/LeetCode_641_548.java:73
↓ 6 callersMethodleft
Week_03/G20200343030506/LeetCode_874_506.cpp:10
↓ 6 callersFunctionlowestCommonAncestor
Week_02/G20200343030634/leetcode_236_634.c:35
↓ 6 callersFunctionmergeTwoLists
Week_01/G20200343030420/LeetCode_21_420.c:5
↓ 6 callersFunctionndoePos
* 遍历边界上所有为'O'的点，分别扩散；最后遍历整个二维，未被扩散到的'O'改为'X. * 扩散的话有四种方式：dfs递归，dfs非递归（借助stack），bfs非递归（借助queue），bfs递归（这种不常用） * 还有一种方法是用并查集，所有边界上的'O'以及和边界上'O'能连通的'O'都
Week_06/G20200343030420/LeetCode_130_420.c:23
↓ 6 callersMethodpop
(self)
Week_01/G20200343030632/Leetcode_155_632.py:22
↓ 6 callersFunctionpostorder
(root)
Week_02/G20200343030430/LeetCode_590_430.js:12
↓ 6 callersMethodremoveDuplicates
(int[] nums)
Week_00/G20200343030534/LeetCode_1_534.java:34
↓ 6 callersMethodremoveDuplicates
(int[] nums)
Week_01/G20200343030534/LeetCode_1_534.java:34
↓ 6 callersFunctionreverse
(nums, start, end)
Week_01/G20200343030382/LeetCode_189_382.js:76
↓ 6 callersMethodreverse
(char[] arr, int i, int j)
Week_08/G20200343030592/LeetCode_541_592.java:17
↓ 6 callersMethodright
Week_03/G20200343030506/LeetCode_874_506.cpp:18
↓ 6 callersMethodtoBinary
(int n)
Week_07/G20200343030426/BinaryUtils.java:10
↓ 5 callersMethodInsert
在链表的第i个位置钱插入一个元素e。复杂度为O(n)
Week_01/G20200343030524/xmaths/m7.go:18
↓ 5 callersMethodcontainsKey
(char ch)
Week_06/G20200343030436/208.实现-trie-前缀树.java:18
↓ 5 callersMethodcontainsKey
(char ch)
Week_06/G20200343030584/LeetCode_208_584.java:70
↓ 5 callersMethodcount
(int[] nums, int startIndex, int endIndex, boolean left)
Week_01/G20200343030580/LeetCode_42_580.java:48
↓ 5 callersFunctionfind
Week_03/G20200343030634/leetcode_127_634.c:67
↓ 5 callersFunctionhammingWeight
leetcode submit region begin(Prohibit modification and deletion)
Week_07/G20200343030008/LeetCode_191_008.go:39
↓ 5 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030490/LeetCode_641_490.java:128
↓ 5 callersMethodisFull
Checks whether the circular deque is full or not.
Week_01/G20200343030584/LeetCode_641_584.java:123
↓ 5 callersFunctionisValidBST
(root)
Week_02/G20200343030380/Leetcode-98-380.js:26
↓ 5 callersMethodmerge
Week_06/G20200343030454/LeetCode_547.cpp:31
↓ 5 callersFunctionmyCircularDequeIsEmpty
Checks whether the circular deque is empty or not. */
Week_01/G20200343030400/LeetCode_239_400.c:28
↓ 5 callersFunctionpostorderTraversal
(root)
Week_02/G20200343030430/LeetCode_145_430.js:12
↓ 5 callersFunctionpreorderTraversal
Week_02/G20200343030450/Licode-144-450.c:21
↓ 5 callersFunctionpreorderTraversal
:type root: TreeNode :rtype: List[int]
Week_02/G20200343030550/LeetCode_144_550.py:1
↓ 5 callersMethodprintArray
(int[] nums)
Week_01/G20200343030584/Utils.java:2
↓ 5 callersMethodremove
(Node node)
Week_07/G20200343030020/lru_cache.java:34
↓ 5 callersMethodreverse
(char[] a, int i, int j)
Week_08/G20200343030020/reverse-words-in-a-string.java:28
↓ 5 callersFunctionsort
(arr, p, r)
Week_01/G20200343030610/LeetCode_283_610.py:18
↓ 5 callersMethodunion
(int node1, int node2)
Week_06/G20200343030436/130.被围绕的区域.java:127
↓ 5 callersMethodunion
(int node1, int node2)
Week_06/G20200343030024/LeetCode_130_024.java:51
↓ 5 callersFunctionunionS
Week_06/G20200343030420/LeetCode_130_420.c:13
↓ 4 callersMethodGet
获取链表中的第I个元素，复杂度为O(n)
Week_01/G20200343030524/xmaths/m7.go:58
↓ 4 callersMethodInsertFront
** Adds an item at the front of Deque. Return true if the operation is successful. */
Week_01/G20200343030498/LeetCode_641_498.go:58
↓ 4 callersMethodIsEmpty
** Checks whether the circular deque is empty or not. */
Week_01/G20200343030008/LeetCode_641_008.go:139
↓ 4 callersMethodIsEmpty
** Checks whether the circular deque is empty or not. */
Week_01/G20200343030498/LeetCode_641_498.go:145
↓ 4 callersMethodLength
单链表的长度
Week_01/G20200343030524/xmaths/m7.go:71
↓ 4 callersMethodUnion
Week_06/G20200343030558/LeetCode-200-558.cpp:33
↓ 4 callersMethodUnion
Week_06/G20200343030614/LeetCode_200_614.cpp:25
↓ 4 callersFunction_siftup
(heap, pos)
Week_01/G20200343030608/heapq.py:160
↓ 4 callersFunctionbacktrack
(result, n, board = [], row = 0)
Week_03/G20200343030380/Leetcode-51-380.js:14
↓ 4 callersFunctionbfs
(rowLength, colLength, grid, i, j)
Week_06/G20200343030380/Leetcode-200-380.js:54
↓ 4 callersMethoddfs
深度优先遍历，把当前位置联通的O都变为
Week_06/G20200343030440/leetcode_130_440.php:38
↓ 4 callersMethoddfs
(int i, int j, char[][] board)
Week_06/G20200343030372/Surrounded_regions_130.java:48
↓ 4 callersMethodfind
(int node)
Week_06/G20200343030436/130.被围绕的区域.java:135
↓ 4 callersMethodfind
(int node)
Week_06/G20200343030024/LeetCode_130_024.java:59
↓ 4 callersMethodfind
(int p)
Week_06/G20200343030404/LeetCode_547_404.java:39
↓ 4 callersMethodfind
(int x)
Week_06/G20200343030414/LeetCode_547_414.java:78
↓ 4 callersMethodfind
(int x)
Week_06/G20200343030422/LeetCode_547_422.java:36
↓ 4 callersMethodfind
(int x)
Week_05/G20200343030012/LeetCode_547_012.java:52
↓ 4 callersFunctionfindS
可以借助递归实现路径压缩 */
Week_06/G20200343030420/LeetCode_130_420.c:8
↓ 4 callersMethodget
(char ch)
Week_06/G20200343030590/LeetCode_208_590.java:19
↓ 4 callersMethodgetNode
(char c)
Week_06/G20200343030580/LeetCode_212_580.java:45
↓ 4 callersMethodgetRoot
()
Week_06/G20200343030440/leetcode_208_440.php:21
↓ 4 callersMethodhelper
(char[][] board,int x,int y,int m,int n,char flag)
Week_06/G20200343030510/LeetCode_130_510.java:26
↓ 4 callersMethodhelper
(char[][] board, int r, int c)
Week_06/G20200343030020/surrounded-regions.java:27
↓ 4 callersMethodinsert
(Node node)
Week_07/G20200343030020/lru_cache.java:40
↓ 4 callersMethodinsertFront
Adds an item at the front of Deque. Return true if the operation is successful.
Week_01/G20200343030584/LeetCode_641_584.java:35
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not. :rtype: bool
Week_01/G20200343030488/641.设计循环双端队列.py:84
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030436/641.设计循环双端队列.java:87
↓ 4 callersMethodisEmpty
()
Week_01/G20200343030024/LeetCode_622_024.java:69
↓ 4 callersMethodisEmpty
()
Week_01/G20200343030024/LeetCode_622_024.java:147
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030584/MyCircularDeque2.java:117
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030580/LeetCode_641_580.java:104
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030492/LeetCode_641_492.java:170
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030566/src/main/java/com/sebar/algorithm/Leetcode_641_566.java:115
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030402/MyCircularDeque.java:119
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030620/LeetCode_641_620.py:66
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030422/LeetCode_641_442.java:74
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week_01/G20200343030378/LeetCode_641_378.java:80
↓ 4 callersFunctionisValid
(s)
Week_00/G20200343030430/LeetCode_20_430.js:5
↓ 4 callersFunctionletterCombinations
(digits)
Week_03/G20200343030430/LeetCode_17_430.js:5
↓ 4 callersFunctionlevelOrder
(self, root: 'Node')
Week_02/G20200343030398/LeetCode_429_398.py:33
↓ 4 callersMethodminPathSum
(self, grid: List[List[int]])
Week_05/G20200343030398/LeetCode_64_398.py:10
↓ 4 callersFunctionmyCircularDequeIsEmpty
Checks whether the circular deque is empty or not. */
Week_01/G20200343030400/LeetCode_641_400.c:24
↓ 4 callersFunctionpermute
Week_02/G20200343030634/leetcode_46_634.c:66
↓ 4 callersMethodput
(char ch, TrieNode node)
Week_06/G20200343030584/LeetCode_208_584.java:78
↓ 4 callersMethodput
(char ch, TrieNode node)
Week_06/G20200343030386/LeetCode_208_386.java:90
↓ 4 callersMethodremoveDuplicates
(int[] nums)
Week_01/G20200343030004/src/LeetCode_26_004.java:5
↓ 4 callersMethodreverse
(char[] arr, int start, int end)
Week_08/G20200343030386/LeetCode_557_386.java:34
↓ 4 callersMethodreverse
(int[] nums , int start , int end)
Week_01/G20200343030606/LeetCode_189_606.java:54
↓ 4 callersMethodsetNext
(LinkedNode next)
Week_07/G20200343030426/LinkedNode.java:48
↓ 4 callersMethodsetPrev
(LinkedNode prev)
Week_07/G20200343030426/LinkedNode.java:40
↓ 4 callersMethodtop
(self)
Week_01/G20200343030632/Leetcode_155_632.py:29
↓ 4 callersFunctionunion
(p,q)
Week_06/G20200447010018/200.岛屿数量.js:66
↓ 4 callersFunctionunion
(p,q)
Week_06/G20200343030030/LeetCode_200_030.js:30
↓ 4 callersMethodunion
(int x, int y)
Week_06/G20200343030436/200.岛屿数量.java:111
↓ 4 callersMethodunion
(int x, int y)
Week_06/G20200343030024/LeetCode_200_024.java:29
↓ 4 callersMethodunion
(int x, int y)
Week_06/G20200343030578/LeetCode_200_578.java:56
↓ 4 callersMethodunion
(int[] parent, int x, int y)
Week_06/G20200343030536/LeetCode_200_536.java:59
↓ 4 callersMethodunion
(int x, int y)
Week_06/G20200343030572/LeetCode_200_572.java:29
↓ 4 callersMethodunion
(int x, int y)
Week_06/G20200343030564/LeetCode_200_564.java:220
↓ 3 callersFunctionDfs
传递到下一层需要的信息，1是level，2是极限max，3data，这里max是k组合长度，data是已经完成拼接的数组
Week_02/G20200343030634/leetcode_77_634.c:34
↓ 3 callersMethodGetFront
** Get the front item from the deque. */
Week_01/G20200343030498/LeetCode_641_498.go:123
↓ 3 callersFunctionInitTable
Week_03/G20200343030634/leetcode_126_634.c:46
↓ 3 callersMethodInsertFront
** Adds an item at the front of Deque. Return true if the operation is successful. */
Week_01/G20200343030008/LeetCode_641_008.go:85
↓ 3 callersMethodIsFull
** Checks whether the circular deque is full or not. */
Week_01/G20200343030008/LeetCode_641_008.go:144
← previousnext →101–200 of 5,772, ranked by callers