MCPcopy Create free account

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

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

↓ 1 callersMethodcanRevert
是否符合转换要求
Week_03/G20200343030584/LeetCode_127_584.java:79
↓ 1 callersMethodchangeDirection
(int change)
Week_03/G20200343030580/LeetCode_874_580.java:4
↓ 1 callersMethodchangeGrid
($i, $j, $row, $col, &$grid)
Week_06/G20200343030032/LeetCode_547_032.php:28
↓ 1 callersMethodchangeGrid
($i, $row, $j, $col, &$grid)
Week_03/G20200343030032/LeetCode_200_032.php:37
↓ 1 callersFunctioncharDiff
(str1, str2)
Week_03/G20200343030380/Leetcode-127-380.js:31
↓ 1 callersMethodcleanSpace
(char[] chars, int len)
Week_08/G20200343030566/Leetcode_151_566.java:45
↓ 1 callersMethodcleanSpaces
(char[] a, int n)
Week_08/G20200343030004/src/LeetCode_151_004.java:28
↓ 1 callersMethodcleanSpaces
(char[] a, int n)
Week_08/G20200343030020/reverse-words-in-a-string.java:18
↓ 1 callersMethodclean_space
(char[] s_arr, int n)
Week_08/G20200343030436/151.翻转字符串里的单词.java:63
↓ 1 callersFunctionclear
(i, j)
Week_03/G20200343030362/LeetCode_200_362.py:10
↓ 1 callersMethodclerks
@param bills 账单列表 @param billIndex 当前处理账单 @param fiveNum 当前5美元数量 @param tenNum 当前10美元数量 @return
Week_03/G20200343030426/LemonadeChange860.java:103
↓ 1 callersFunctionclimbStairs
(n)
Week_02/G20200343030550/LeetCode_70_550.py:1
↓ 1 callersMethodclimbStairs1
动态规划 时间复杂度:O(1) 空间复杂度:O(n) @param n @return
Week_06/G20200343030564/LeetCode_70_564.java:71
↓ 1 callersMethodclimbStairs2
动态规划 优化 时间复杂度:O(1) 空间复杂度:O(1) @param n @return
Week_06/G20200343030564/LeetCode_70_564.java:93
↓ 1 callersMethodclimbStairsInternal
(int n, Map<Integer, Integer> cache)
Week_01/G20200343030542/LeetCode_70_542.java:14
↓ 1 callersFunctionclimb_Stairs
(i, n, memo)
Week_02/G20200343030550/LeetCode_70_550.py:5
↓ 1 callersMethodclimb_Stairs
(int i, int n)
Week_01/G20200343030020/climbing-stairs.java:7
↓ 1 callersFunctioncoinChange
(coins []int, amount int)
Week_05/G20200343030498/LeetCode_322_498.go:14
↓ 1 callersMethodcoinChange
(int[] coins, int amount)
Week_05/G20200343030536/LeetCode_322_536.java:10
↓ 1 callersMethodcombinationsHelp
(String digists, int start, StringBuilder result)
Week_03/G20200343030024/LeetCode_17_024.java:31
↓ 1 callersMethodcombine
(int n, int k)
Week_02/G20200343030584/LeetCode_77_584.java:35
↓ 1 callersMethodcombine
(int n, int k)
Week_02/G20200343030566/Leetcode_77_566.java:24
↓ 1 callersMethodcommon
(TreeNode curr, TreeNode p, TreeNode q)
Week_02/G20200343030386/LeetCode_236_386.java:17
↓ 1 callersMethodcompleteZeros
(int[] nums, int count)
Week_01/G20200343030578/LeetCode_283_578.java:27
↓ 1 callersMethodconstruct
(char[][] board)
Week_03/G20200343030390/backtracking/Leetcode_51_390.java:89
↓ 1 callersMethodconstructListNode
构建链表 @return
Week_01/G20200343030564/LeetCode_206_564.java:77
↓ 1 callersMethodcontainsZero
(int[] nums)
Week_00/G20200343030434/LeetCode_42_434.java:40
↓ 1 callersMethodcontainsZero
(int[] nums)
Week_01/G20200343030434/LeetCode_42_434.java:40
↓ 1 callersMethodconvert2board
(Stack<Integer> stack, int n)
Week_07/G20200343030368/LeetCode_51_368.java:47
↓ 1 callersMethodconvertBoard1
(Stack<Integer> stack, int n)
Week_07/G20200343030414/LeetCode_51_414.java:61
↓ 1 callersMethodconvertBoard2
(Stack<Integer> stack, int n)
Week_07/G20200343030414/LeetCode_51_414.java:122
↓ 1 callersMethodcost
($m, $n, $row, $col, $grid)
Week_05/G20200343030032/LeetCode_064_032.php:25
↓ 1 callersMethodcouldPlace
(int d, int row, int col)
Week_06/G20200343030590/LeetCode_37_590.java:16
↓ 1 callersMethodcount
()
Week_06/G20200343030592/LeetCode_547_592.java:38
↓ 1 callersMethodcount
()
Week_06/G20200343030414/LeetCode_547_414.java:87
↓ 1 callersMethodcount
统计目标值在nums中[iLeft,iRight]中出现的次数
Week_03/G20200343030462/leetcode-169-462.cpp:32
↓ 1 callersMethodcountMine
(char[][] board, int i, int j, int in, int jn)
Week_03/G20200343030580/LeetCode_529_580.java:37
↓ 1 callersMethodcountSet
()
Week_06/G20200343030398/LeetCode_547_398.go:40
↓ 1 callersMethodcountSubstrings
动态规划 时间复杂度:O(n ^ 3) 空间复杂度:O(n ^ 2) @param s @return
Week_05/G20200343030564/LeetCode_647_564.java:37
↓ 1 callersMethodcountZeros
(int[] nums)
Week_01/G20200343030578/LeetCode_283_578.java:45
↓ 1 callersMethodcreateLine
(int index, int n)
Week_06/G20200343030514/Leetcode_51_514.java:48
↓ 1 callersMethodcreateNewResult
(int value1, int value2, int value3)
Week_01/G20200343030536/LeetCode_15_536.java:34
↓ 1 callersMethoddecrease1
(int[] nums)
Week_00/G20200343030434/LeetCode_42_434.java:22
↓ 1 callersMethoddecrease1
(int[] nums)
Week_01/G20200343030434/LeetCode_42_434.java:22
↓ 1 callersFunctiondeep
(node, res)
Week_02/G20200343030430/LeetCode_590_430.js:36
↓ 1 callersMethoddeleteFront
Deletes an item from the front of Deque. Return true if the operation is successful.
Week_01/G20200343030590/LeetCode_641_590.java:32
↓ 1 callersMethoddeleteFront
Deletes an item from the front of Deque. Return true if the operation is successful.
Week_01/G20200343030584/LeetCode_641_584.java:72
↓ 1 callersMethoddeleteLast
Deletes an item from the rear of Deque. Return true if the operation is successful.
Week_01/G20200343030590/LeetCode_641_590.java:42
↓ 1 callersMethoddeleteLast
Deletes an item from the rear of Deque. Return true if the operation is successful.
Week_01/G20200343030584/LeetCode_641_584.java:87
↓ 1 callersFunctiondfs
(nums, size, depth, path, used, arr)
Week_02/G20200343030416/LeetCode_47_416.rb:25
↓ 1 callersFunctiondfs
(current, start)
Week_02/G20200343030380/Leetcode-77-380.js:10
↓ 1 callersFunctiondfs
(board, i, j, cur_word, cur_dict)
Week_06/G20200343030416/LeetCode_212_416.rb:34
↓ 1 callersFunctiondfs
(board [][]byte, i int, j int, trie *TrieNode, results *[]string)
Week_06/G20200343030008/LeetCode_212_008.go:63
↓ 1 callersFunctiondfs
(i)
Week_06/G20200343030430/LeetCode_547_430.js:10
↓ 1 callersFunctiondfs
(i, j)
Week_06/G20200343030430/LeetCode_130_430.js:10
↓ 1 callersFunctiondfs
(i, j, cur)
Week_06/G20200343030430/LeetCode_212_430.js:50
↓ 1 callersFunctiondfs
(result *[]string, current string, left int, right int)
Week_06/G20200343030026/LeetCode_22_026.go:13
↓ 1 callersFunctiondfs
(currentWord string, tr Trie , board *[][]byte, row, col int, result *map[string]bool)
Week_06/G20200343030498/LeetCode_212_498.go:53
↓ 1 callersFunctiondfs
(grid, row, col)
Week_06/G20200343030380/Leetcode-200-380.js:26
↓ 1 callersFunctiondfs
(board, node, word, row, col, result)
Week_06/G20200343030380/Leetcode-212-380.js:33
↓ 1 callersFunctiondfs
(result, n, cols = [], row = 0)
Week_07/G20200343030380/Leetcode-51-380.js:16
↓ 1 callersFunctiondfs
(grid, i, j, row, col)
Week_03/G20200343030430/LeetCode_200_430.js:11
↓ 1 callersFunctiondfs
(grid, row, col)
Week_03/G20200343030380/Leetcode-200-380.js:24
↓ 1 callersFunctiondfs
(beginWord, endWord, ans, path, map, minDistance, distance)
Week_03/G20200343030030/LeetCode_126_030.js:51
↓ 1 callersFunctiondfs
(triangle [][]int, row, col int)
Week_05/G20200343030498/LeetCode_120_498.go:20
↓ 1 callersMethoddfs
(int[] nums, int len, int depth, boolean[] used, Deque<Integer> stack, List<List<Integer>> res)
Week_02/G20200343030436/47.全排列-ii.java:22
↓ 1 callersMethoddfs
(int[] nums, int len, int depth, boolean[] used, Deque<Integer> stack, List<List<Integer>> res)
Week_02/G20200343030022/LeetCode_47_022.java:32
↓ 1 callersMethoddfs
(TreeNode node, List<Integer> res)
Week_02/G20200343030536/LeetCode_94_536.java:17
↓ 1 callersMethoddfs
(TreeNode node, int depth)
Week_02/G20200343030536/LeetCode_104_536.java:36
↓ 1 callersMethoddfs
(Node node, List<Integer> res)
Week_02/G20200343030536/LeetCode_589_536.java:17
↓ 1 callersMethoddfs
(TreeNode node, Integer min, Integer max)
Week_02/G20200343030536/LeetCode_98_536.java:12
↓ 1 callersMethoddfs
(Node node, List<Integer> res)
Week_02/G20200343030536/LeetCode_590_536.java:17
↓ 1 callersMethoddfs
(int[] nums, List<List<Integer>> res, List<Integer> tmp)
Week_02/G20200343030536/LeetCode_46_536.java:22
↓ 1 callersMethoddfs
(TreeNode node, List<Integer> res)
Week_02/G20200343030536/LeetCode_144_536.java:17
↓ 1 callersMethoddfs
(int[] nums, List<List<Integer>> res, List<Integer> tmp, boolean[] used)
Week_02/G20200343030536/LeetCode_47_536.java:23
↓ 1 callersMethoddfs
(int n, int k, int start, List<List<Integer>> res, List<Integer> tmp)
Week_02/G20200343030536/LeetCode_77_536.java:19
↓ 1 callersMethoddfs
(int level, int[] a, boolean[] used, Deque<Integer> path, List<List<Integer>> res)
Week_02/G20200343030364/LeetCode_46_364.java:22
↓ 1 callersMethoddfs
(int level, int[] a, boolean[] used, Deque<Integer> path, List<List<Integer>> res)
Week_02/G20200343030364/LeetCode_47_364.java:23
↓ 1 callersMethoddfs
(int[] nums, int numsLen, int depth, boolean[] used, Deque<Integer> stack, List<List<Inte
Week_02/G20200343030414/LeetCode_47_414.java:30
↓ 1 callersMethoddfs
(int[][] M, int[] visited, int i)
Week_06/G20200343030606/LeetCode_547_606.java:57
↓ 1 callersMethoddfs
(char[][] board, int i, int j, TrieNode p, List<String> res)
Week_06/G20200343030436/212.单词搜索-ii.java:20
↓ 1 callersMethoddfs
(List<List<String>> res, List<String> list, int row, int n)
Week_06/G20200343030436/51.n皇后.java:24
↓ 1 callersMethoddfs
(int[][] m, int[] visited, int i)
Week_06/G20200343030436/547.朋友圈.java:24
↓ 1 callersMethoddfs
(char[][] board,int i,int j)
Week_06/G20200343030436/130.被围绕的区域.java:38
↓ 1 callersMethoddfs
(int[][] M, int[] visited, int i)
Week_06/G20200343030022/LeetCode_547_022.java:7
↓ 1 callersMethoddfs
(char[][] board, int i, int j)
Week_06/G20200343030012/LeetCode_130_012.java:33
↓ 1 callersMethoddfs
(int i, int j)
Week_06/G20200343030012/LeetCode_200_012.java:36
↓ 1 callersMethoddfs
(char[][] board, int i, int j, String curWord, TrieNode curNode)
Week_06/G20200343030578/LeetCode_212_578.java:115
↓ 1 callersMethoddfs
DFS
Week_06/G20200343030592/LeetCode_547_592.java:58
↓ 1 callersMethoddfs
(char[][] board, int row, int col)
Week_06/G20200343030566/Leetcode_37_566.java:32
↓ 1 callersMethoddfs
(int[][] M, int[] visited, int i)
Week_06/G20200343030460/LeetCode_547_460.java:42
↓ 1 callersMethoddfs
(char[][] board, int i, int j)
Week_06/G20200343030512/LeeCode_130_512.java:30
↓ 1 callersMethoddfs
(char[][] grid, int r, int c)
Week_06/G20200343030512/LeeCode_200_512.java:14
↓ 1 callersMethoddfs
(char[][] board)
Week_06/G20200343030536/LeetCode_37_536.java:14
↓ 1 callersMethoddfs
(int[][] M, int[] visited, int i)
Week_06/G20200343030414/LeetCode_547_414.java:25
↓ 1 callersMethoddfs
(char[][] grid, int i, int j)
Week_06/G20200343030372/Number_of_islands_200.java:28
↓ 1 callersMethoddfs
(char[][] board, int row, int col)
Week_06/G20200343030434/LeetCode_37_434.java:21
↓ 1 callersMethoddfs
(char[][] grid, int i, int j)
Week_06/G20200343030564/LeetCode_200_564.java:79
↓ 1 callersMethoddfs
(char[][] board, int i, int j)
Week_06/G20200343030368/LeetCode_130_368.java:27
↓ 1 callersMethoddfs
(char[][] board, int i, int j, TrieNode p, List<String> res)
Week_06/G20200343030422/LeetCode_212_422.java:16
← previousnext →701–800 of 5,772, ranked by callers