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
↓ 1 callersFunctionfindDivision
找到分割点
Week 03/id_736/LeetCode_33_736.go:28
↓ 1 callersFunctionfindIndex
(nums []int, value int)
Week 02/id_011/construct-binary-tree-from-preorder-and-inorder-traversal.go:17
↓ 1 callersMethodfindIndexOfZero
(int[][] board)
Week 06/id_306/SlidingPuzzle.java:131
↓ 1 callersFunctionfindLadderHelper
(beginWord, endWord, wordList, res, temp)
Week 06/id_256/LeetCode_126_256.js:23
↓ 1 callersMethodfindLadders
仿解1(BFS+DFS) @author Shaobo.Qian @date 2019/10/31
Week 03/id_371/Leetcode_126_371.java:24
↓ 1 callersMethodfindLadders
(String beginWord, String endWord, List<String> wordList)
Week 03/id_131/LeetCode_126_131.java:7
↓ 1 callersMethodfindLaddersHelper
(String beginWord, String endWord, HashMap<String, ArrayList<String>> map,
Week 03/id_311/LeetCode_126_Solution.java:15
↓ 1 callersMethodfindMiddle
(int[] nums, int start, int end)
Week 02/id_471/LeetCode_169_471.java:6
↓ 1 callersFunctionfindMin
(nums)
Week 03/id_016/LeetCode_153_016.js:67
↓ 1 callersFunctionfindMin
3.3 https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/
Week 03/id_071/LeetCode_153_071.go:4
↓ 1 callersMethodfindMin
原解1:二分查找(每次确定剩下空间的最小值,和之前已确定的空间最小值进行比较) @author Shaobo.Qian @date 2019/11/3
Week 03/id_371/Leetcode_153_371.java:20
↓ 1 callersMethodfindMin
(int[] nums)
Week 03/id_491/LeetCode_33_491.java:26
↓ 1 callersMethodfindMinIndex
(int[] nums)
Week 03/id_476/LeetCode_33_476.java:60
↓ 1 callersMethodfindMines
(int x, int y, char[][] board)
Week 03/id_471/LeetCode_529_471.java:34
↓ 1 callersMethodfindMinidx
(int[] nums)
Week 03/id_611/LeetCode_33_611.java:25
↓ 1 callersMethodfindRecur
(char[][] board, boolean[][] visited, int i, int j, int rows, int column, Set<String> result, TrieNode cur)
Week 06/id_721/LeetCode_212_721.java:40
↓ 1 callersMethodfindRotateIndex
(int[] a)
Week 03/id_556/LeetCode_33_556.java:46
↓ 1 callersMethodfindWords
(char[][] board, String[] words)
Week 06/id_466/LeetCode_212_466.java:70
↓ 1 callersMethodfindWords
先用字典树对所给的单词建树，然后对char数组进行dsf，利用字典树剪枝。 执行用时 :27 ms, 在所有 java 提交中击败了69.77%的用户 内存消耗 :47.3 MB, 在所有 java 提交中击败了88.51%的用户 @param board @param words @return
Week 06/id_711/Leetcode_212_711.java:89
↓ 1 callersMethodfindWordsHelper
(int i, int j, Trie trie, HashSet<String> result, String s, char[][] board, int ml, int nl)
Week 06/id_241/LeetCode_212_241.java:17
↓ 1 callersMethodfind_rotate_index
(int left, int right)
Week 03/id_281/LeetCode_33_281.java:5
↓ 1 callersMethodfindpermuteUnique
(int[] nums,int dept, Stack<Integer> path)
Week 02/id_611/LeetCode_47_611.java:15
↓ 1 callersMethodfirstUniqChar
Week 08/id_536/leetcode_387_536.cpp:9
↓ 1 callersMethodfirstUniqChar2
防解2:字符转数组 @author Shaobo.Qian @date 2019/12/6
Week 08/id_371/Leetcode_387_371.java:64
↓ 1 callersFunctionformat
(memo)
Week 02/id_571/leetcode_51_571.js:28
↓ 1 callersMethodfound
(int begin, int end)
Week 03/id_491/LeetCode_126_491.java:32
↓ 1 callersMethodgenPermution
(int[] nums,boolean[] visited,int curSize,int len,Stack<Integer> path,List<List<Integer>> res)
Week 02/id_346/Permute_46.java:27
↓ 1 callersMethodgeneatePermute
(int[] nums,List<List<Integer>> resList,int curSize,int len,boolean[] used,Stack<Integer> path)
Week 02/id_611/LeetCode_46_611.java:20
↓ 1 callersMethodgenerate
(int left, int right, int max, String s, List<String> parenthesis)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/recursion/SolutionOne.java:34
↓ 1 callersMethodgenerate
(self, left: int, right: int, level: int, s: str)
Week 02/id_701/leetcode_22_701.py:7
↓ 1 callersMethodgenerateCombinations
回溯+剪枝 @param n @param k @param start @param list
Week 02/id_306/Combine.java:18
↓ 1 callersMethodgenerateList
(Queue<Integer> queue, int n)
Week 06/id_081/NQueens.java:49
↓ 1 callersFunctiongenerateParenthesis
(n)
Week 03/id_016/LeetCode_22_016.js:47
↓ 1 callersFunctiongenerateParenthesis
(n)
Week 02/id_016/LeetCode_22_016.js:47
↓ 1 callersMethodgenerateParenthesis
(int n)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/recursion/SolutionOne.java:28
↓ 1 callersMethodgenerateParenthesis
Week 02/id_536/leetcode_22_536.cpp:35
↓ 1 callersMethodgenerateParenthesis
(self, n: int)
Week 02/id_636/LeetCode_22_636.py:20
↓ 1 callersMethodgenerateParenthesis1
仿解1:回溯法 @param n @return
Week 02/id_371/Leetcode_22_371.java:23
↓ 1 callersMethodgenerateParenthesis2
(self, n)
Week 06/id_251/LeetCode_22_251.py:59
↓ 1 callersMethodgeneratePermute1
(int[] nums, boolean[] visited, int curSize, int len, Stack<Integer> path, List<List<Integer>> res)
Week 02/id_371/Leetcode_46_371.java:39
↓ 1 callersFunctiongenerateResult
(res [][]int, n int)
Week 06/id_301/LeetCode_51_301.go:43
↓ 1 callersFunctiongenerateResult
()
Week 07/id_631/LeetCode_51_631.go:37
↓ 1 callersMethodgenerateSolution
(int[] solution)
Week 07/id_131/LeetCode_51_131.java:32
↓ 1 callersMethodget
(int key)
Week 07/id_241/LeetCode_146_241.java:23
↓ 1 callersMethodget
(K key)
Week 02/id_416/MyHashMap.java:96
↓ 1 callersMethodgetAns
(String s,int start)
Week 05/id_501/week05/LeetCode_91_501.java:19
↓ 1 callersMethodgetAns
(String s, int start)
Week 08/id_641/lesson19/LeetCode_91_641.java:9
↓ 1 callersMethodgetBombShellNumber
(int clickRow, int clickCol, int rows, int cols, char[][] board)
Week 03/id_006/LeetCode_529_006.java:92
↓ 1 callersFunctiongetCandidates
(word string)
Week 06/id_071/LeetCode_127_071.go:46
↓ 1 callersFunctiongetCandidates
(word string)
Week 03/id_071/LeetCode_127_071.go:46
↓ 1 callersMethodgetContainSize
(TreeNode root, int p, int q)
Week 02/id_466/LeetCode_236_466.java:126
↓ 1 callersMethodgetCount
()
Week 06/id_216/Week06.java:119
↓ 1 callersMethodgetCount
()
Week 06/id_306/FriendCircles.java:49
↓ 1 callersMethodgetCount
()
Week 06/id_321/LeetCode_200_321.java:82
↓ 1 callersMethodgetCount
()
Week 06/id_161/NumIslands.java:67
↓ 1 callersMethodgetCount
()
Week 06/id_161/FriendZone.java:48
↓ 1 callersMethodgetCount
()
Week 06/id_716/LeetCode_200_716.java:197
↓ 1 callersMethodgetCount
()
Week 06/id_416/LeetCode_200_416.java:45
↓ 1 callersMethodgetCount
()
Week 06/id_711/Leetcode_547_711.java:31
↓ 1 callersMethodgetCount
()
Week 06/id_641/lesson13/LeetCode_200_641.java:49
↓ 1 callersMethodgetCount
()
Week 03/id_306/NumIslands_Union.java:49
↓ 1 callersFunctiongetCounter
()
Week 02/id_591/group-anagrams.js:24
↓ 1 callersMethodgetDirection
获取当前机器人行走的方向 @param direct @return
Week 03/id_431/LeetCode_874_431.java:47
↓ 1 callersMethodgetDistance
广度优先搜索，获取到最短路径上，字符串所在节点的深度 @param beginWord @param endWord @param wordList @return
Week 03/id_006/LeetCode_126_006.java:43
↓ 1 callersMethodgetEnd
()
Week 06/id_311/LeetCode_208_Solution.java:20
↓ 1 callersMethodgetFront
Get the front item from the deque.
Week 01/id_076/LeetCode_641_076.java:88
↓ 1 callersMethodgetFront
Get the front item from the deque.
Week 01/id_556/LeetCode_641_556.java:93
↓ 1 callersMethodgetFront
Get the front item from the deque.
Week 01/id_416/LeetCode_641_416.java:115
↓ 1 callersMethodgetMax
(int maxArea, int area)
Week 01/id_511/LeetCode_11_511.java:24
↓ 1 callersMethodgetMinIndex
(List<Integer> nums)
Week 01/id_371/Leetcode_155_371.java:43
↓ 1 callersMethodgetNeighbor
找到当前节点的下一层节点 @param curr @param dict @return
Week 03/id_371/Leetcode_126_371.java:104
↓ 1 callersMethodgetNextWords
(String word, Set<String> dict)
Week 03/id_436/Leetcode_127_436.java:46
↓ 1 callersMethodgetNode
(char c)
Week 06/id_466/LeetCode_208_466.java:105
↓ 1 callersMethodgetNums
(char[][] board, int x, int y)
Week 03/id_241/LeetCode_529_241.java:42
↓ 1 callersMethodgetPath
(LinkedList<LinkedList<String>> head, LinkedList<LinkedList<Strin
Week 03/id_466/LeetCode_126_466.java:182
↓ 1 callersMethodgetRealIndex
(int length, int steps, int index)
Week 03/id_491/LeetCode_33_491.java:22
↓ 1 callersMethodgetRear
Get the last item from the deque.
Week 01/id_076/LeetCode_641_076.java:97
↓ 1 callersMethodgetRear
Get the last item from the deque.
Week 01/id_556/LeetCode_641_556.java:105
↓ 1 callersMethodgetRear
Get the last item from the deque.
Week 01/id_416/LeetCode_641_416.java:128
↓ 1 callersMethodgetRear
Get the last item from the deque.
Week 01/id_006/LeetCode_641_006.java:68
↓ 1 callersMethodgetRoot
()
Week 06/id_466/LeetCode_212_466.java:172
↓ 1 callersMethodgetRoot
Week 06/id_536/leetcode_212_536.cpp:21
↓ 1 callersMethodgetRootIndexOfInorder
(int rootValue, int[] inorder)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/recursion/SolutionFour.java:65
↓ 1 callersMethodgetRowNums
(TreeNode node, int rowLevel)
Week 03/id_046/LeetCode_515_046.java:18
↓ 1 callersMethodgetStep
(Map<String, Set<String>> wordMap, Set<String> beginSet, Set<String> endSet,
Week 06/id_466/LeetCode_127_466.java:523
↓ 1 callersMethodgetStep
(Map<String, Set<String>> wordMap, Set<String> beginSet, Set<String> endSet,
Week 03/id_466/LeetCode_127_466.java:523
↓ 1 callersMethodgetVal
()
Week 03/id_216/Week03.java:26
↓ 1 callersFunctiongetWordMap
(wordList []string, beginWord string)
Week 06/id_071/LeetCode_127_071.go:32
↓ 1 callersFunctiongetWordMap
(wordList []string, beginWord string)
Week 03/id_071/LeetCode_127_071.go:32
↓ 1 callersMethodget_count
(self)
Week 06/id_361/leetCode_200_361.py:14
↓ 1 callersMethodget_count
(self)
Week 06/id_651/LeetCode_200_651.py:85
↓ 1 callersFunctiongroupAnagrams
(strs)
Week 02/id_591/group-anagrams.js:5
↓ 1 callersMethodgroupAnagrams
(String[] strs)
Week 02/id_076/LeetCode_49_076.java:12
↓ 1 callersMethodgroupAnagrams
(String[] strs)
Week 02/id_511/LeetCode_49_511.java:15
↓ 1 callersMethodgroupAnagrams
(String[] strs)
Week 02/id_476/LeetCode_49_476.java:11
↓ 1 callersMethodgroupAnagrams
原解>优化(哈希表)
Week 02/id_371/LeetCode_49_371.java:24
↓ 1 callersMethodgroupAnagrams
(String[] strs)
Week 02/id_466/LeetCode_49_466.java:50
↓ 1 callersMethodgroupAnagrams
�ⷨ����ϣ��ʵ�� ����������ַ�����Ϊ�� ֵ�����ַ��� ******/
Week 02/id_536/leetcode_49_536.cpp:16
↓ 1 callersMethodgroupAnagrams
(String[] strs)
Week 02/id_641/lesson5/Leetcode49.java:15
↓ 1 callersMethodgroupAnagrams1
题解按计数分类方法 执行用时 :50 ms, 在所有 java 提交中击败了18.53%的用户 内存消耗 :44.2 MB, 在所有 java 提交中击败了88.60%的用户 好像挺慢的。。赶紧不应该
Week 02/id_711/Leetcode_49_711.java:54
← previousnext →901–1,000 of 6,280, ranked by callers