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
↓ 6 callersMethodnodeIndex
将二维的坐标转化成一维的唯一标识
Week 06/id_371/Leetcode_130_371.java:112
↓ 5 callersMethodInsertLast
** Adds an item at the rear of Deque. Return true if the operation is successful. */
Week 01/id_071/LeetCode_641_071.go:30
↓ 5 callersMethodcontainsKey
(char ch)
Week 06/id_506/LeetCode_208_506.java:75
↓ 5 callersFunctionfindWords
(self, board: List[List[str]], words: List[str])
Week 06/id_566/leetcode_212_566.py:11
↓ 5 callersMethodgetNext
()
Week 02/id_416/MyMap.java:16
↓ 5 callersMethodgetTreeNode
(char ch)
Week 06/id_081/Tire.java:54
↓ 5 callersMethodinsert
(self, word)
Week 07/id_101/[212]单词搜索 II.py:41
↓ 5 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_076/LeetCode_641_076.java:108
↓ 5 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_541/P641DesignCircularDeque.java:141
↓ 5 callersMethodisPowerOfTwo
(int n)
Week 07/id_466/LeetCode_231_466.java:50
↓ 5 callersFunctionmax
(a, b int)
Week 05/id_451/LeetCode_213_451.go:1
↓ 5 callersFunctionrecursion
(root, res)
Week 02/id_246/LeetCode_590_246.py:17
↓ 5 callersMethodreverse
(String s)
Week 08/id_506/LeetCode_557_506.java:25
↓ 5 callersMethodsearchPrefix
(String prefix)
Week 06/id_711/Leetcode_212_711.java:36
↓ 5 callersMethodsolve
(char[][] board)
Week 06/id_466/LeetCode_130_466.java:128
↓ 5 callersMethodunion
合并两个节点 @param node1 @param node2
Week 06/id_371/Leetcode_130_371.java:34
↓ 5 callersMethodunion
(self, i, j)
Week 06/id_251/并查集代码模板.py:5
↓ 5 callersMethodunionSet
(int p, int q)
Week 06/id_431/LeetCode_130_431.java:103
↓ 4 callersMethodInsertLast
** Adds an item at the rear of Deque. Return true if the operation is successful. */
Week 01/id_301/circularDeque.go:31
↓ 4 callersMethodIsEmpty
** Checks whether the circular deque is empty or not. */
Week 01/id_301/circularDeque.go:87
↓ 4 callersMethodIsEmpty
** Checks whether the circular deque is empty or not. */
Week 01/id_071/LeetCode_641_071.go:85
↓ 4 callersMethodRun
()
Week 02/id_546/LeetCode_1_546.cs:84
↓ 4 callersMethodUnion
(b *UnionFind)
Week 06/id_451/LeetCode_200_451.go:24
↓ 4 callersFunctionbfs
(grid [][]byte, i int, j int)
Week 03/id_071/LeetCode_200_071.go:65
↓ 4 callersFunctiondfs
(res, digits, letters_map, tmp)
Week 02/id_256/LeetCode_17_256.js:20
↓ 4 callersMethoddfs
(int i, int j, char[][] board, int row, int col)
Week 06/id_601/LeetCode_130_601.java:29
↓ 4 callersFunctionfill
( grid [][]byte, visited [][]int, i, j int, mlen, nlen int)
Week 06/id_071/LeetCode_200_071.go:24
↓ 4 callersFunctionfind
(node)
Week 06/id_246/LeetCode_547_246.py:86
↓ 4 callersMethodfind
(int p)
Week 06/id_431/LeetCode_130_431.java:95
↓ 4 callersMethodfind
(int p)
Week 06/id_306/FriendCircles.java:53
↓ 4 callersMethodfind
查找根节点 @param node @return
Week 06/id_371/Leetcode_130_371.java:47
↓ 4 callersMethodfind
(int node)
Week 06/id_161/SurroundUnion.java:19
↓ 4 callersMethodfind
(int p)
Week 06/id_716/LeetCode_130_716.java:185
↓ 4 callersMethodfind
(self, p)
Week 06/id_361/leetCode_200_361.py:17
↓ 4 callersMethodfind
(int i)
Week 06/id_006/LeetCode_130_006.java:45
↓ 4 callersMethodfind
(self,p)
Week 06/id_651/LeetCode_200_651.py:87
↓ 4 callersMethodgetNode
(char c)
Week 06/id_466/LeetCode_212_466.java:189
↓ 4 callersFunctionhelper
(in_left = 0, in_right = len(inorder))
Week 02/id_246/LeetCode_105_246.py:31
↓ 4 callersMethodinsertLast
(int value)
Week 01/id_641/Leetcode641.java:32
↓ 4 callersMethodisAlpha
(char c)
Week 08/id_371/Leetcode_917_371.java:45
↓ 4 callersMethodisAnagram
(String s, String t)
Week 02/id_476/LeetCode_242_476.java:14
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_686/LeetCode_641_686.java:108
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not. :rtype: bool
Week 01/id_251/LeetCode_641_251.py:118
↓ 4 callersMethodisEmpty
()
Week 01/id_276/DisignCicularDeque.java:52
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_006/LeetCode_641_006.java:76
↓ 4 callersMethodisEmpty
()
Week 01/id_241/LeetCode_641_241.java:141
↓ 4 callersMethodisEmpty
()
Week 01/id_421/LeetCode_641_421.java:141
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_701/leetcode_641_701.py:62
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_751/LeetCode_641_751.java:97
↓ 4 callersMethodisEmpty
Checks whether the circular deque is empty or not.
Week 01/id_296/LeetCode_641_296.java:95
↓ 4 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_076/LeetCode_641_076.java:117
↓ 4 callersMethodisFull
Checks whether the circular deque is full or not.
Week 01/id_431/LeetCode_641_431.java:85
↓ 4 callersMethodisIsomorphic
(String s, String t)
Week 08/id_466/LeetCode_205_466.java:58
↓ 4 callersMethodlemonadeChange
(int[] bills)
Week 03/id_466/LeetCode_860_466.java:83
↓ 4 callersMethodmerge
(int[][] intervals)
Week 07/id_466/LeetCode_56_466.java:60
↓ 4 callersFunctionmergeSort
(array)
Week 07/id_091/sort.py:113
↓ 4 callersFunctionmin
(a, b int)
Week 05/id_071/LeetCode_064_071.go:26
↓ 4 callersFunctionmin
(ns ...int)
Week 03/id_451/LeetCode_45_451.go:1
↓ 4 callersMethodnode
(int row, int col, int cols)
Week 06/id_006/LeetCode_130_006.java:97
↓ 4 callersMethodplusOne
(int[] digits)
Week 01/id_466/LeetCode_66_466.java:60
↓ 4 callersMethodquery
(int idx)
Week 07/id_466/LeetCode_493_466.java:150
↓ 4 callersFunctionrecurse
(start,level)
Week 06/id_361/leetCode_433_361.js:60
↓ 4 callersMethodremove
删除指定节点 @param x
Week 07/id_006/LeetCode_146_006.java:52
↓ 4 callersMethodsubSudokuIndex
(int row, int col)
Week 06/id_006/LeetCode_37_006.java:63
↓ 4 callersMethodswap
(&$arr,$i,$j)
Week 02/id_566/leetcode_46_566.php:26
↓ 4 callersMethodtag
(char[][] board, int i, int j)
Week 06/id_466/LeetCode_130_466.java:160
↓ 4 callersFunctionunion
(p,q)
Week 06/id_591/LeetCode_200_591.js:23
↓ 4 callersFunctionunion
(p, q)
Week 06/id_256/LeetCode_200_256.js:44
↓ 4 callersMethodunion
(int x, int y)
Week 06/id_216/Week06.java:103
↓ 4 callersMethodunion
(int x, int y)
Week 06/id_321/LeetCode_200_321.java:66
↓ 4 callersMethodunion
(int p, int q)
Week 06/id_716/LeetCode_200_716.java:173
↓ 4 callersMethodunion
(int x, int y)
Week 06/id_416/LeetCode_200_416.java:30
↓ 4 callersMethodunion
(int x, int y)
Week 06/id_641/lesson13/LeetCode_200_641.java:40
↓ 4 callersMethodunion
(int x, int y)
Week 03/id_306/NumIslands_Union.java:34
↓ 4 callersMethodvalid
(String str)
Week 08/id_716/LeetCode_91_716.java:98
↓ 4 callersMethodvalidPalindrome
(String s)
Week 08/id_466/LeetCode_680_466.java:53
↓ 3 callersMethodDFS
(self, n, row, cols, pie, na)
Week 07/id_251/LeetCode_52_251.py:44
↓ 3 callersMethodFind
()
Week 06/id_451/LeetCode_547_451.go:40
↓ 3 callersMethodFind
()
Week 06/id_451/LeetCode_200_451.go:15
↓ 3 callersMethodIsFull
** Checks whether the circular deque is full or not. */
Week 01/id_301/circularDeque.go:95
↓ 3 callersMethodLen
()
Week 02/id_451/LeetCode_94_451.go:22
↓ 3 callersFunctionbfs
(i,j)
Week 06/id_246/LeetCode_200_246.py:81
↓ 3 callersMethodclimbStairs2
递归优化 - 缓存 @param n @return
Week 05/id_501/week05/LeetCode_70_501.java:28
↓ 3 callersFunctionclimb_stairs_3
(n)
Week 05/id_251/爬楼梯问题扩展.py:11
↓ 3 callersFunctionclimb_stairs_3_
(n)
Week 05/id_251/爬楼梯问题扩展.py:19
↓ 3 callersMethodcontainsKey
(char ch)
Week 06/id_311/LeetCode_208_Solution.java:8
↓ 3 callersMethodcontainsKey
(char ch)
Week 06/id_471/LeetCode_212_471.java:104
↓ 3 callersFunctiondfs
(rows []int, n, cols, pies, nas int)
Week 07/id_631/LeetCode_51_631.go:14
↓ 3 callersMethoddistance
priority distance @return
Week 06/id_306/SlidingPuzzle.java:91
↓ 3 callersFunctionfind
(x)
Week 06/id_246/LeetCode_200_246.py:22
↓ 3 callersMethodfind
(self, i)
Week 06/id_251/LeetCode_547_251.py:94
↓ 3 callersMethodfind
(x)
Week 07/id_101/[547]朋友圈.py:65
↓ 3 callersMethodfind
(Map<TreeNode, Integer> map, TreeNode root, TreeNode left, int height)
Week 02/id_711/Leetcode_236_711.java:49
↓ 3 callersMethodfindMin
(int[] nums)
Week 03/id_466/LeetCode_153_466.java:51
↓ 3 callersFunctionfindTarget
(nums []int, low, high, target int)
Week 03/id_736/LeetCode_33_736.go:42
↓ 3 callersMethodget
(char ch)
Week 06/id_371/Leetcode_208_371.java:30
↓ 3 callersMethodget
(int p)
Week 06/id_466/LeetCode_130_466.java:234
↓ 3 callersMethodget
(char ch)
Week 06/id_311/LeetCode_208_Solution.java:14
↓ 3 callersMethodget
(char ch)
Week 06/id_506/LeetCode_208_506.java:82
↓ 3 callersMethodgetDataMap
()
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/cache/LRUCache.java:137
← previousnext →101–200 of 6,280, ranked by callers