Functions — github.com/algorithmzuo/algorithmbasic2020

hub / github.com/algorithmzuo/algorithmbasic2020 / functions

Functions1,411 in github.com/algorithmzuo/algorithmbasic2020

⨍ Functions 1,411◇ Types & classes 355

↓ 4 callersMethodunion

(int r1, int c1, int r2, int c2)

src/class15/Code02_NumberOfIslands.java:215

↓ 4 callersMethodunion

(int r1, int c1, int r2, int c2)

src/class15/Code03_NumberOfIslandsII.java:55

↓ 4 callersMethodunion

(String s1, String s2)

src/class15/Code03_NumberOfIslandsII.java:129

↓ 4 callersMethodw

(int[] s, int l, int r)

src/class41/Code03_StoneMerge.java:16

↓ 3 callersMethodcompare

(Line o1, Line o2)

src/class07/Code01_CoverMax.java:61

↓ 3 callersMethodcopy

(char[][] board)

src/class15/Code02_NumberOfIslands.java:250

↓ 3 callersMethodcopyArray

(int[] arr)

src/class29/Code02_MaxTopK.java:152

↓ 3 callersMethodcopyArray

(int[] arr)

src/class40/Code04_AvgLessEqualValueLongestSubarray.java:124

↓ 3 callersMethoddp3

(int[] arr, int aim)

src/class24/Code04_MinCoinsOnePaper.java:115

↓ 3 callersMethodf1

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

src/class18/Code02_CardsInLine.java:16

↓ 3 callersMethodf2

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

src/class18/Code02_CardsInLine.java:54

↓ 3 callersMethodfindLastIndex

(K key)

src/class36/Code01_SizeBalancedTreeMap.java:74

↓ 3 callersMethodfindLastIndex

(K key)

src/class35/Code01_AVLTreeMap.java:76

↓ 3 callersMethodg1

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

src/class18/Code02_CardsInLine.java:26

↓ 3 callersMethodg2

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

src/class18/Code02_CardsInLine.java:71

↓ 3 callersMethodgenerateNode

(String val)

src/class11/Code02_SerializeAndReconstructTree.java:174

↓ 3 callersMethodgetBSTSize

(Node head)

src/class13/Code02_MaxSubBSTHead.java:17

↓ 3 callersMethodgetIndexKey

(int index)

src/class37/Code02_SlidingWindowMedian.java:181

↓ 3 callersMethodgetInfo

(int[] arr)

src/class21/Code04_CoinsWaySameValueSamePapper.java:18

↓ 3 callersMethodgetIntersectNode

(Node head1, Node head2)

src/class10/Code01_FindFirstIntersectNode.java:14

↓ 3 callersMethodgetSpace

(int num)

src/class36/Code01_SizeBalancedTreeMap.java:315

↓ 3 callersMethodgetSpace

(int num)

src/class30/Code01_MorrisTraversal.java:174

↓ 3 callersMethodgetSpace

(int num)

src/class11/Code04_PrintBinaryTree.java:35

↓ 3 callersMethodgetSpace

(int num)

src/class11/Code02_SerializeAndReconstructTree.java:235

↓ 3 callersMethodhuffmanForm

(HashMap<Character, Integer> countMap)

src/class46/Code05_HuffmanTree.java:59

↓ 3 callersMethodindex

(int r, int c)

src/class15/Code02_NumberOfIslands.java:198

↓ 3 callersMethodindex

(int r, int c)

src/class15/Code03_NumberOfIslandsII.java:39

↓ 3 callersMethodinsert

(String s)

src/class32/Code03_AC1.java:28

↓ 3 callersMethodinsert

(String s)

src/class32/Code04_AC2.java:36

↓ 3 callersMethodinsert

(SBTNode root, int index, SBTNode cur)

src/class37/Code04_QueueReconstructionByHeight.java:138

↓ 3 callersMethodisEmpty

()

src/class03/Code03_DoubleEndsQueueToStackAndQueue.java:100

↓ 3 callersMethodleftRotate

(SBTNode<K> cur)

src/class37/Code02_SlidingWindowMedian.java:29

↓ 3 callersMethodleftRotate

(SBTNode cur)

src/class37/Code01_CountofRangeSum.java:68

↓ 3 callersMethodleftRotate

(SBTNode<V> cur)

src/class37/Code03_AddRemoveGetIndexGreat.java:31

↓ 3 callersMethodleftRotate

(SBTNode cur)

src/class37/Code04_QueueReconstructionByHeight.java:95

↓ 3 callersMethodleftRotate

(SBTNode<K, V> cur)

src/class36/Code01_SizeBalancedTreeMap.java:31

↓ 3 callersMethodleftRotate

(AVLNode<K, V> cur)

src/class35/Code01_AVLTreeMap.java:37

↓ 3 callersMethodleftToRight

(int n)

src/class17/Code02_Hanoi.java:13

↓ 3 callersMethodlessKeySize

(long key)

src/class37/Code01_CountofRangeSum.java:142

↓ 3 callersMethodmatrixPower

(int[][] m, int p)

src/class26/Code02_FibonacciProblem.java:51

↓ 3 callersMethodmostRightLessNodeInLevel

(K key, SkipListNode<K, V> cur, int level)

src/class36/Code02_SkipListMap.java:65

↓ 3 callersMethodpeek

()

src/class03/Code06_TwoStacksImplementQueue.java:38

↓ 3 callersMethodpoll

()

src/class03/Code06_TwoStacksImplementQueue.java:30

↓ 3 callersMethodpop

()

src/class03/Code04_RingArray.java:29

↓ 3 callersMethodpop

()

src/class03/Code05_GetMinStack.java:23

↓ 3 callersMethodprintAll

(SBTNode<String, Integer> head)

src/class36/Code01_SizeBalancedTreeMap.java:293

↓ 3 callersMethodprintArray

(int[] arr)

src/class29/Code02_MaxTopK.java:183

↓ 3 callersMethodprintArray

(int[] arr)

src/class06/Code04_SortArrayDistanceLessK.java:91

↓ 3 callersMethodprintTree

(Node head)

src/class11/Code04_PrintBinaryTree.java:15

↓ 3 callersMethodprocess

(int[] arr, int i, int picks, int rest)

src/class23/Code02_SplitSumClosedSizeHalf.java:21

↓ 3 callersMethodpush

(int newNum)

src/class03/Code05_GetMinStack.java:51

↓ 3 callersMethodpushDown

(int rt, int ln, int rn)

src/class31/Code01_SegmentTree.java:37

↓ 3 callersMethodpushToPop

()

src/class03/Code06_TwoStacksImplementQueue.java:17

↓ 3 callersMethodpushUp

(int rt)

src/class31/Code01_SegmentTree.java:30

↓ 3 callersMethodrandomArray

(int N, int maxValue)

src/class24/Code04_MinCoinsOnePaper.java:164

↓ 3 callersMethodremove

(K key)

src/class36/Code02_SkipListMap.java:133

↓ 3 callersMethodrightRotate

(SBTNode<K> cur)

src/class37/Code02_SlidingWindowMedian.java:20

↓ 3 callersMethodrightRotate

(SBTNode cur)

src/class37/Code01_CountofRangeSum.java:55

↓ 3 callersMethodrightRotate

(SBTNode<V> cur)

src/class37/Code03_AddRemoveGetIndexGreat.java:22

↓ 3 callersMethodrightRotate

(SBTNode cur)

src/class37/Code04_QueueReconstructionByHeight.java:86

↓ 3 callersMethodrightRotate

(SBTNode<K, V> cur)

src/class36/Code01_SizeBalancedTreeMap.java:22

↓ 3 callersMethodrightRotate

(AVLNode<K, V> cur)

src/class35/Code01_AVLTreeMap.java:28

↓ 3 callersMethodsize

()

src/class36/Code01_SizeBalancedTreeMap.java:192

↓ 3 callersMethodsize

()

src/class35/Code01_AVLTreeMap.java:171

↓ 3 callersMethodsum

(int[] arr)

src/class41/Code03_StoneMerge.java:6

↓ 3 callersMethodsum

(int begin, int end, int relation, int[][] presum)

src/class47/Code02_RestoreWays.java:195

↓ 3 callersMethodswap

(int[] arr, int i1, int i2)

src/class29/Code01_FindMinKth.java:83

↓ 3 callersMethodswap

(int i, int j)

src/class07/HeapGreater.java:100

↓ 3 callersMethodswap

(int i, int j)

src/class16/Code06_NetworkDelayTime.java:140

↓ 3 callersMethodswap

(int index1, int index2)

src/class16/Code06_Dijkstra.java:133

↓ 3 callersMethodswap

(int index1, int index2)

src/class17/Code01_Dijkstra.java:135

↓ 3 callersMethodswap

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

src/class06/Code02_Heap.java:74

↓ 2 callersMethodadd

(SBTNode<K> cur, K key)

src/class37/Code02_SlidingWindowMedian.java:88

↓ 2 callersMethodadd

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

src/class31/Code01_SegmentTree.java:97

↓ 2 callersMethodaddEdge

(int u, int v, int r)

src/class47/Code03_DinicAlgorithm.java:87

↓ 2 callersMethodaddFromHead

(T value)

src/class03/Code03_DoubleEndsQueueToStackAndQueue.java:23

↓ 2 callersMethodaddOrUpdateOrIgnore

(Node node, int distance)

src/class16/Code06_Dijkstra.java:78

↓ 2 callersMethodaddOrUpdateOrIgnore

(Node node, int distance)

src/class17/Code01_Dijkstra.java:79

↓ 2 callersMethodbfprt

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

src/class29/Code01_FindMinKth.java:96

↓ 2 callersMethodbubbleSort

(int[] arr)

src/class01/Code02_BubbleSort.java:7

↓ 2 callersMethodbuild

(int l, int r, int rt)

src/class31/Code01_SegmentTree.java:61

↓ 2 callersMethodcheckDoubleListReverse

(List<Integer> origin, DoubleNode head)

src/class03/Code01_ReverseList.java:163

↓ 2 callersMethodcheckLinkedListReverse

(List<Integer> origin, Node head)

src/class03/Code01_ReverseList.java:142

↓ 2 callersMethodcleanZeroBuy

(ArrayList<Customer> arr)

src/class07/Code02_EveryStepShowBoss.java:210

↓ 2 callersMethodcompensate

(int pre, int cur, int coin)

src/class24/Code04_MinCoinsOnePaper.java:159

↓ 2 callersMethodcopyArray

(int[] arr)

src/class08/Code05_ShellSort.java:59

↓ 2 callersMethodcopyArray

(int[] arr)

src/class29/Code01_FindMinKth.java:39

↓ 2 callersMethodcopyArray

(int[] arr)

src/class01/Code03_InsertionSort.java:44

↓ 2 callersMethodcopyArray

(int[] arr)

src/class06/Code04_SortArrayDistanceLessK.java:60

↓ 2 callersMethodcopyArray

(int[] arr)

src/class05/Code03_QuickSortRecursiveAndUnrecursive.java:131

↓ 2 callersMethodcopyArray

(int[] arr)

src/class05/Code02_PartitionAndQuickSort.java:134

↓ 2 callersMethodcountMap

(String str)

src/class46/Code05_HuffmanTree.java:16

↓ 2 callersMethodcountSort

(int[] arr)

src/class08/Code03_CountSort.java:8

↓ 2 callersMethoddoubleLinkedListToString

(Node head)

src/class05/Code04_DoubleLinkedListQuickSort.java:263

↓ 2 callersMethoddp2

(int[] arr, int aim)

src/class24/Code04_MinCoinsOnePaper.java:84

↓ 2 callersMethodfind

(int i)

src/class15/Code02_NumberOfIslands.java:203

↓ 2 callersMethodfind

(int i)

src/class15/Code01_FriendCircles.java:46

↓ 2 callersMethodfind

(int i)

src/class15/Code03_NumberOfIslandsII.java:43

↓ 2 callersMethodfind

(String cur)

src/class15/Code03_NumberOfIslandsII.java:117

↓ 2 callersMethodfind

(int i)

src/class16/Code04_KruskalNowCoder.java:68

← previous next →101–200 of 1,411, ranked by callers