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 callersMethoddfs
(int row, LinkedList<Integer> stack, int n, boolean[] col, boolean[] left, boolean[] righ
Week 06/id_466/LeetCode_51_466.java:81
↓ 1 callersMethoddfs
(int x, int y, String s)
Week 06/id_711/Leetcode_212_711.java:106
↓ 1 callersMethoddfs
(char[][] board, int i, int j, TrieNode p, List<String> res)
Week 06/id_106/212.word-search-ii.java:63
↓ 1 callersMethoddfs
(int row, int col, int rows, int cols, char[][] board, String tempWord, Trie trie, Set<String> result)
Week 06/id_006/LeetCode_212_006.java:118
↓ 1 callersMethoddfs
(char[][] grid, int i, int j)
Week 06/id_386/LeetCode_200_386.java:14
↓ 1 callersMethoddfs
(self,board, node,i,j,path,res)
Week 06/id_651/LeetCode_212_651.py:47
↓ 1 callersMethoddfs
(self, grid, i, j, m, n marked)
Week 06/id_651/LeetCode_200_651.py:44
↓ 1 callersMethoddfs
(int[][] M, int[] visited, int i)
Week 06/id_681/LeetCode_547_681.java:2
↓ 1 callersMethoddfs
(int[][] M, int[] visited, int i)
Week 06/id_366/Leetcode_547_366.java:10
↓ 1 callersMethoddfs
(int[][] M,int[] visited, int i)
Week 06/id_691/691-Week 06/LeetCode-574-691.java:3
↓ 1 callersMethoddfs
(char[][] board, int row, int col, String str, Trie trie)
Week 06/id_611/LeetCode_212_611.java:39
↓ 1 callersMethoddfs
(final int[][] M, final int[] visited, final int i)
Week 06/id_641/lesson13/LeetCode_537_641.java:30
↓ 1 callersMethoddfs
(char[][] board, int i, int j)
Week 06/id_296/LeetCode_130_296.java:36
↓ 1 callersMethoddfs
(int i, int j, String result, boolean[][] visited, Trie tree, List<String> results,char[][] board)
Week 06/id_471/LeetCode_212_471.java:24
↓ 1 callersMethoddfs
(char[][] board, int x, int y)
Week 06/id_471/LeetCode_130_471.java:18
↓ 1 callersMethoddfs
(self, board, node, i, j, path, res)
Week 07/id_101/[212]单词搜索 II.py:77
↓ 1 callersMethoddfs
(self, M, i, visited)
Week 07/id_101/[547]朋友圈.py:57
↓ 1 callersMethoddfs
(self, queens, xy_dif, xy_sum, n, result)
Week 07/id_251/LeetCode_52_251.py:67
↓ 1 callersMethoddfs
(int row, LinkedList<Integer> stack, int n, boolean[] col, boolean[] left, boolean[] righ
Week 07/id_466/LeetCode_52_466.java:78
↓ 1 callersMethoddfs
(int row, LinkedList<Integer> stack, int n, boolean[] col, boolean[] left, boolean[] righ
Week 07/id_466/LeetCode_51_466.java:85
↓ 1 callersMethoddfs
(int n, int row, int colLine[], int[] line1, int[] line2, List<String> result, List<List<String>> results)
Week 07/id_471/LeetCode_51_471.java:12
↓ 1 callersMethoddfs
(int row, int pie, int na, int size)
Week 07/id_471/LeetCode_52_471.java:10
↓ 1 callersMethoddfs
(self, res, path, curr_word, dest_word, parents)
Week 03/id_101/[126]Word Ladder II.py:87
↓ 1 callersMethoddfs
(char[][] board, int i, int j)
Week 03/id_431/LeetCode_529_431.java:19
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week 03/id_511/LeetCode_200_511.java:15
↓ 1 callersMethoddfs
(char[][] grid,int len1,int len2,int x,int y)
Week 03/id_306/NumIslands_dfs.java:33
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week 03/id_321/LeetCode_200_321.java:12
↓ 1 callersMethoddfs
(int x, int y, int width, int height, char[][] grid)
Week 03/id_476/LeetCode_200_476.java:97
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week 03/id_606/200.岛屿数量.java:66
↓ 1 callersMethoddfs
(String currWord, String endWord, Set<String> dict, Map<String, List<String>> nodeNeighbors, Map<String, Integ
Week 03/id_371/Leetcode_126_371.java:42
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week 03/id_161/islands.java:2
↓ 1 callersMethoddfs
(Map<String, List<String>> neighborsMap, List<List<String>> res, String beginWord, String endWord, Deque<Strin
Week 03/id_516/LeetCode_126_516.java:58
↓ 1 callersMethoddfs
(TreeNode node, int level, List<Integer> res)
Week 03/id_716/LeetCode_515_716.java:40
↓ 1 callersMethoddfs
(String s, int left, int right, int n, List<String> res)
Week 03/id_716/LeetCode_22_716.java:17
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week 03/id_756/[200]Number of Islands.java:2
↓ 1 callersMethoddfs
(char[][] grid,int r,int c)
Week 03/id_501/LeetCode_200_501.java:26
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week 03/id_691/691-Week 03/LeeCode_200_691.java:22
↓ 1 callersMethoddfs
(self, grid, i, j)
Week 03/id_116/[200]岛屿数量.py:46
↓ 1 callersMethoddfs
(int row, int column, char[][] grid)
Week 03/id_491/LeetCode_200_491.java:19
↓ 1 callersMethoddfs
(char[][] board, int row, int column)
Week 03/id_491/LeetCode_529_491.java:15
↓ 1 callersMethoddfs
(char[][] grid,int r,int y)
Week 03/id_611/LeetCode_200_611.java:83
↓ 1 callersMethoddfs
(int i, int j)
Week 03/id_641/lesson9/LeetCode_200_641.java:45
↓ 1 callersMethoddfs
(int x, int y, char[][] board)
Week 03/id_471/LeetCode_529_471.java:14
↓ 1 callersMethoddfs
(int x, int y, char[][] grid, int[][] path)
Week 03/id_471/LeetCode_200_471.java:18
↓ 1 callersMethoddfs
(self, root)
Week 02/id_551/LeetCode_590_551.py:17
↓ 1 callersMethoddfs
(self, root)
Week 02/id_551/LeetCode_589_551.py:16
↓ 1 callersMethoddfs
(int[] nums, ArrayList<Integer> subList, int index, List<List<Integer>> results)
Week 02/id_371/Leetcode_78_371.java:41
↓ 1 callersMethoddfs
(self, digits, dic, index, path, res)
Week 02/id_091/LeetCode_17_091.py:13
↓ 1 callersMethoddfs
(self, digits, idx, path, res)
Week 02/id_491/[17]Letter Combinations of a Phone Number.py:35
↓ 1 callersMethoddfs
(TreeNode root, TreeNode p, TreeNode q)
Week 02/id_766/LeetCode_236_766.java:23
↓ 1 callersMethoddfs
解题思路： 1 每个元素选或者不选两种结果 2 元素的索引就是递归的层级 @param res 结果 @param nums 数组 @param list 子集 @param index 层级
Week 02/id_286/LeetCode_78_286.java:28
↓ 1 callersMethoddfs
(char[][] board, int colIndex, List<List<String>> res)
Week 02/id_286/LeetCode_51_286.java:27
↓ 1 callersMethoddfs
(int row, int n, List<String> board, List<List<String>> results, boolean visitCol[], boolean visitLine1[], boo
Week 02/id_471/LeetCode_51_471.java:12
↓ 1 callersMethoddfs
(Node root)
Week 02/id_471/LeetCode_590_471.java:9
↓ 1 callersMethoddfs
(TreeNode root)
Week 02/id_471/LeetCode_144_471.java:8
↓ 1 callersMethoddfs
(int cur, String result, List<String> results, Map<Character, String> map, String digits)
Week 02/id_471/LeetCode_17_471.java:20
↓ 1 callersMethoddfs
(List<String> results, StringBuilder result, int left, int right, int n)
Week 02/id_471/LeetCode_22_471.java:9
↓ 1 callersMethoddfs
(TreeNode root)
Week 02/id_471/LeetCode_94_471.java:11
↓ 1 callersMethoddfs
(Node root)
Week 02/id_471/LeetCode_589_471.java:8
↓ 1 callersMethoddfs
(int cur, int[] nums, List<Integer> result, List<List<Integer>> results)
Week 02/id_471/LeetCode_78_471.java:9
↓ 1 callersMethoddfs2
(char[][] board, int pos)
Week 06/id_716/LeetCode_130_716.java:68
↓ 1 callersMethoddfs2
(int row, int cols, int pl, int pr, int n)
Week 07/id_466/LeetCode_52_466.java:107
↓ 1 callersMethoddfs2
(int n, int row, int cols, int pl, int pr, List<List<String>> store, LinkedList<Integer> stack,
Week 07/id_466/LeetCode_51_466.java:134
↓ 1 callersMethoddfsFill
(char[][] grid,int i, int j)
Week 03/id_136/LeetCode_200_136.java:13
↓ 1 callersMethoddfsMarking
(char[][] grid, int i, int j)
Week 06/id_716/LeetCode_200_716.java:57
↓ 1 callersMethoddfs_helper
递归遍历左右分支树，但是需要传当前深度（层），这样出栈时就可以确定自己的层并保存正确 @param node @param level @param levels
Week 03/id_306/LevelOrder.java:65
↓ 1 callersFunctiondiff
(str1, str2)
Week 03/id_256/LeetCode_127_256.js:42
↓ 1 callersMethoddigits
(String combition,String next_digits)
Week 02/id_611/LeetCode_17_611.java:24
↓ 1 callersMethoddigui
(String str,int start)
Week 08/id_501/week08/LeetCode_91_501.java:42
↓ 1 callersMethoddivideConquer
(int[] nums, int lo, int hi)
Week 02/id_371/Leetcode_169_371.java:33
↓ 1 callersFunctiondivision
(nums []int, start, end int)
Week 02/id_011/majority-element.go:7
↓ 1 callersFunctiondoSolve
(res *[][]string, n int, path []int)
Week 06/id_071/LeetCode_051_071.go:10
↓ 1 callersFunctiondoSolve
(res *[][]string, n int, path []int)
Week 02/id_071/LeetCode_051_071.go:10
↓ 1 callersMethoddoubleDfs
(Set<String> begin, Set<String> end, Map<String, List<String>> neighborsMap, boolean isFromBeginToEnd, Set<Str
Week 03/id_516/LeetCode_126_516.java:21
↓ 1 callersMethoddp
(int i, int j, String word1, String word2)
Week 05/id_556/LeetCode_72_556.java:19
↓ 1 callersMethoddynamicPlan
(int n)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/recursion/Solution.java:79
↓ 1 callersFunctionfastPow
(x, n)
Week 02/id_256/LeetCode_50_256.js:45
↓ 1 callersMethodfastPow
(double x, long n)
Week 02/id_371/Leetcode_50_371.java:26
↓ 1 callersMethodfastPow
(double x, long n)
Week 02/id_286/LeetCode_50_286.java:38
↓ 1 callersFunctionfib
(n, memo)
Week 05/id_441/fibonacci.js:2
↓ 1 callersMethodfib
(int n)
Week 02/id_021/algorithm/src/main/java/com/lqw/algorithm/recursion/Solution.java:93
↓ 1 callersMethodfind
(char[][] board, boolean[][] visited, int i, int j, int m, int n, Set<String> result, TrieNode212 node)
Week 06/id_321/LeetCode_212_321.java:30
↓ 1 callersMethodfind
(char [] [] board, boolean [][]visited,int i,int j,int m,int n,Set<String> result,trieNode cur)
Week 06/id_696/LeetCode_212_696.java:31
↓ 1 callersMethodfind
(char[][] board, boolean[][] marked, int i, int j,
Week 06/id_276/Leetcode_212.java:23
↓ 1 callersMethodfind
Week 06/id_151/LeetCode_208_151.cpp:43
↓ 1 callersMethodfind
(char [] [] board, boolean [][]visited,int i,int j,int m,int n,Set<String> result,trieNode cur)
Week 06/id_156/212_java.java:56
↓ 1 callersMethodfind
(char [] [] board, boolean [][]visited,int i,int j,int m,int n,Set<String> result,trieNode cur)
Week 06/id_346/LeetCode_212_346.java:39
↓ 1 callersMethodfindAnagrams
(String s, String p)
Week 08/id_371/Leetcode_438_371.java:18
↓ 1 callersFunctionfindBreakPoint
(nums []int)
Week 03/id_531/leetCode_33_531.go:37
↓ 1 callersFunctionfindCircleNum
(M)
Week 06/id_016/LeetCode_547_016.js:73
↓ 1 callersMethodfindCircleNum
(int[][] M )
Week 06/id_711/Leetcode_547_711.java:45
↓ 1 callersMethodfindCircleNum
(int[][] M)
Week 06/id_006/LeetCode_547_006.java:44
↓ 1 callersFunctionfindCombination
(digits *string, index int, s string)
Week 02/id_736/LeetCode_17_736.go:28
↓ 1 callersMethodfindCombinations
(int n, int k, int index, Stack<Integer> p)
Week 02/id_321/LeetCode_77-321.java:27
↓ 1 callersMethodfindCombinations
(int n, int k, int index, Stack<Integer> s)
Week 02/id_041/Combinations.java:20
↓ 1 callersFunctionfindContentChildren
(g, s)
Week 03/id_571/leetcode_455_571.js:6
↓ 1 callersMethodfindContentChildren
(int[] g, int[] s)
Week 03/id_516/LeetCode_455_516.java:10
↓ 1 callersMethodfindContentChildren
执行用时 :10 ms, 在所有 java 提交中击败了99.34%的用户 内存消耗 :39.2 MB, 在所有 java 提交中击败了96.14%的用户 @param g @param s @return
Week 03/id_711/Leetcode_455_711.java:20
↓ 1 callersMethodfindContentChildren
(int[] grid, int[] size)
Week 03/id_641/lesson10/LeetCode_455_641.java:15
↓ 1 callersMethodfindContentChildren1
原解1:贪心算法 @author Shaobo.Qian @date 2019/11/2
Week 03/id_371/Leetcode_455_371.java:28
← previousnext →801–900 of 6,280, ranked by callers