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
↓ 2 callersMethodhelper
(int level, int col, List<List<Integer>> triangle)
Week 05/id_716/LeetCode_120_716.java:17
↓ 2 callersMethodinArea
(int row, int col, int rows, int cols)
Week 03/id_006/LeetCode_529_006.java:105
↓ 2 callersMethodinorder
(self, root)
Week 02/id_251/tree_node.py:24
↓ 2 callersMethodinsert
(self, word)
Week 06/id_381/leetcode-212.py:6
↓ 2 callersMethodinsert
Inserts a word into the trie.
Week 06/id_466/LeetCode_208_466.java:62
↓ 2 callersMethodinsert
Week 06/id_151/LeetCode_212_151.cpp:17
↓ 2 callersMethodinsertLast
Adds an item at the rear of Deque. Return true if the operation is successful.
Week 01/id_556/LeetCode_641_556.java:50
↓ 2 callersMethodinsertLast
Adds an item at the rear of Deque. Return true if the operation is successful.
Week 01/id_416/LeetCode_641_416.java:75
↓ 2 callersMethodisAnagram
(String s, String t)
Week 02/id_466/LeetCode_242_466.java:47
↓ 2 callersMethodisAncestor
判断一个节点是否是另外一个节点的祖先 @author Shaobo.Qian @date 2019/11/5
Week 02/id_371/Leetcode_236_371.java:75
↓ 2 callersFunctionisBetter
(b byte)
Week 08/id_011/reverse-only-letters.go:21
↓ 2 callersMethodisEmpty
Checks whether the circular deque is empty or not. :rtype: bool
Week 01/id_251/LeetCode_641_251.py:308
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_686/LeetCode_641_686.java:113
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_476/LeetCode_641_476.java:138
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_371/LeetCode_641_371.java:125
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not. :rtype: bool
Week 01/id_251/LeetCode_641_251.py:125
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not. :rtype: bool
Week 01/id_251/LeetCode_641_251.py:226
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not. :rtype: bool
Week 01/id_251/LeetCode_641_251.py:315
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_006/LeetCode_641_006.java:81
↓ 2 callersMethodisFull
()
Week 01/id_241/LeetCode_641_241.java:71
↓ 2 callersMethodisFull
()
Week 01/id_241/LeetCode_641_241.java:145
↓ 2 callersMethodisFull
()
Week 01/id_241/LeetCode_641_241.java:222
↓ 2 callersMethodisFull
()
Week 01/id_421/LeetCode_641_421.java:71
↓ 2 callersMethodisFull
()
Week 01/id_421/LeetCode_641_421.java:145
↓ 2 callersMethodisFull
()
Week 01/id_421/LeetCode_641_421.java:222
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_541/P641DesignCircularDeque.java:148
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_701/leetcode_641_701.py:68
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_751/LeetCode_641_751.java:102
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_296/LeetCode_641_296.java:100
↓ 2 callersMethodisValid
(String s, int begin, int end)
Week 08/id_476/LeetCode_680_476.java:22
↓ 2 callersMethodisValidSudoku
(char[][] board)
Week 06/id_466/LeetCode_36_466.java:109
↓ 2 callersMethodjoin
(int i1, int j1, int i2, int j2)
Week 06/id_466/LeetCode_130_466.java:249
↓ 2 callersMethodladderLength4Helper
(LinkedList<Pair<String, Integer>> queue, HashMap<String, Integer> set,
Week 06/id_241/LeetCode_127_241.java:124
↓ 2 callersFunctionlevelOrder
(root)
Week 03/id_521/102.二叉树的层次遍历.js:4
↓ 2 callersMethodlongestValidParentheses2
(String s)
Week 05/id_556/LeetCode_32_556.java:40
↓ 2 callersMethodlowBound
(int[] list, long num)
Week 07/id_466/LeetCode_493_466.java:115
↓ 2 callersFunctionlowestCommonAncestor
(root, p, q)
Week 02/id_256/LeetCode_236_256.js:21
↓ 2 callersMethodlowestCommonAncestor
(TreeNode root, TreeNode p, TreeNode q)
Week 02/id_466/LeetCode_236_466.java:103
↓ 2 callersFunctionmax
(a, b int)
Week 05/id_451/LeetCode_221_451.go:7
↓ 2 callersMethodmaxRight
(int index,int[] height)
Week 01/id_541/P42TrappingRainWater.java:63
↓ 2 callersFunctionmerge
(left, right)
Week 07/id_556/SortFuntions.py:47
↓ 2 callersMethodmerge
从后往前合并
Week 01/id_006/LeetCode_88_006.java:45
↓ 2 callersFunctionmergeTwoLists
Week 01/id_586/21-merge-two-sorted-lists.c:10
↓ 2 callersFunctionmin
(a, b int)
Week 05/id_451/LeetCode_221_451.go:1
↓ 2 callersMethodminDistance
(String word1, String word2)
Week 05/id_466/LeetCode_72_466.java:59
↓ 2 callersFunctionminInt
(i, j int)
Week 05/id_011/maximal-square.go:25
↓ 2 callersMethodmoveNodeToHead
将节点移动到头部 @param doubleNode
Week 07/id_431/LeetCode_146_431.java:63
↓ 2 callersMethodmoveToFirst
(node *doubleLinkedList)
Week 07/id_011/lru-cache.go:29
↓ 2 callersMethodmoveToHead
(DLinkedNode node)
Week 07/id_081/LRUCache.java:45
↓ 2 callersMethodmoveToHead
(DLinkedNode node)
Week 07/id_346/LeetCode_146_346.java:43
↓ 2 callersMethodmoveToTail
(DoubleLinkedListNode node)
Week 07/id_491/LeetCode_146_491.java:35
↓ 2 callersMethodmoveToTail
(node *lruNode)
Week 07/id_071/LeetCode_146_071.go:122
↓ 2 callersFunctionmoveZeroes
(nums)
Week 01/id_016/LeetCode_283_016.js:16
↓ 2 callersMethodmoveZeroes_twice_1016
@param nums 数组 @return void @author Rico @description 做第二遍; 卡壳了一阵，做题的时候只记得用i和j分别表示0位和非0位元素， 发现test case跑失败，愣了一下，不知所措，后来静下来分析l一下， j位也需要移动找到0位，因为有可能起始位不
Week 01/id_721/LeetCode_283_721.java:81
↓ 2 callersMethodmove_node_to_tail
(self, key)
Week 07/id_246/LeetCode_146_246.py:67
↓ 2 callersMethodnewArray
(self, nums)
Week 01/id_251/LeetCode_283_251.py:76
↓ 2 callersMethodnumIslands
(char[][] grid)
Week 06/id_466/LeetCode_200_466.java:65
↓ 2 callersMethodnumIslands
(char[][] grid)
Week 03/id_306/NumIslands_bfs.java:20
↓ 2 callersMethodnumIslands
(char[][] grid)
Week 03/id_306/NumIslands_dfs.java:17
↓ 2 callersMethodnumIslands
(char[][] grid)
Week 03/id_476/LeetCode_200_476.java:39
↓ 2 callersMethodnumIslands
(char[][] grid)
Week 03/id_466/LeetCode_200_466.java:65
↓ 2 callersMethodnumIslands
(self, grid)
Week 03/id_246/LeetCode_200_246.py:32
↓ 2 callersMethodnumIslands
(char[][] grid)
Week 03/id_641/lesson9/LeetCode_200_641.java:21
↓ 2 callersMethodparent
(i int)
Week 06/id_261/leetcode_547_261.go:17
↓ 2 callersFunctionplace_queen
(row, col)
Week 02/id_246/LeetCode_51_246.py:31
↓ 2 callersMethodpopToTail
(Entry entry)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/cache/LRUCache.java:90
↓ 2 callersMethodpostorder
(self, root)
Week 02/id_251/tree_node.py:31
↓ 2 callersMethodpreorder
(self, root)
Week 02/id_251/tree_node.py:17
↓ 2 callersFunctionprintArray
Week 01/id_518/LeetCode_001_518.c:4
↓ 2 callersFunctionprintArray
Week 01/id_518/LeetCode_283_518.c:3
↓ 2 callersFunctionquick_sort
(arr, l, r)
Week 07/id_556/SortFuntions.py:112
↓ 2 callersMethodrecur
(TreeNode root, Integer lower, Integer upper)
Week 02/id_371/Leetcode_98_371.java:29
↓ 2 callersMethodremoveDuplicates
(int[] nums)
Week 01/id_466/LeetCode_26_466.java:71
↓ 2 callersMethodremoveLast
()
Week 07/id_011/lru-cache.go:41
↓ 2 callersMethodremoveLast
删除并返回最后一个节点 @return
Week 07/id_371/Leetcode_146_371.java:71
↓ 2 callersMethodremoveNode
删除节点 @param doubleNode
Week 07/id_431/LeetCode_146_431.java:40
↓ 2 callersMethodremoveNode
(DLinkedNode node)
Week 07/id_081/LRUCache.java:37
↓ 2 callersMethodremoveNode
(DLinkedNode node)
Week 07/id_346/LeetCode_146_346.java:32
↓ 2 callersFunctionremove_queen
(row, col)
Week 02/id_246/LeetCode_51_246.py:37
↓ 2 callersFunctionreverse
(b []byte)
Week 08/id_071/LeetCode_541_071.go:17
↓ 2 callersMethodreversePairs
(int[] nums)
Week 07/id_466/LeetCode_493_466.java:57
↓ 2 callersMethodreversePairsHelper
(int[] nums, int left, int right)
Week 07/id_241/LeetCode_493_241.java:14
↓ 2 callersMethodrobber
(int[] nums, int start, int end)
Week 05/id_471/LeetCode_213_471.java:9
↓ 2 callersMethodscan_helper
(self, s, benchmark)
Week 05/id_101/[32]Longest Valid Parentheses.py:105
↓ 2 callersFunctionsearch
(i, j, node, pre, visited)
Week 06/id_566/leetcode_212_566.py:19
↓ 2 callersMethodsearch
(String word)
Week 06/id_081/Tire.java:18
↓ 2 callersMethodsearch
(int[] nums, int target)
Week 03/id_641/lesson11/LeetCode_33_641.java:14
↓ 2 callersMethodsearchNode
(String word)
Week 06/id_006/LeetCode_208_006.java:57
↓ 2 callersMethodsearchNode
(key int )
Week 07/id_071/LeetCode_146_071.go:65
↓ 2 callersFunctionsearchPrefix
(word)
Week 06/id_336/LeetCode_336_212.js:42
↓ 2 callersFunctionsearchPrefix
(word)
Week 06/id_336/LeetCode_336_208.js:35
↓ 2 callersFunctionsearchPrefix
(word)
Week 06/id_256/LeetCode_208_256.js:37
↓ 2 callersFunctionsearchPrefix
(word)
Week 06/id_256/LeetCode_212_256.js:28
↓ 2 callersMethodsearchPrefix
(String word)
Week 06/id_676/208.实现-trie-前缀树.java:31
↓ 2 callersMethodsearchPrefix
(String word)
Week 06/id_306/PrefixTree.java:31
↓ 2 callersMethodsearchPrefix
(String word)
Week 06/id_716/LeetCode_208_716.java:30
↓ 2 callersMethodsearchPrefix
(String word)
Week 06/id_716/LeetCode_212_716.java:81
↓ 2 callersMethodsearchPrefix
(String word)
Week 06/id_696/LeetCode_208_696.java:25
↓ 2 callersMethodsearchPrefix
(String prefix)
Week 06/id_131/LeetCode_208_131.java:33
↓ 2 callersMethodsearchPrefix
(String word)
Week 06/id_241/LeetCode_208_241.java:32
← previousnext →401–500 of 6,280, ranked by callers