Functions — github.com/algorithmzuo/trainingcamp004

hub / github.com/algorithmzuo/trainingcamp004 / functions

Functions251 in github.com/algorithmzuo/trainingcamp004

⨍ Functions 251◇ Types & classes 68

↓ 34 callersMethodadd

(Program program)

src/class07/Main.java:93

↓ 29 callersMethodisBST

(Node head)

src/class07/Code02_RecoverBST.java:215

↓ 29 callersMethodprintTree

(Node head)

src/class07/Code02_RecoverBST.java:185

↓ 14 callersMethodrecoverTree

(Node head)

src/class07/Code02_RecoverBST.java:65

↓ 11 callersMethodisEmpty

()

src/class07/Main.java:89

↓ 8 callersMethodgetValue

(String str)

src/class05/Code03_ExpressionCompute.java:7

↓ 8 callersMethodpop

()

src/class07/Main.java:109

↓ 6 callersMethodadd

(Program program)

src/class07/Code01_SDEandPM.java:74

↓ 4 callersMethodgetInternalSum

(int k)

src/class07/Code03_VisibleMountains.java:73

↓ 4 callersMethodmaxIncrease

(int[][] m, int[][] dp, int i, int j, int p)

src/class01/Code01_LongestIncreasingPath.java:106

↓ 4 callersMethodnextIndex

(int i, int size)

src/class07/Code03_VisibleMountains.java:78

↓ 4 callersMethodprintCircularList

(Node head)

src/class04/Code04_JosephusProblem.java:64

↓ 3 callersMethodgetSpace

(int num)

src/class07/Code02_RecoverBST.java:205

↓ 3 callersMethodgetSpace

(int num)

src/class06/Code03_BiggestBSTTopologyInTree.java:117

↓ 3 callersMethodgetUpMedian

(int[] A, int s1, int e1, int[] B, int s2, int e2)

src/class04/Code02_FindKthMinNumber.java:41

↓ 3 callersMethodisEmpty

()

src/class07/Code01_SDEandPM.java:69

↓ 3 callersMethodprintArray

(int[] arr)

src/class04/Code02_FindKthMinNumber.java:103

↓ 3 callersMethodreverse

(int[] arr, int L, int R)

src/class06/Code04_ShuffleProblem.java:85

↓ 3 callersMethodsdeLoveRule

(Program p1, Program p2)

src/class07/Code01_SDEandPM.java:150

↓ 3 callersMethodsdeLoveRule

(Program p1, Program p2)

src/class07/Main.java:166

↓ 3 callersMethodswap

(int index1, int index2)

src/class07/Code01_SDEandPM.java:141

↓ 3 callersMethodswap

(int index1, int index2)

src/class07/Main.java:157

↓ 2 callersMethodaddNum

(LinkedList<String> que, int num)

src/class05/Code03_ExpressionCompute.java:37

↓ 2 callersMethodallTrans

(int[] prices)

src/class02/Code03_BestTimetoBuyandSellStockFollow.java:50

↓ 2 callersMethoddial

(int i1, int i2, int size)

src/class08/Code02_FreedomTrail.java:8

↓ 2 callersMethodgenerateSortedArray

(int len, int maxValue)

src/class04/Code02_FindKthMinNumber.java:94

↓ 2 callersMethodgetVisibleNum

(int[] arr)

src/class07/Code03_VisibleMountains.java:20

↓ 2 callersMethodheapInsert

(int index)

src/class07/Code01_SDEandPM.java:108

↓ 2 callersMethodheapInsert

(int index)

src/class07/Main.java:124

↓ 2 callersMethodheapify

(int index)

src/class07/Code01_SDEandPM.java:120

↓ 2 callersMethodheapify

(int index)

src/class07/Main.java:136

↓ 2 callersMethodisValid

(char[] s, char[] e)

src/class08/Code01_RegularExpressionMatch.java:5

↓ 2 callersMethodisVisible

(int[] arr, int lowIndex, int highIndex)

src/class07/Code03_VisibleMountains.java:129

↓ 2 callersMethodlastIndex

(int i, int size)

src/class07/Code03_VisibleMountains.java:83

↓ 2 callersMethodmodifyIndex2

(int i, int len)

src/class06/Code04_ShuffleProblem.java:19

↓ 2 callersMethodmodifyMap

(Node n, int v, Map<Node, Record> m, boolean s)

src/class06/Code03_BiggestBSTTopologyInTree.java:76

↓ 2 callersMethodonceNum

(int[] arr, int k)

src/class03/Code04_KTimesOneTime.java:11

↓ 2 callersMethodprocess

(int[][] matrix, int i, int j)

src/class01/Code01_LongestIncreasingPath.java:16

↓ 2 callersMethodprocess4

(int[] arr, int index, int sum, int end, int m, TreeSet<Integer> sortSet)

src/class07/Code04_SubsquenceMaxModM.java:109

↓ 2 callersMethodrightWay

(int[] arr)

src/class07/Code03_VisibleMountains.java:88

↓ 2 callersMethodshuffle

(int[] arr)

src/class06/Code04_ShuffleProblem.java:25

↓ 2 callersMethodway1

(String str)

src/class05/Code04_PalindromeWays.java:5

↓ 2 callersMethodway2

(String str)

src/class05/Code04_PalindromeWays.java:31

↓ 1 callersMethodallCandsMinusOne

(HashMap<Integer, Integer> map)

src/class03/Code05_FindKMajority.java:69

↓ 1 callersMethodbstTopoSize1

(Node head)

src/class06/Code03_BiggestBSTTopologyInTree.java:18

↓ 1 callersMethodbstTopoSize2

(Node head)

src/class06/Code03_BiggestBSTTopologyInTree.java:55

↓ 1 callersMethodbucket

(long num, long len, long min, long max)

src/class03/Code01_MaxGap.java:45

↓ 1 callersMethodcheck

(String path, int target)

src/class01/Code05_ExpressionAddOperators.java:37

↓ 1 callersMethodcherryPickup1

(int[][] grid)

src/class02/Code06_CherryPickup.java:57

↓ 1 callersMethodcherryPickup2

(int[][] grid)

src/class02/Code06_CherryPickup.java:84

↓ 1 callersMethodcomeGoMaxPathSum

(int[][] matrix)

src/class02/Code06_CherryPickup.java:8

↓ 1 callersMethodcomparator

(int[] nums)

src/class03/Code01_MaxGap.java:50

↓ 1 callersMethodcopyArray

(int[] arr)

src/class03/Code01_MaxGap.java:72

↓ 1 callersMethodcycles

(int[] arr, int start, int len, int k)

src/class06/Code04_ShuffleProblem.java:60

↓ 1 callersMethoddfs

(List<String> res, char[] path, int len, long left, // 已经结算的部分 long cur, // 待定的部分(上一块的值) char[] nu

src/class01/Code05_ExpressionAddOperators.java:100

↓ 1 callersMethoddp

(int K, int[] prices)

src/class02/Code03_BestTimetoBuyandSellStockFollow.java:5

↓ 1 callersMethoddp1

(int N, int K)

src/class06/Code02_KInversePairs2.java:5

↓ 1 callersMethoddp2

(int N, int K)

src/class06/Code02_KInversePairs2.java:27

↓ 1 callersMethodf

(char[] str, int index, int left, int cur, int target)

src/class01/Code05_ExpressionAddOperators.java:48

↓ 1 callersMethodf

(String str, HashSet<String> map, int index)

src/class03/Code02_WorldBreak.java:49

↓ 1 callersMethodfillWord

(TrieNode head, String word)

src/class01/Code04_WordSearch.java:23

↓ 1 callersMethodfindKthNum

(int[] arr1, int[] arr2, int kth)

src/class04/Code02_FindKthMinNumber.java:7

↓ 1 callersMethodforceMake

(int[] arr, int[] times, int kth, int[] drink, int n, int a, int b)

src/class04/Code06_Coffee.java:70

↓ 1 callersMethodforceWash

(int[] drinks, int a, int b, int index, int washLine, int time)

src/class04/Code06_Coffee.java:90

↓ 1 callersMethodg

(char[] str, Node root, int i)

src/class03/Code02_WorldBreak.java:116

↓ 1 callersMethodgenerateArray

()

src/class06/Code04_ShuffleProblem.java:133

↓ 1 callersMethodgeneratePath

(LinkedList<Character> path)

src/class01/Code04_WordSearch.java:39

↓ 1 callersMethodgenerateRandomArray

(int maxSize, int maxValue)

src/class08/Code05_MinimumCostToMergeStones.java:95

↓ 1 callersMethodgenerateRandomArray

(int len, int value)

src/class07/Code04_SubsquenceMaxModM.java:118

↓ 1 callersMethodgenerateRandomArray

(int maxSize, int maxValue)

src/class03/Code01_MaxGap.java:63

↓ 1 callersMethodgenerateRandomArray

(int row, int col, int value)

src/class05/Code02_SnakeGame.java:95

↓ 1 callersMethodgenerateRandomSample

(char[] candidates, int num, int len, int joint)

src/class03/Code02_WorldBreak.java:186

↓ 1 callersMethodgetKSysNumFromNum

(int value, int k)

src/class03/Code04_KTimesOneTime.java:28

↓ 1 callersMethodgetLive

(int i, int m)

src/class04/Code04_JosephusProblem.java:56

↓ 1 callersMethodgetNum

(LinkedList<String> que)

src/class05/Code03_ExpressionCompute.java:51

↓ 1 callersMethodgetNumFromKSysNum

(int[] eO, int k)

src/class03/Code04_KTimesOneTime.java:38

↓ 1 callersMethodgetRandomArray

(int size, int max)

src/class07/Code03_VisibleMountains.java:158

↓ 1 callersMethodgetReals

(int[] arr, HashMap<Integer, Integer> cands)

src/class03/Code05_FindKMajority.java:84

↓ 1 callersMethodgetSortedAllArray

(int[] arr1, int[] arr2)

src/class04/Code02_FindKthMinNumber.java:78

↓ 1 callersMethodgetTwoErrNodes

(Node head)

src/class07/Code02_RecoverBST.java:17

↓ 1 callersMethodgetTwoErrParents

(Node head, Node e1, Node e2)

src/class07/Code02_RecoverBST.java:41

↓ 1 callersMethodgetVisibleNumFromIndex

(int[] arr, int index, HashSet<String> equalCounted)

src/class07/Code03_VisibleMountains.java:106

↓ 1 callersMethodinitDPMap

(char[] s, char[] e)

src/class08/Code01_RegularExpressionMatch.java:89

↓ 1 callersMethodisBSTNode

(Node h, Node n, int value)

src/class06/Code03_BiggestBSTTopologyInTree.java:35

↓ 1 callersMethodisMatch

(String str, String exp)

src/class08/Code01_RegularExpressionMatch.java:21

↓ 1 callersMethodisMatchDP

(String str, String exp)

src/class08/Code01_RegularExpressionMatch.java:56

↓ 1 callersMethodisValidWiggle

(int[] arr)

src/class06/Code04_ShuffleProblem.java:112

↓ 1 callersMethodjosephusKill1

(Node head, int m)

src/class04/Code04_JosephusProblem.java:14

↓ 1 callersMethodjosephusKill2

(Node head, int m)

src/class04/Code04_JosephusProblem.java:35

↓ 1 callersMethodkInversePairs2

(int n, int k)

src/class06/Code02_KInversePairs2.java:75

↓ 1 callersMethodlcse

(char[] str1, char[] str2)

src/class05/Code01_PalindromeSubsequence.java:22

↓ 1 callersMethodlongest

(Node head, int K)

src/class03/Code03_LongestSumEqualK.java:19

↓ 1 callersMethodmax1

(int[] arr, int m)

src/class07/Code04_SubsquenceMaxModM.java:13

↓ 1 callersMethodmax2

(int[] arr, int m)

src/class07/Code04_SubsquenceMaxModM.java:32

↓ 1 callersMethodmax3

(int[] arr, int m)

src/class07/Code04_SubsquenceMaxModM.java:61

↓ 1 callersMethodmax4

(int[] arr, int m)

src/class07/Code04_SubsquenceMaxModM.java:92

↓ 1 callersMethodmaxCoins1

(int[] arr)

src/class08/Code03_BurstBalloons.java:5

↓ 1 callersMethodmaxCoins2

(int[] arr)

src/class08/Code03_BurstBalloons.java:41

↓ 1 callersMethodmaxGap

(int[] nums)

src/class03/Code01_MaxGap.java:7

↓ 1 callersMethodmaxLen1

(String str)

src/class05/Code01_PalindromeSubsequence.java:5

next →1–100 of 251, ranked by callers