Functions — github.com/algorithmzuo/algorithmbasic2020

hub / github.com/algorithmzuo/algorithmbasic2020 / functions

Functions1,411 in github.com/algorithmzuo/algorithmbasic2020

⨍ Functions 1,411◇ Types & classes 355

↓ 2 callersMethodproduct

(int[][] a, int[][] b)

src/class26/Code03_ZeroLeftOneStringNumber.java:89

↓ 2 callersMethodproduct

(int[][] a, int[][] b)

src/class26/Code02_FibonacciProblem.java:68

↓ 2 callersMethodpush

(T value)

src/class03/Code03_DoubleEndsQueueToStackAndQueue.java:113

↓ 2 callersMethodpush

(int value)

src/class03/Code04_RingArray.java:20

↓ 2 callersMethodpush

(int value)

src/class06/Code02_Heap.java:27

↓ 2 callersMethodpush

(int value)

src/class06/Code02_Heap.java:101

↓ 2 callersMethodpushDown

(int rt, int ln, int rn)

src/class31/Code02_FallingSquares.java:28

↓ 2 callersMethodquery

(int L, int R, int l, int r, int rt)

src/class31/Code01_SegmentTree.java:119

↓ 2 callersMethodradixSort

(int[] arr)

src/class08/Code04_RadixSort.java:8

↓ 2 callersMethodrand

(int max)

src/class29/Code03_ReservoirSampling.java:16

↓ 2 callersMethodrandomNumber

(int range)

src/class02/Code03_KM.java:126

↓ 2 callersMethodremove

(K key)

src/class36/Code01_SizeBalancedTreeMap.java:217

↓ 2 callersMethodreverseEdge

(Node from)

src/class30/Code01_MorrisTraversal.java:141

↓ 2 callersMethodrightToLeft

(int n)

src/class17/Code02_Hanoi.java:64

↓ 2 callersMethodrightToMid

(int n)

src/class17/Code02_Hanoi.java:34

↓ 2 callersMethodrightWay

(int[] arr)

src/class25/Code01_MonotonousStack.java:95

↓ 2 callersMethodselectionSort

(int[] arr)

src/class01/Code01_SelectionSort.java:7

↓ 2 callersMethodshellSort

(int[] arr)

src/class08/Code05_ShellSort.java:10

↓ 2 callersMethodsize

()

src/class36/Code02_SkipListMap.java:194

↓ 2 callersMethodswap

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

src/class08/Code05_ShellSort.java:30

↓ 2 callersMethodswap

(Node[] nodeArr, int a, int b)

src/class09/Code03_SmallerEqualBigger.java:54

↓ 2 callersMethodt4

(int[][] matrix)

src/class43/Code02_TSP.java:120

↓ 2 callersMethodtest

(int[] arr, int value)

src/class01/Code05_BSNearRight.java:25

↓ 2 callersMethodtest

(int[] arr, int value)

src/class01/Code05_BSNearLeft.java:25

↓ 2 callersMethodupdate

(int L, int R, int C, int l, int r, int rt)

src/class31/Code01_SegmentTree.java:75

↓ 2 callersMethodways3

(int N, int M)

src/class43/Code03_PavingTile.java:111

↓ 2 callersMethodways3

(int[] arr)

src/class47/Code02_RestoreWays.java:152

↓ 2 callersMethodways4

(int N, int M)

src/class43/Code03_PavingTile.java:158

↓ 1 callersMethodProcess1

(int rest, int k)

src/class42/Code02_ThrowChessPiecesProblem.java:21

↓ 1 callersMethodadd

(int index, int d)

src/class32/Code01_IndexTree.java:30

↓ 1 callersMethodadd

(AVLNode<K, V> cur, K key, V value)

src/class35/Code01_AVLTreeMap.java:126

↓ 1 callersMethodallIndexes

()

src/class37/Code04_QueueReconstructionByHeight.java:189

↓ 1 callersMethodarrPartition

(Node[] nodeArr, int pivot)

src/class09/Code03_SmallerEqualBigger.java:39

↓ 1 callersMethodbestArrange1

(Program[] programs)

src/class14/Code03_BestArrange.java:19

↓ 1 callersMethodbestArrange2

(Program[] programs)

src/class14/Code03_BestArrange.java:60

↓ 1 callersMethodbestSplit

(String s1, String s2, int first)

src/class45/Code01_InsertS2MakeMostAlphabeticalOrder.java:70

↓ 1 callersMethodbestSplit1

(int[] arr)

src/class41/Code01_BestSplitForAll.java:5

↓ 1 callersMethodbestSplit1

(int[] arr)

src/class41/Code02_BestSplitForEveryPosition.java:5

↓ 1 callersMethodbestSplit2

(int[] arr)

src/class41/Code01_BestSplitForAll.java:25

↓ 1 callersMethodbestSplit2

(int[] arr)

src/class41/Code02_BestSplitForEveryPosition.java:33

↓ 1 callersMethodbestSplit3

(int[] arr)

src/class41/Code02_BestSplitForEveryPosition.java:54

↓ 1 callersMethodbestTime

(int[] drinks, int wash, int air, int index, int free)

src/class20/Code03_Coffee.java:101

↓ 1 callersMethodbestTimeDp

(int[] drinks, int wash, int air)

src/class20/Code03_Coffee.java:133

↓ 1 callersMethodbfs

(int s, int t)

src/class47/Code03_DinicAlgorithm.java:105

↓ 1 callersMethodbothLoop

(Node head1, Node loop1, Node head2, Node loop2)

src/class10/Code01_FindFirstIntersectNode.java:88

↓ 1 callersMethodbuild

()

src/class32/Code03_AC1.java:43

↓ 1 callersMethodbuild

()

src/class32/Code04_AC2.java:50

↓ 1 callersMethodbuild

(int n)

src/class16/Code04_KruskalNowCoder.java:61

↓ 1 callersMethodbuildByLevelQueue

(Queue<String> levelList)

src/class11/Code02_SerializeAndReconstructTree.java:150

↓ 1 callersMethodbuildByPosQueue

(Queue<String> poslist)

src/class11/Code02_SerializeAndReconstructTree.java:100

↓ 1 callersMethodbuildByPreQueue

(Queue<String> prelist)

src/class11/Code02_SerializeAndReconstructTree.java:82

↓ 1 callersMethodc1

(int n)

src/class26/Code02_FibonacciProblem.java:123

↓ 1 callersMethodc2

(int n)

src/class26/Code02_FibonacciProblem.java:133

↓ 1 callersMethodc3

(int n)

src/class26/Code02_FibonacciProblem.java:155

↓ 1 callersMethodcanDelete

(String s)

src/class46/Code03_DeleteAdjacentSameCharacter.java:40

↓ 1 callersMethodchoices

()

src/class29/Code03_ReservoirSampling.java:31

↓ 1 callersMethodcloneDoubleLinkedList

(Node head)

src/class05/Code04_DoubleLinkedListQuickSort.java:240

↓ 1 callersMethodcoinWays

(int[] arr, int aim)

src/class21/Code02_CoinsWayEveryPaperDifferent.java:5

↓ 1 callersMethodcoinsWay

(int[] arr, int aim)

src/class21/Code03_CoinsWayNoLimit.java:5

↓ 1 callersMethodcoinsWay

(int[] arr, int aim)

src/class21/Code04_CoinsWaySameValueSamePapper.java:38

↓ 1 callersMethodcomparator

(int[] arr)

src/class08/Code03_CountSort.java:29

↓ 1 callersMethodcomparator

(int[] arr)

src/class08/Code04_RadixSort.java:66

↓ 1 callersMethodcomparator

(int[] arr)

src/class01/Code03_InsertionSort.java:27

↓ 1 callersMethodcomparator

(int[] arr)

src/class01/Code02_BubbleSort.java:31

↓ 1 callersMethodcomparator

(int[] arr)

src/class01/Code01_SelectionSort.java:30

↓ 1 callersMethodcomparator

(int[] arr)

src/class04/Code02_SmallSum.java:54

↓ 1 callersMethodcomparator

(int[] arr)

src/class04/Code03_ReversePair.java:48

↓ 1 callersMethodcomparator

(int[] arr)

src/class04/Code04_BiggerThanRightTwice.java:53

↓ 1 callersMethodcomparator

(int[] arr)

src/class06/Code03_HeapSort.java:65

↓ 1 callersMethodcomparator

(int[] arr, int k)

src/class06/Code04_SortArrayDistanceLessK.java:30

↓ 1 callersMethodcompare

(int[] arr, boolean[] op, int k)

src/class07/Code02_EveryStepShowBoss.java:136

↓ 1 callersMethodconnect

(int r, int c)

src/class15/Code03_NumberOfIslandsII.java:78

↓ 1 callersMethodconnect

(int r, int c)

src/class15/Code03_NumberOfIslandsII.java:145

↓ 1 callersMethodcontainNum

(String content)

src/class32/Code03_AC1.java:67

↓ 1 callersMethodcontainWords

(String content)

src/class32/Code04_AC2.java:77

↓ 1 callersMethodcontainsKey

(K key)

src/class36/Code01_SizeBalancedTreeMap.java:196

↓ 1 callersMethodcopyAndMergeTwo

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

src/class14/Code02_LessMoneySplitGold.java:30

↓ 1 callersMethodcopyArray

(int[] arr)

src/class08/Code03_CountSort.java:43

↓ 1 callersMethodcopyArray

(int[] arr)

src/class08/Code04_RadixSort.java:80

↓ 1 callersMethodcopyArray

(int[] arr)

src/class01/Code02_BubbleSort.java:45

↓ 1 callersMethodcopyArray

(int[] arr)

src/class01/Code01_SelectionSort.java:48

↓ 1 callersMethodcopyArray

(int[] arr)

src/class04/Code02_SmallSum.java:77

↓ 1 callersMethodcopyArray

(int[] arr)

src/class04/Code03_ReversePair.java:70

↓ 1 callersMethodcopyArray

(int[] arr)

src/class04/Code01_MergeSort.java:85

↓ 1 callersMethodcopyArray

(int[] arr)

src/class04/Code04_BiggerThanRightTwice.java:75

↓ 1 callersMethodcopyArray

(int[] arr)

src/class06/Code03_HeapSort.java:79

↓ 1 callersMethodcopyButExcept

(Program[] programs, int i)

src/class14/Code03_BestArrange.java:48

↓ 1 callersMethodcopyStringArray

(String[] arr)

src/class13/Code05_LowestLexicography.java:89

↓ 1 callersMethodcountFromBottom

(int[] height)

src/class25/Code05_CountSubmatricesWithAllOnes.java:47

↓ 1 callersMethodcountRangeSum1

(int[] nums, int lower, int upper)

src/class37/Code01_CountofRangeSum.java:7

↓ 1 callersMethodcountRangeSum2

(int[] nums, int lower, int upper)

src/class37/Code01_CountofRangeSum.java:166

↓ 1 callersMethodcountWhileMergeSort

(long[] sums, int start, int end, int lower, int upper)

src/class37/Code01_CountofRangeSum.java:15

↓ 1 callersMethodcountWordsEqualTo

(String word)

src/class08/Code02_Trie.java:69

↓ 1 callersMethodcountWordsEqualTo

(String word)

src/class08/Code01_Trie.java:67

↓ 1 callersMethodcreateTrie

(HashMap<Character, String> huffmanForm)

src/class46/Code05_HuffmanTree.java:124

↓ 1 callersMethoddaddyMove

(int time)

src/class07/Code02_EveryStepShowBoss.java:103

↓ 1 callersMethodde

(TreeNode root)

src/class11/Code03_EncodeNaryTreeToBinaryTree.java:74

↓ 1 callersMethoddelete

(SBTNode<K> cur, K key)

src/class37/Code02_SlidingWindowMedian.java:102

↓ 1 callersMethoddelete

(SBTNode<K, V> cur, K key)

src/class36/Code01_SizeBalancedTreeMap.java:143

↓ 1 callersMethoddelete

(AVLNode<K, V> cur, K key)

src/class35/Code01_AVLTreeMap.java:142

← previous next →301–400 of 1,411, ranked by callers