MCPcopy Create free account

hub / github.com/algorithmzuo/algorithmbasic2020 / functions

Functions1,411 in github.com/algorithmzuo/algorithmbasic2020

↓ 1 callersMethoddfs
(int[] op, int col, int level, int N)
src/class43/Code03_PavingTile.java:45
↓ 1 callersMethoddfs
(long way, int op, int index, int end, long[] cur)
src/class43/Code03_PavingTile1.java:69
↓ 1 callersMethoddfs
(int s, int t, int r)
src/class47/Code03_DinicAlgorithm.java:132
↓ 1 callersMethoddfs2
(int op, int col, int level, int N, int M)
src/class43/Code03_PavingTile.java:97
↓ 1 callersMethoddfs3
(int op, int col, int level, int N, int M, int[][] dp)
src/class43/Code03_PavingTile.java:145
↓ 1 callersMethoddfs4
(int way, int op, int index, int end, int[] cur)
src/class43/Code03_PavingTile.java:189
↓ 1 callersMethoddfsLeft
(int cur, int end, long sum)
src/class39/Code02_SnacksWaysMain2.java:107
↓ 1 callersMethoddfsRight
(int cur, int end, long sum)
src/class39/Code02_SnacksWaysMain2.java:120
↓ 1 callersMethoddistance
(HashMap<Node, Node> parentMap, Node o1, Node o2)
src/class12/Code06_MaxDistance.java:67
↓ 1 callersMethoddp
(int[] arr, int aim)
src/class21/Code02_CoinsWayEveryPaperDifferent.java:21
↓ 1 callersMethoddp
(int[] w, int[] v, int bag)
src/class19/Code01_Knapsack.java:35
↓ 1 callersMethoddp
(int a, int b, int k)
src/class20/Code02_HorseJump.java:31
↓ 1 callersMethoddp
(int[] arr)
src/class23/Code02_SplitSumClosedSizeHalf.java:39
↓ 1 callersMethoddp
(int[] arr)
src/class23/Code01_SplitSumClosed.java:32
↓ 1 callersMethoddp1
(int[] arr, int aim)
src/class21/Code03_CoinsWayNoLimit.java:24
↓ 1 callersMethoddp1
(int[] arr, int aim)
src/class21/Code04_CoinsWaySameValueSamePapper.java:59
↓ 1 callersMethoddp1
(String s)
src/class19/Code02_ConvertToLetterString.java:36
↓ 1 callersMethoddp1
(int[] arr, int aim)
src/class22/Code02_MinCoinsNoLimit.java:27
↓ 1 callersMethoddp1
(int N, int M, int K)
src/class22/Code01_KillMonster.java:32
↓ 1 callersMethoddp1
(int n)
src/class22/Code03_SplitNumber.java:33
↓ 1 callersMethoddp1
(int[] arr, int aim)
src/class24/Code04_MinCoinsOnePaper.java:30
↓ 1 callersMethoddp2
(int[] arr, int aim)
src/class21/Code03_CoinsWayNoLimit.java:43
↓ 1 callersMethoddp2
(int[] arr, int aim)
src/class21/Code04_CoinsWaySameValueSamePapper.java:81
↓ 1 callersMethoddp2
(String s)
src/class19/Code02_ConvertToLetterString.java:58
↓ 1 callersMethoddp2
(int[] arr, int aim)
src/class22/Code02_MinCoinsNoLimit.java:52
↓ 1 callersMethoddp2
(int N, int M, int K)
src/class22/Code01_KillMonster.java:57
↓ 1 callersMethoddp2
(int n)
src/class22/Code03_SplitNumber.java:57
↓ 1 callersMethoddp2
(int[] arr)
src/class23/Code02_SplitSumClosedSizeHalf.java:162
↓ 1 callersMethoddpProcess
(char[] str, int L, int R, boolean has, int[][][] dp)
src/class46/Code03_DeleteAdjacentSameCharacter.java:112
↓ 1 callersMethoden
(List<Node> children)
src/class11/Code03_EncodeNaryTreeToBinaryTree.java:50
↓ 1 callersMethodequal
(Node h1, Node h2)
src/class05/Code04_DoubleLinkedListQuickSort.java:258
↓ 1 callersMethodexist
(int[] sortedArr, int num)
src/class01/Code04_BSExist.java:7
↓ 1 callersMethodf
(DirectedGraphNode cur, HashMap<DirectedGraphNode, Record> order)
src/class16/Code03_TopologicalOrderDFS2.java:62
↓ 1 callersMethodf
(DirectedGraphNode cur, HashMap<DirectedGraphNode, Record> order)
src/class16/Code03_TopologicalOrderDFS1.java:57
↓ 1 callersMethodf
(ArrayList<Character> rest, String path, List<String> ans)
src/class17/Code04_PrintAllPermutations.java:23
↓ 1 callersMethodf
(Stack<Integer> stack)
src/class17/Code05_ReverseStackUsingRecursive.java:19
↓ 1 callersMethodf
(char[] str, int L, int R)
src/class20/Code01_PalindromeSubsequence.java:15
↓ 1 callersMethodf
(int i, int j, int step, int a, int b)
src/class20/Code02_HorseJump.java:63
↓ 1 callersMethodf1
(int n)
src/class26/Code02_FibonacciProblem.java:5
↓ 1 callersMethodf2
(int n)
src/class26/Code02_FibonacciProblem.java:15
↓ 1 callersMethodf2
(int[][] matrix, int cityStatus, int start)
src/class43/Code02_TSP.java:59
↓ 1 callersMethodf3
(int n)
src/class26/Code02_FibonacciProblem.java:34
↓ 1 callersMethodf3
(int[][] matrix, int cityStatus, int start, int[][] dp)
src/class43/Code02_TSP.java:97
↓ 1 callersMethodfillForm
(Node head, String pre, HashMap<Node, Character> nodes, HashMap<Character, String> ans)
src/class46/Code05_HuffmanTree.java:88
↓ 1 callersMethodfillParentMap
(Node head, HashMap<Node, Node> parentMap)
src/class13/Code03_lowestAncestor.java:41
↓ 1 callersMethodfillParentMap
(Node head, HashMap<Node, Node> parentMap)
src/class12/Code06_MaxDistance.java:56
↓ 1 callersMethodfillPrelist
(Node head, ArrayList<Node> arr)
src/class13/Code03_lowestAncestor.java:117
↓ 1 callersMethodfillPrelist
(Node head, ArrayList<Node> arr)
src/class12/Code06_MaxDistance.java:40
↓ 1 callersMethodfindLastNoBigIndex
(K key)
src/class36/Code01_SizeBalancedTreeMap.java:107
↓ 1 callersMethodfindLastNoBigIndex
(K key)
src/class35/Code01_AVLTreeMap.java:109
↓ 1 callersMethodfindLastNoSmallIndex
(K key)
src/class36/Code01_SizeBalancedTreeMap.java:90
↓ 1 callersMethodfindLastNoSmallIndex
(K key)
src/class35/Code01_AVLTreeMap.java:92
↓ 1 callersMethodforceMake
(int[] arr, int[] times, int kth, int[] drink, int n, int a, int b)
src/class20/Code03_Coffee.java:27
↓ 1 callersMethodforceWash
(int[] drinks, int a, int b, int index, int washLine, int time)
src/class20/Code03_Coffee.java:46
↓ 1 callersMethodfunc
(int N, String from, String to, String other)
src/class17/Code02_Hanoi.java:80
↓ 1 callersMethodfunc
(int[] arr, int L, int R)
src/class46/Code01_BurstBalloons.java:21
↓ 1 callersMethodfunc1
(int[] d, int[] p)
src/class38/Code04_MoneyProblem.java:27
↓ 1 callersMethodfunc1
(int[][] matrix, List<Integer> set, int start)
src/class43/Code02_TSP.java:24
↓ 1 callersMethodfunc2
(int[] d, int[] p)
src/class38/Code04_MoneyProblem.java:68
↓ 1 callersMethodfunc3
(int[] d, int[] p)
src/class38/Code04_MoneyProblem.java:91
↓ 1 callersMethodfunctionTest
()
src/class37/Compare.java:12
↓ 1 callersMethodg1
(char[] str, int index, List<String> ans)
src/class17/Code04_PrintAllPermutations.java:47
↓ 1 callersMethodg2
(char[] str, int index, List<String> ans)
src/class17/Code04_PrintAllPermutations.java:69
↓ 1 callersMethodgcd
(long m, long n)
src/class39/Code04_DifferentBTNum.java:50
↓ 1 callersMethodgenarateBoss
(int maxLevel, int maxNexts, int maxHappy)
src/class13/Code04_MaxHappy.java:80
↓ 1 callersMethodgenarateNexts
(Employee e, int level, int maxLevel, int maxNexts, int maxHappy)
src/class13/Code04_MaxHappy.java:90
↓ 1 callersMethodgenarateRandomArray
(int len, int max)
src/class31/Code01_SegmentTree.java:169
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class13/Code01_IsCBT.java:97
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class13/Code03_lowestAncestor.java:95
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class13/Code02_MaxSubBSTHead.java:113
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class12/Code06_MaxDistance.java:157
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class12/Code05_MaxSubBSTSize.java:131
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class12/Code01_IsCBT.java:126
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class12/Code03_IsBalanced.java:79
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class12/Code02_IsBST.java:102
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class12/Code04_IsFull.java:85
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class11/Code05_TreeMaxWidth.java:90
↓ 1 callersMethodgenerate
(int level, int maxLevel, int maxValue)
src/class11/Code02_SerializeAndReconstructTree.java:187
↓ 1 callersMethodgenerateArray
(int len, int varible)
src/class37/Code01_CountofRangeSum.java:195
↓ 1 callersMethodgenerateGraph
(int maxSize, int maxValue)
src/class43/Code02_TSP.java:244
↓ 1 callersMethodgenerateLines
(int N, int L, int R)
src/class07/Code01_CoverMax.java:91
↓ 1 callersMethodgeneratePositiveArray
(int size, int value)
src/class40/Code01_LongestSumSubArrayLengthInPositiveArray.java:53
↓ 1 callersMethodgeneratePrograms
(int programSize, int timeMax)
src/class14/Code03_BestArrange.java:84
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class29/Code02_MaxTopK.java:142
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class29/Code01_FindMinKth.java:149
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class14/Code02_LessMoneySplitGold.java:58
↓ 1 callersMethodgenerateRandomArray
(int len, int value)
src/class39/Code01_SubsquenceMaxModM.java:113
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class24/Code01_SlidingWindowMaxArray.java:55
↓ 1 callersMethodgenerateRandomArray
(int maxLen, int maxValue)
src/class24/Code02_AllLessNumSubArray.java:67
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class01/Code05_BSNearRight.java:35
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class01/Code06_BSAwesome.java:48
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class01/Code04_BSExist.java:40
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class01/Code05_BSNearLeft.java:35
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class04/Code02_SmallSum.java:68
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class04/Code03_ReversePair.java:61
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class04/Code01_MergeSort.java:76
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class04/Code04_BiggerThanRightTwice.java:66
↓ 1 callersMethodgenerateRandomArray
(int len, int maxValue)
src/class40/Code03_LongestLessSumSubArrayLength.java:83
↓ 1 callersMethodgenerateRandomArray
(int size, int value)
src/class40/Code02_LongestSumSubArrayLength.java:52
↓ 1 callersMethodgenerateRandomArray
(int maxSize, int maxValue)
src/class05/Code03_QuickSortRecursiveAndUnrecursive.java:122
← previousnext →401–500 of 1,411, ranked by callers