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 callersFunctioncombine
未完成 3.1 https://leetcode-cn.com/problems/combinations/
Week 02/id_071/LeetCode_077_071.go:4
↓ 2 callersMethodcombine
沙雕递归 执行用时 :41 ms, 在所有 java 提交中击败了44.84%的用户 内存消耗 :41.1 MB, 在所有 java 提交中击败了87.05%的用户 @param n @param k @return
Week 02/id_711/Leetcode_77_711.java:50
↓ 2 callersMethodcontainsKey
(char ch)
Week 06/id_676/208.实现-trie-前缀树.java:69
↓ 2 callersMethodcontainsKey
(char ch)
Week 06/id_716/LeetCode_208_716.java:91
↓ 2 callersMethodcontainsKey
(char ch)
Week 06/id_716/LeetCode_212_716.java:142
↓ 2 callersMethodcontainsKey
(letter)
Week 06/id_336/LeetCode_336_212.js:12
↓ 2 callersMethodcontainsKey
(letter)
Week 06/id_336/LeetCode_336_208.js:6
↓ 2 callersMethodcontainsKey
(char ch)
Week 06/id_696/LeetCode_208_696.java:62
↓ 2 callersMethodcontainsKey
(char c)
Week 06/id_006/LeetCode_208_006.java:13
↓ 2 callersMethodcontainsKey
(char c)
Week 06/id_006/LeetCode_212_006.java:24
↓ 2 callersMethodcontainsKey
(char key)
Week 06/id_611/LeetCode_208_611.java:53
↓ 2 callersMethodcontainsKey
(char key)
Week 06/id_611/LeetCode_212_611.java:72
↓ 2 callersMethodcontainsKey
(char ch)
Week 06/id_156/208_java.java:14
↓ 2 callersMethodcontainskey
(char ch)
Week 06/id_321/LeetCode_208_321.java:12
↓ 2 callersFunctioncould_place
(row, col)
Week 02/id_246/LeetCode_51_246.py:28
↓ 2 callersFunctioncountInRange
(nums []int, num, start, end int)
Week 02/id_011/majority-element.go:29
↓ 2 callersMethodcountInRange
(int[] nums, int num, int lo, int hi)
Week 02/id_041/MajorityElement.java:45
↓ 2 callersMethodcountMajorityElement
计算在左右half 数组中中位数出现的次数 @author Shaobo.Qian @date 2019/11/5
Week 02/id_371/Leetcode_169_371.java:58
↓ 2 callersMethodcountSegment
(String s, int start, int end)
Week 05/id_696/LeetCode_647_696.java:14
↓ 2 callersMethoddeserialize
Decodes your encoded data to tree. :type data: str :rtype: TreeNode
Week 02/id_251/LeetCode_297_251.py:58
↓ 2 callersFunctiondpGO
(nums)
Week 05/id_256/LeetCode_213_256.js:20
↓ 2 callersMethodexpandAroundCenter
(String s, int left, int right)
Week 08/id_306/LongestPalindromicSubstring.java:28
↓ 2 callersMethodfillMap
(Map<String, List<String>> map1, Map<String, List<String>> map2, String word)
Week 06/id_466/LeetCode_127_466.java:188
↓ 2 callersMethodfillMap
(Map<String, List<String>> map1, Map<String, List<String>> map2, String word)
Week 03/id_466/LeetCode_127_466.java:188
↓ 2 callersMethodfillNextLevelSet
( Map<String, Set<String>> map1, Map<String, Set<String>> map2, Set<String
Week 06/id_466/LeetCode_127_466.java:308
↓ 2 callersMethodfillNextLevelSet
( Map<String, Set<String>> map1, Map<String, Set<String>> map2, Set<String
Week 03/id_466/LeetCode_127_466.java:308
↓ 2 callersFunctionfind
Week 06/id_016/LeetCode_547_016.js:86
↓ 2 callersFunctionfind
(p)
Week 06/id_591/LeetCode_200_591.js:16
↓ 2 callersFunctionfind
(p)
Week 06/id_256/LeetCode_547_256.js:19
↓ 2 callersFunctionfind
(p)
Week 06/id_256/LeetCode_200_256.js:37
↓ 2 callersFunctionfind
(s, left, right)
Week 05/id_256/LeetCode_647_256.js:15
↓ 2 callersFunctionfind
(s, i, j)
Week 05/id_361/leetCode_647_361.js:7
↓ 2 callersMethodfind
(int parent[], int i)
Week 06/id_216/Week06.java:10
↓ 2 callersMethodfind
(int i)
Week 06/id_216/Week06.java:98
↓ 2 callersMethodfind
(int p)
Week 06/id_431/LeetCode_547_431.java:42
↓ 2 callersMethodfind
(int p)
Week 06/id_431/LeetCode_200_431.java:92
↓ 2 callersMethodfind
(int p)
Week 06/id_676/547.朋友圈.java:23
↓ 2 callersMethodfind
(int parent[], int i)
Week 06/id_556/LeetCode_547_556.java:69
↓ 2 callersMethodfind
(int index)
Week 06/id_306/NumberOfIslands.java:26
↓ 2 callersMethodfind
(int p)
Week 06/id_321/LeetCode_547(2)_321.java:36
↓ 2 callersMethodfind
(int i)
Week 06/id_321/LeetCode_200_321.java:60
↓ 2 callersMethodfind
查找元素 i 的根节点 @param i @param parent 所有元素的父节点 @return
Week 06/id_371/Leetcode_547_371.java:18
↓ 2 callersMethodfind
(int p)
Week 06/id_161/NumIslands.java:50
↓ 2 callersMethodfind
(int p)
Week 06/id_161/FriendZone.java:31
↓ 2 callersMethodfind
(int p)
Week 06/id_721/LeetCode_547_721.java:68
↓ 2 callersMethodfind
(int[] parent, int p)
Week 06/id_716/LeetCode_547_716.java:72
↓ 2 callersMethodfind
(int p)
Week 06/id_716/LeetCode_200_716.java:190
↓ 2 callersMethodfind
(int parent[], int i)
Week 06/id_756/[547] 朋友圈.java:2
↓ 2 callersMethodfind
(int parent[], int i)
Week 06/id_416/LeetCode_547_416.java:3
↓ 2 callersMethodfind
(int i)
Week 06/id_416/LeetCode_200_416.java:25
↓ 2 callersMethodfind
(int i)
Week 06/id_466/LeetCode_547_466.java:110
↓ 2 callersMethodfind
(int p)
Week 06/id_711/Leetcode_200_711.java:21
↓ 2 callersMethodfind
(int p)
Week 06/id_711/Leetcode_547_711.java:14
↓ 2 callersMethodfind
(int[] parent,int i)
Week 06/id_501/week06/LeetCode_547_501.java:13
↓ 2 callersMethodfind
(int p)
Week 06/id_501/week06/UnionFind.java:20
↓ 2 callersMethodfind
(int u)
Week 06/id_436/Leetcode_547_436.java:16
↓ 2 callersMethodfind
(int parent[], int i)
Week 06/id_026/LeetCode_547_026.java:2
↓ 2 callersMethodfind
(int i)
Week 06/id_006/LeetCode_200_006.java:56
↓ 2 callersMethodfind
(int i)
Week 06/id_006/LeetCode_547_006.java:34
↓ 2 callersMethodfind
(int p)
Week 06/id_241/LeetCode_547_241.java:32
↓ 2 callersMethodfind
(int node)
Week 06/id_691/691-Week 06/LeetCode-200-691.java:60
↓ 2 callersMethodfind
(int p)
Week 06/id_491/LeetCode_547_491.java:33
↓ 2 callersMethodfind
(int i)
Week 06/id_641/lesson13/LeetCode_200_641.java:33
↓ 2 callersMethodfind
(int parent[], int i)
Week 06/id_506/LeetCode_547_506.java:2
↓ 2 callersMethodfind
(p int)
Week 06/id_071/UnionFind.go:15
↓ 2 callersMethodfindCircleNum
(int[][] M)
Week 06/id_466/LeetCode_547_466.java:75
↓ 2 callersMethodfindParent
(int[] parent, int i)
Week 06/id_471/LeetCode_547_471.java:3
↓ 2 callersMethodfindRoot
:num：某个小朋友 :parent：多个集合树 一直找到这个小朋友所在集合的代表，即树根
Week 06/id_566/leetcode_547_566.py:34
↓ 2 callersMethodfindRoot
(self, num, parent)
Week 06/id_246/LeetCode_547_246.py:50
↓ 2 callersMethodfindRoot
(int id)
Week 06/id_386/LeetCode_547_386.java:33
↓ 2 callersMethodfind_child
Week 06/id_446/LeetCode_208_446.cpp:7
↓ 2 callersMethodget
(char ch)
Week 06/id_676/208.实现-trie-前缀树.java:72
↓ 2 callersMethodget
(char ch)
Week 06/id_306/TrieNode.java:21
↓ 2 callersMethodget
(char ch)
Week 06/id_321/LeetCode_208_321.java:16
↓ 2 callersMethodget
(char ch)
Week 06/id_281/LeetCode_208_281.java:22
↓ 2 callersMethodget
(char ch)
Week 06/id_716/LeetCode_208_716.java:83
↓ 2 callersMethodget
(char ch)
Week 06/id_716/LeetCode_212_716.java:134
↓ 2 callersMethodget
(char ch)
Week 06/id_696/LeetCode_208_696.java:65
↓ 2 callersMethodget
(int p)
Week 06/id_466/LeetCode_200_466.java:151
↓ 2 callersMethodget
(char c)
Week 06/id_131/LeetCode_208_131.java:62
↓ 2 callersMethodget
(char c)
Week 06/id_006/LeetCode_208_006.java:22
↓ 2 callersMethodget
(char c)
Week 06/id_006/LeetCode_212_006.java:33
↓ 2 callersMethodget
(char key)
Week 06/id_611/LeetCode_208_611.java:58
↓ 2 callersMethodget
(char key)
Week 06/id_611/LeetCode_212_611.java:77
↓ 2 callersMethodget
(char ch)
Week 06/id_156/208_java.java:17
↓ 2 callersMethodget
(char ch)
Week 06/id_471/LeetCode_208_471.java:67
↓ 2 callersMethodget
(Integer key)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/cache/LRUCache.java:49
↓ 2 callersMethodgetAns
(String s, int start)
Week 05/id_321/LeetCode_91_321.java:13
↓ 2 callersMethodgetCh
(letter)
Week 06/id_336/LeetCode_336_208.js:9
↓ 2 callersMethodgetEndNode
(String word)
Week 06/id_466/LeetCode_208_466.java:87
↓ 2 callersMethodgetKey
()
Week 03/id_216/Week03.java:18
↓ 2 callersMethodgetNeighbors
(int maxX, int maxY)
Week 06/id_466/LeetCode_212_466.java:131
↓ 2 callersMethodgetNode
(int key)
Week 07/id_466/LeetCode_146_466.java:106
↓ 2 callersMethodgetParentList
(TreeNode root, TreeNode p)
Week 02/id_491/LeetCode_236_491.java:27
↓ 2 callersFunctionheapAdjust
(parent)
Week 07/id_091/sort.py:87
↓ 2 callersFunctionheapify
(heap, start, end)
Week 07/id_556/SortFuntions.py:171
↓ 2 callersMethodheapifyUpToDown
(int[] content, int index, int count)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/binaryheap/HeapSort.java:80
↓ 2 callersMethodhelper
(int start, int end, int[] nums)
Week 05/id_676/213.打家劫舍-ii.java:30
↓ 2 callersMethodhelper
(int start, int end, int[] nums)
Week 05/id_676/213.打家劫舍-ii.java:53
↓ 2 callersMethodhelper
(int start, int end, int[] nums)
Week 05/id_676/213.打家劫舍-ii.java:75
← previousnext →301–400 of 6,280, ranked by callers