Functions — github.com/algorithmzuo/algorithmbasic2020

hub / github.com/algorithmzuo/algorithmbasic2020 / functions

Functions1,411 in github.com/algorithmzuo/algorithmbasic2020

⨍ Functions 1,411◇ Types & classes 355

↓ 312 callersMethodrandom

(int i)

src/class29/Code03_ReservoirSampling.java:42

↓ 186 callersMethodget

(K key)

src/class35/Code01_AVLTreeMap.java:206

↓ 143 callersMethodput

(K key, V value)

src/class35/Code01_AVLTreeMap.java:183

↓ 109 callersMethodadd

(int cur, int delay)

src/class16/Code06_NetworkDelayTime.java:86

↓ 60 callersMethodadd

(int pushInt)

src/class03/Code06_TwoStacksImplementQueue.java:25

↓ 60 callersMethodsize

()

src/class07/HeapGreater.java:26

↓ 53 callersMethodpush

(T obj)

src/class07/HeapGreater.java:38

↓ 42 callersMethodisEmpty

()

src/class07/HeapGreater.java:22

↓ 41 callersMethodcontainsKey

(K key)

src/class35/Code01_AVLTreeMap.java:175

↓ 37 callersMethodcompareTo

(Node o)

src/class37/Code02_SlidingWindowMedian.java:199

↓ 34 callersMethodsort

(Node head)

src/class05/Code04_DoubleLinkedListQuickSort.java:197

↓ 32 callersMethodpoll

()

src/class16/Code06_NetworkDelayTime.java:104

↓ 29 callersMethodpeek

()

src/class07/HeapGreater.java:34

↓ 26 callersMethodisEmpty

()

src/class16/Code06_Dijkstra.java:72

↓ 22 callersMethodadd

(int index, int d)

src/class32/Code01_IndexTree.java:55

↓ 21 callersMethodcontains

(T obj)

src/class07/HeapGreater.java:30

↓ 21 callersMethodremove

(T obj)

src/class07/HeapGreater.java:53

↓ 18 callersMethodget

(K key)

src/class36/Code02_SkipListMap.java:124

↓ 18 callersMethodpop

()

src/class07/HeapGreater.java:44

↓ 18 callersMethodprintLinkedList

(Node node)

src/class09/Code02_IsPalindromeList.java:103

↓ 16 callersMethodgetValue

(int[][][] dp, int i, int j, int step)

src/class20/Code02_HorseJump.java:93

↓ 15 callersMethodremove

(K key)

src/class37/Code02_SlidingWindowMedian.java:172

↓ 14 callersMethodset

(char[][] m, int leftUp, int rightDown)

src/class40/Code08_PrintStar.java:27

↓ 14 callersMethodsize

()

src/class37/Code03_AddRemoveGetIndexGreat.java:159

↓ 12 callersMethodadd

(int num)

src/class29/Code03_ReservoirSampling.java:20

↓ 11 callersMethodpoll

()

src/class03/Code07_TwoQueueImplementStack.java:22

↓ 11 callersMethodpop

()

src/class16/Code06_Dijkstra.java:91

↓ 11 callersMethodput

(K key, V value)

src/class36/Code01_SizeBalancedTreeMap.java:205

↓ 10 callersMethodceilingKey

(K key)

src/class35/Code01_AVLTreeMap.java:247

↓ 10 callersMethodfloorKey

(K key)

src/class35/Code01_AVLTreeMap.java:239

↓ 10 callersMethodgetSuccessorNode

(Node node)

src/class11/Code06_SuccessorNode.java:16

↓ 9 callersMethodfirstKey

()

src/class35/Code01_AVLTreeMap.java:217

↓ 9 callersMethodisPalindrome1

(Node head)

src/class09/Code02_IsPalindromeList.java:17

↓ 9 callersMethodisPalindrome2

(Node head)

src/class09/Code02_IsPalindromeList.java:34

↓ 9 callersMethodisPalindrome3

(Node head)

src/class09/Code02_IsPalindromeList.java:59

↓ 9 callersMethodlastKey

()

src/class35/Code01_AVLTreeMap.java:228

↓ 8 callersMethodceilingKey

(K key)

src/class36/Code01_SizeBalancedTreeMap.java:282

↓ 8 callersMethodcontainsKey

(K key)

src/class37/Code02_SlidingWindowMedian.java:154

↓ 8 callersMethodfloorKey

(K key)

src/class36/Code01_SizeBalancedTreeMap.java:274

↓ 8 callersMethodpick

(int[][][] dp, int x, int y, int rest)

src/class20/Code02_HorseJump.java:52

↓ 8 callersMethodput

(K key, V value)

src/class36/Code02_SkipListMap.java:86

↓ 8 callersMethodsize

()

src/class37/Code02_SlidingWindowMedian.java:150

↓ 8 callersMethodsum

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

src/class41/Code02_BestSplitForEveryPosition.java:29

↓ 8 callersMethodswap

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

src/class05/Code03_QuickSortRecursiveAndUnrecursive.java:33

↓ 7 callersMethodswap

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

src/class29/Code02_MaxTopK.java:72

↓ 6 callersMethodceilingKey

(K key)

src/class36/Code02_SkipListMap.java:176

↓ 6 callersMethodfloorKey

(K key)

src/class36/Code02_SkipListMap.java:185

↓ 6 callersMethodget

(SBTNode<V> root, int index)

src/class37/Code03_AddRemoveGetIndexGreat.java:126

↓ 6 callersMethodgetmin

()

src/class03/Code05_GetMinStack.java:34

↓ 6 callersMethodisEmpty

()

src/class17/Code01_Dijkstra.java:73

↓ 6 callersMethodisEmpty

()

src/class03/Code04_RingArray.java:39

↓ 6 callersMethodpush

(int newNum)

src/class03/Code05_GetMinStack.java:16

↓ 6 callersMethodswap

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

src/class05/Code02_PartitionAndQuickSort.java:5

↓ 5 callersMethodadd

(SBTNode cur, long key, boolean contains)

src/class37/Code01_CountofRangeSum.java:115

↓ 5 callersMethodcontainsKey

(K key)

src/class36/Code02_SkipListMap.java:76

↓ 5 callersMethodfirstKey

()

src/class36/Code01_SizeBalancedTreeMap.java:252

↓ 5 callersMethodfirstKey

()

src/class36/Code02_SkipListMap.java:158

↓ 5 callersMethodgetmin

()

src/class03/Code05_GetMinStack.java:68

↓ 5 callersMethodhashCode

(String input)

src/class33/Hash.java:22

↓ 5 callersMethodisEmpty

()

src/class06/Code02_Heap.java:19

↓ 5 callersMethodisKeyEqual

(K otherKey)

src/class36/Code02_SkipListMap.java:28

↓ 5 callersMethodlastKey

()

src/class36/Code01_SizeBalancedTreeMap.java:263

↓ 5 callersMethodlastKey

()

src/class36/Code02_SkipListMap.java:162

↓ 5 callersMethodmostRightLessNodeInTree

(K key)

src/class36/Code02_SkipListMap.java:50

↓ 5 callersMethodnetherlandsFlag

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

src/class05/Code03_QuickSortRecursiveAndUnrecursive.java:10

↓ 5 callersMethodpeek

()

src/class03/Code07_TwoQueueImplementStack.java:33

↓ 5 callersMethodprintAll

(SkipListMap<String, String> obj)

src/class36/Code02_SkipListMap.java:201

↓ 5 callersMethodresign

(T obj)

src/class07/HeapGreater.java:65

↓ 4 callersMethodadd

(SBTNode<V> root, int index, SBTNode<V> cur)

src/class37/Code03_AddRemoveGetIndexGreat.java:74

↓ 4 callersMethodadd

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

src/class36/Code01_SizeBalancedTreeMap.java:127

↓ 4 callersMethodadd

(int L, int R, int C)

src/class31/Code01_SegmentTree.java:153

↓ 4 callersMethodfind

(int i)

src/class14/Code06_UnionFind.java:38

↓ 4 callersMethodfindFather

(V cur)

src/class14/Code05_UnionFind.java:34

↓ 4 callersMethodfindFather

(Node n)

src/class16/Code04_Kruskal.java:35

↓ 4 callersMethodget

(SBTNode root, int index)

src/class37/Code04_QueueReconstructionByHeight.java:153

↓ 4 callersMethodget

(K key)

src/class36/Code01_SizeBalancedTreeMap.java:240

↓ 4 callersMethodgetdp

(int[] arr)

src/class45/Code02_CreateMaximumNumber.java:223

↓ 4 callersMethodisEmpty

()

src/class03/Code07_TwoQueueImplementStack.java:45

↓ 4 callersMethodmaxPick

(int[] arr, int[][] dp, int pick)

src/class45/Code02_CreateMaximumNumber.java:241

↓ 4 callersMethodpick

(long[][][] dp, int N, int M, int r, int c, int rest)

src/class21/Code05_BobDie.java:46

↓ 4 callersMethodpop

()

src/class17/Code01_Dijkstra.java:93

↓ 4 callersMethodprintArray

(int[] arr)

src/class08/Code03_CountSort.java:74

↓ 4 callersMethodprintArray

(int[] arr)

src/class08/Code04_RadixSort.java:111

↓ 4 callersMethodprintArray

(int[] arr)

src/class01/Code01_SelectionSort.java:79

↓ 4 callersMethodpush

(T value)

src/class03/Code03_DoubleEndsQueueToStackAndQueue.java:92

↓ 4 callersMethodpush

(T value)

src/class03/Code07_TwoQueueImplementStack.java:18

↓ 4 callersMethodradixPass

(int[] nums, int[] input, int[] output, int offset, int n, int k)

src/class45/Code01_InsertS2MakeMostAlphabeticalOrder.java:180

↓ 4 callersMethodradixPass

(int[] nums, int[] input, int[] output, int offset, int n, int k)

src/class45/Code04_LongestRepeatingSubstring.java:124

↓ 4 callersMethodradixPass

(int[] nums, int[] input, int[] output, int offset, int n, int k)

src/class45/Code02_CreateMaximumNumber.java:189

↓ 4 callersMethodradixPass

(int[] nums, int[] input, int[] output, int offset, int n, int k)

src/class45/Code03_LongestCommonSubstringConquerByHeight.java:181

↓ 4 callersMethodradixPass

(int[] nums, int[] input, int[] output, int offset, int n, int k)

src/class44/Code01_LastSubstringInLexicographicalOrder.java:111

↓ 4 callersMethodradixPass

(int[] nums, int[] input, int[] output, int offset, int n, int k)

src/class44/DC3.java:99

↓ 4 callersMethodrandomNumberString

(int len, int range)

src/class45/Code01_InsertS2MakeMostAlphabeticalOrder.java:215

↓ 4 callersMethodrandomNumberString

(int len, int range)

src/class45/Code03_LongestCommonSubstringConquerByHeight.java:236

↓ 4 callersMethodremove

(SBTNode<V> root, int index)

src/class37/Code03_AddRemoveGetIndexGreat.java:89

↓ 4 callersMethodsum

(int row, int col)

src/class32/Code02_IndexTree2D.java:27

↓ 4 callersMethodsum

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

src/class41/Code04_SplitArrayLargestSum.java:8

↓ 4 callersMethodswap

(char[] chs, int i, int j)

src/class17/Code04_PrintAllPermutations.java:85

↓ 4 callersMethodswap

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

src/class06/Code03_HeapSort.java:58

↓ 4 callersMethodunion

(V a, V b)

src/class15/Code02_NumberOfIslands.java:121

next →1–100 of 1,411, ranked by callers