MCPcopy Create free account

hub / github.com/algorithm006-class02/algorithm006-class02 / functions

Functions5,772 in github.com/algorithm006-class02/algorithm006-class02

⨍ Functions 5,772◇ Types & classes 2,815
↓ 1 callersMethoddfs
(int[][] M, int[] visited, int i)
Week_06/G20200343030378/LeetCode_547_378.java:2
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week_06/G20200343030494/LeetCode_200_494.java:2
↓ 1 callersMethoddfs
(HashSet<String> step, int stepCount, String current, String end, String[] bank)
Week_06/G20200343030494/LeetCode_433_494.java:7
↓ 1 callersMethoddfs
(char[][] board, int i, int j, TrieNode p, List<String> res)
Week_06/G20200343030020/word-searchii.java:22
↓ 1 callersMethoddfs
(List<List<String>> res, List<String> list, int row, int n)
Week_07/G20200343030436/52.n皇后-ii.java:21
↓ 1 callersMethoddfs
(int n, int level, int col, int xy, int yx, int mask)
Week_07/G20200343030580/LeetCode_52_580.java:6
↓ 1 callersMethoddfs
(int n, int level, int col, int xy, int yx, int mask, char[][] store, List<List<String>> result)
Week_07/G20200343030580/LeetCode_51_580.java:9
↓ 1 callersMethoddfs
(int row, int col, int pie, int na, int n)
Week_07/G20200343030414/LeetCode_52_414.java:19
↓ 1 callersMethoddfs
($n, $row, $col, $pie, $na)
Week_07/G20200343030032/LeetCode_51_032.php:23
↓ 1 callersMethoddfs
(self, grid, r, c)
Week_03/G20200389010036/LeetCode_200_036.py:21
↓ 1 callersMethoddfs
(self, left, right, n, s)
Week_03/G20200343030640/lessons/lesson8/22_generate_parentheses.py:18
↓ 1 callersMethoddfs
(List<List<Integer>> ans, int[] nums, List<Integer> list, int index)
Week_03/G20200343030640/lessons/lesson8/78_subsets.java:17
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week_03/G20200343030436/200.岛屿数量.java:27
↓ 1 callersMethoddfs
(int[] prices, int index, int length, int status, int profits)
Week_03/G20200343030436/122.买卖股票的最佳时机-ii.java:23
↓ 1 callersMethoddfs
(String cur, String endWord, HashSet<String> dict, HashMap<String, A
Week_03/G20200343030436/126.单词接龙-ii.java:57
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week_03/G20200343030590/LeetCode_200_590.java:3
↓ 1 callersMethoddfs
(String cur, String end, Set<String> dict, HashMap<String, ArrayList<String>> nodeNeighbors,
Week_03/G20200343030590/LeetCode_126_590.java:74
↓ 1 callersMethoddfs
(char[][] board, int r, int c)
Week_03/G20200343030022/LeetCode_529_022.java:56
↓ 1 callersMethoddfs
dfs深度优先遍历
Week_03/G20200343030022/LeetCode_200_022.java:24
↓ 1 callersMethoddfs
(List<List<String>> res, Map<String, List<String>> mapTree, String beginWord, String endWord, LinkedList<Strin
Week_03/G20200343030022/LeetCode_126_022.java:99
↓ 1 callersMethoddfs
@param grid 二维数组 @param nowRow 当前行 @param nowCol 当前列
Week_03/G20200343030566/Leetcode_200_566.java:75
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week_03/G20200343030456/LeetCode_200_456.java:25
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week_03/G20200343030460/LeetCode_200_460.java:30
↓ 1 callersMethoddfs
(char[][] grid, int i, int j)
Week_03/G20200343030364/LeetCode_200_364.java:26
↓ 1 callersMethoddfs
(char[][] board, int colIndex, List<List<String>> res)
Week_03/G20200343030390/backtracking/Leetcode_51_390.java:60
↓ 1 callersMethoddfs
(char[][] grid, int i, int j)
Week_03/G20200343030390/dfsbfs/Leetcode_200_390.java:59
↓ 1 callersMethoddfs
上下左右的进行dsf，将岛屿上下左右的节点改为非'1'
Week_03/G20200343030414/LeetCode_200_414.java:29
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week_03/G20200343030368/LeetCode_200_368.java:2
↓ 1 callersMethoddfs
(int row, int col)
Week_03/G20200343030386/LeetCode_200_386.java:59
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week_03/G20200343030494/LeetCode_200_494.java:2
↓ 1 callersMethoddfs
(int[] price, int index, int len, int status, int profit)
Week_03/G20200343030020/best-time-to-buy-and-sell-stock-ii.java:25
↓ 1 callersMethoddfs
(String s, int level, HashMap<Integer, Integer> map)
Week_05/G20200343030564/LeetCode_91_564.java:56
↓ 1 callersMethoddfsHelper
(int row, int[][] M, int[] visited)
Week_06/G20200343030584/LeetCode_547_584.java:51
↓ 1 callersMethoddfsHelper
(char[][] grid, int i, int j)
Week_03/G20200343030584/LeetCode_200_584.java:68
↓ 1 callersMethoddfsIslans
(char[][] grid, int i, int j, int m, int n)
Week_06/G20200343030518/leetcode_200_518.java:20
↓ 1 callersMethoddfsIslans
(char[][] grid, int i, int j, int m, int n)
Week_03/G20200343030518/leetcode_200_518.java:20
↓ 1 callersMethoddfsMark
(char[][] grid, int i, int j)
Week_03/G20200343030378/LeetCode_200_378.java:22
↓ 1 callersMethoddfsMarking
(char[][] grid, int i, int j, int n, int m)
Week_03/G20200343030580/LeetCode_200_580.java:20
↓ 1 callersMethoddfsnotDFS
(char[][] board, int i, int j)
Week_06/G20200343030436/130.被围绕的区域.java:75
↓ 1 callersMethoddigui
(String s, int start)
Week_08/G20200343030408/dp1.java:9
↓ 1 callersMethoddpHelper
(String content, int index)
Week_05/G20200343030584/LeetCode_91_584.java:35
↓ 1 callersMethoddpHelper2
(String content, int index, Map<Integer, Integer> cache)
Week_05/G20200343030584/LeetCode_91_584.java:66
↓ 1 callersMethoddsf
(int[][] m, int[] visited, int i)
Week_06/G20200343030564/LeetCode_547_564.java:71
↓ 1 callersMethodfastPow
(double x,long n)
Week_03/G20200343030022/LeetCode_50_022.java:26
↓ 1 callersMethodfastPow
(double x, long n)
Week_03/G20200343030390/divideandconquer/Leetcode_50_390.java:53
↓ 1 callersMethodfastPow
(double x, long n)
Week_03/G20200343030434/LeetCode_50_434.java:30
↓ 1 callersMethodfastPow
Week_03/G20200343030462/leetcode-50-462.cpp:13
↓ 1 callersMethodfastpow
(double x ,long n)
Week_03/G20200343030512/LeeCode_50_512.java:51
↓ 1 callersMethodfib_v2
(self, N: int)
Week_05/G20200343030632/Leetcode_509_632.py:22
↓ 1 callersMethodfillStrContest
获取填充内容 @param str @param length @return
Week_07/G20200343030426/StringUtils.java:35
↓ 1 callersMethodfillStrPrefix
填充字符串 前缀 @param string 待填充字符串 @param str 填充内容 @param length 字符串需达到长度 @return
Week_07/G20200343030426/StringUtils.java:19
↓ 1 callersFunctionfind
(left int, right int, nums []int, lenn int)
Week_03/G20200343030524/m321.go:14
↓ 1 callersMethodfind
开始进行寻找 @param board @param visited @param i @param j @param m @param n @param resSet @param root
Week_06/G20200343030566/Leetcode_212_566.java:47
↓ 1 callersMethodfindAdjacentBlankNode
(char[][] board, int row, int col)
Week_03/G20200343030368/LeetCode_529_368.java:10
↓ 1 callersMethodfindAnagrams
数组 时间复杂度：O() 空间复杂度：O(1) @param s @param p @return
Week_08/G20200343030564/LeetCode_438_564.java:58
↓ 1 callersMethodfindCircleNum
(int[][] M)
Week_06/G20200343030584/LeetCode_547_584.java:34
↓ 1 callersMethodfindCircleNum
(int[][] M)
Week_06/G20200343030600/LeetCode_547_600.java:6
↓ 1 callersMethodfindCircleNum
并查集 时间复杂度：O(n^3)，访问整个矩阵一次，并查集操作需要最坏 O(n) 的时间 空间复杂度：O(n)，parent 大小为 n @param M @return
Week_06/G20200343030564/LeetCode_547_564.java:89
↓ 1 callersMethodfindCircleNum
(int[][] M)
Week_06/G20200343030534/LeetCode_547_534.java:16
↓ 1 callersMethodfindCircleNum1
DFS 时间复杂度：O(n^2)，整个矩阵都要被遍历，大小为 n^2 空间复杂度：O(n) visited 数组的大小 @param M @return
Week_06/G20200343030564/LeetCode_547_564.java:56
↓ 1 callersMethodfindCircleNum2
* 方法二：并查集 * @param $grid */
Week_06/G20200343030032/LeetCode_547_032.php:53
↓ 1 callersMethodfindComb
(int n, int k, int begin, Stack<Integer> p)
Week_02/G20200343030364/LeetCode_77_364.java:20
↓ 1 callersMethodfindContentChildren
贪心算法，先用最小的饼干喂饱胃口最小的小孩， 这个解法有误，因为一个小朋友只能拥有一块饼干，这样求解会使得一个小朋友拥有多块饼干 @param g @param s @return
Week_03/G20200343030566/Leetcode_455_566.java:18
↓ 1 callersMethodfindContentChildren
(int[] g, int[] s)
Week_03/G20200343030434/LeetCode_455_434.java:10
↓ 1 callersMethodfindContentChildren
(int[] g, int[] s)
Week_03/G20200343030628/LeetCode_455_628.java:33
↓ 1 callersMethodfindContentChildren
贪心算法 @param g @param s @return
Week_03/G20200343030564/LeetCode_455_564.java:50
↓ 1 callersMethodfindContentChildren
(self, g, s)
Week_03/G20200343030016/LeetCode_455_016.py:10
↓ 1 callersMethodfindLadders
(self, beginWord, endWord, wordList)
Week_03/G20200343030398/LeetCode_126_398.py:45
↓ 1 callersMethodfindMax
(int[] height)
Week_00/G20200343030434/LeetCode_42_434.java:30
↓ 1 callersMethodfindMax
(int[] height)
Week_01/G20200343030434/LeetCode_42_434.java:30
↓ 1 callersMethodfindMin2
寻找最小元素 @param nums @return
Week_03/G20200343030566/Leetcode_153_566.java:52
↓ 1 callersMethodfindNextHighIndex
(int[] nums, int startIndex, int endIndex)
Week_01/G20200343030580/LeetCode_42_580.java:30
↓ 1 callersMethodfindPreHightIndex
(int[] nums, int startIndex, int endIndex)
Week_01/G20200343030580/LeetCode_42_580.java:39
↓ 1 callersFunctionfindWords
O(k*l) + O(m*m-k) + O(k*2^l) m:board的长度 k:words非相同的前缀数量 l:words中最大word的长度
Week_06/G20200343030498/LeetCode_212_498.go:20
↓ 1 callersMethodfindWords
(self, board: List[List[str]], words: List[str])
Week_06/G20200343030398/LeetCode_212_398.py:5
↓ 1 callersMethodfindWords
(char[][] board, String[] words)
Week_06/G20200343030584/LeetCode_212_584.java:42
↓ 1 callersMethodfindWords
(char[][] board, String[] words)
Week_06/G20200343030566/Leetcode_212_566.java:13
↓ 1 callersMethodfindWords
(char[][] board, String[] words)
Week_06/G20200343030600/LeetCode_212_600.java:11
↓ 1 callersMethodfind_rotate_index
(int left, int right)
Week_03/G20200343030460/LeetCode_33_460..java:29
↓ 1 callersMethodfind_rotation_index
(int left, int right)
Week_03/G20200343030020/search-in-rotated-sorted-array.java:5
↓ 1 callersMethodfirstUniqChar
(String s)
Week_08/G20200343030584/LeetCode_387_584.java:28
↓ 1 callersMethodfirstUniqChar
(String s)
Week_08/G20200343030534/LeetCode_387_534.java:14
↓ 1 callersMethodfirstUniqChar1
先统计各字符出现的次数 再按顺序查询第一个出现次数为 1 的字符 @param s @return
Week_08/G20200343030426/FirstUniqChar387.java:29
↓ 1 callersFunctiongenNext
Week_03/G20200343030634/leetcode_126_634.c:73
↓ 1 callersMethodgeneratNewList
(List<List<Integer>> list, int number)
Week_02/G20200343030580/LeetCode_77_580.java:24
↓ 1 callersFunctiongenerate
(A = [])
Week_02/G20200343030550/LeetCode_22_550.py:6
↓ 1 callersMethodgenerate
(List<List<Integer>> list, int num)
Week_02/G20200343030580/LeetCode_47_580.java:15
↓ 1 callersMethodgenerate
(List<List<Integer>> list, int num)
Week_02/G20200343030580/LeetCode_46_580.java:15
↓ 1 callersMethodgenerate
(int left, int right, int n, String str, List<String> res)
Week_02/G20200343030536/LeetCode_22_536.java:18
↓ 1 callersMethodgenerate
生成括号 @param left 左括号 @param right 右括号 @param s 拼接结果
Week_06/G20200343030566/Leetcode_22_566.java:27
↓ 1 callersMethodgenerate
(int level, int[] nums, List<Integer> s, List<List<Integer>> result)
Week_03/G20200343030434/LeetCode_78_434.java:23
↓ 1 callersMethodgenerateBoard
(int n, List<Integer> row)
Week_03/G20200343030542/LeetCode_51_542.java:41
↓ 1 callersFunctiongenerateChessBoard
(result, board, n)
Week_03/G20200343030380/Leetcode-51-380.js:39
↓ 1 callersMethodgenerateOnebyOne
(String sublist,List<String> result, int left, int right)
Week_06/G20200343030436/22.括号生成.java:18
↓ 1 callersMethodgenerateParenthesis
(int n)
Week_02/G20200343030536/LeetCode_22_536.java:11
↓ 1 callersMethodgenerateParenthesis
(int n)
Week_03/G20200343030600/LeetCode_22_600.java:7
↓ 1 callersMethodgenerate_qipan
(self, n)
Week_03/G20200343030640/lessons/lesson8/51_n_queens.py:9
↓ 1 callersMethodgenerate_qipan
(self, n)
Week_03/G20200343030640/lessons/lesson8/51_.py:19
↓ 1 callersMethodget
(int key)
Week_07/G20200343030580/LeetCode_146_580.java:29
↓ 1 callersMethodget
(int key)
Week_07/G20200343030404/LeetCode_146_404.java:16
← previousnext →801–900 of 5,772, ranked by callers