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 callersMethodfind

(long num)

src/class39/Code02_SnacksWaysMain2.java:133

↓ 2 callersMethodfindFather

(Node<V> cur)

src/class15/Code02_NumberOfIslands.java:109

↓ 2 callersMethodfindLastIndex

(K key)

src/class37/Code02_SlidingWindowMedian.java:72

↓ 2 callersMethodgenerateRandomArray

(int len, int maxValue)

src/class08/Code05_ShellSort.java:50

↓ 2 callersMethodgenerateRandomArray

(int maxSize, int maxValue)

src/class08/Code03_CountSort.java:34

↓ 2 callersMethodgenerateRandomArray

(int maxSize, int maxValue)

src/class08/Code04_RadixSort.java:71

↓ 2 callersMethodgenerateRandomArray

(int maxSize, int maxValue)

src/class01/Code03_InsertionSort.java:32

↓ 2 callersMethodgenerateRandomArray

(int maxSize, int maxValue)

src/class01/Code02_BubbleSort.java:36

↓ 2 callersMethodgenerateRandomArray

(int maxSize, int maxValue)

src/class01/Code01_SelectionSort.java:35

↓ 2 callersMethodgenerateRandomArray

(int len)

src/class47/Code02_RestoreWays.java:200

↓ 2 callersMethodgenerateRandomArray

(int maxSize, int maxValue)

src/class06/Code03_HeapSort.java:70

↓ 2 callersMethodgenerateRandomDoubleList

(int len, int value)

src/class03/Code01_ReverseList.java:113

↓ 2 callersMethodgenerateRandomLinkedList

(int len, int value)

src/class03/Code01_ReverseList.java:95

↓ 2 callersMethodgenerateRandomMatrix

(int row, int col)

src/class15/Code02_NumberOfIslands.java:239

↓ 2 callersMethodgetCurAns

(ArrayList<Customer> daddy)

src/class07/Code02_EveryStepShowBoss.java:223

↓ 2 callersMethodgetDigit

(int x, int d)

src/class08/Code04_RadixSort.java:61

↓ 2 callersMethodgetDoubleListOriginOrder

(DoubleNode head)

src/class03/Code01_ReverseList.java:153

↓ 2 callersMethodgetIndex

(SBTNode<K, V> cur, int kth)

src/class36/Code01_SizeBalancedTreeMap.java:182

↓ 2 callersMethodgetInfo

(int[] arr)

src/class24/Code04_MinCoinsOnePaper.java:63

↓ 2 callersMethodgetLinkedListOriginOrder

(Node head)

src/class03/Code01_ReverseList.java:132

↓ 2 callersMethodgetLoopNode

(Node head)

src/class10/Code01_FindFirstIntersectNode.java:30

↓ 2 callersMethodgetMinDistanceAndUnselectedNode

(HashMap<Node, Integer> distanceMap, HashSet<Node> touchedNodes)

src/class16/Code06_Dijkstra.java:33

↓ 2 callersMethodgetMinDistanceAndUnselectedNode

(HashMap<Node, Integer> distanceMap, HashSet<Node> touchedNodes)

src/class17/Code01_Dijkstra.java:33

↓ 2 callersMethodgetRandomString

(int possibilities, int size)

src/class27/Code01_KMP.java:51

↓ 2 callersMethodheapInsert

(int index)

src/class07/HeapGreater.java:79

↓ 2 callersMethodheapInsert

(int i)

src/class16/Code06_NetworkDelayTime.java:117

↓ 2 callersMethodheapSort

(int[] arr)

src/class06/Code03_HeapSort.java:9

↓ 2 callersMethodheapify

(int[] arr, int index, int heapSize)

src/class29/Code02_MaxTopK.java:58

↓ 2 callersMethodheapify

(int index)

src/class07/HeapGreater.java:86

↓ 2 callersMethodheapify

(int[] arr, int index, int heapSize)

src/class06/Code03_HeapSort.java:39

↓ 2 callersMethodhuffmanDecode

(String huffmanEncode, HashMap<Character, String> huffmanForm)

src/class46/Code05_HuffmanTree.java:108

↓ 2 callersMethodhuffmanEncode

(String str, HashMap<Character, String> huffmanForm)

src/class46/Code05_HuffmanTree.java:98

↓ 2 callersMethodinsertHeapify

(int index)

src/class16/Code06_Dijkstra.java:102

↓ 2 callersMethodinsertHeapify

(Node node, int index)

src/class17/Code01_Dijkstra.java:104

↓ 2 callersMethodinsertionSort

(int[] arr)

src/class08/Code05_ShellSort.java:37

↓ 2 callersMethodinsertionSort

(int[] arr)

src/class01/Code03_InsertionSort.java:7

↓ 2 callersMethodisEmpty

()

src/class16/Code06_NetworkDelayTime.java:113

↓ 2 callersMethodisEntered

(Node node)

src/class16/Code06_Dijkstra.java:125

↓ 2 callersMethodisEntered

(Node node)

src/class17/Code01_Dijkstra.java:127

↓ 2 callersMethodisEqual

(int[] arr1, int[] arr2)

src/class29/Code02_MaxTopK.java:164

↓ 2 callersMethodisEqual

(int[][] res1, int[][] res2)

src/class25/Code01_MonotonousStack.java:123

↓ 2 callersMethodisEqual

(String a, String b)

src/class27/Code02_TreeEqual.java:97

↓ 2 callersMethodisEqual

(Integer o1, Integer o2)

src/class03/Code03_DoubleEndsQueueToStackAndQueue.java:127

↓ 2 callersMethodisEqual

(int[] arr1, int[] arr2)

src/class05/Code03_QuickSortRecursiveAndUnrecursive.java:143

↓ 2 callersMethodisEqual

(int[] arr1, int[] arr2)

src/class05/Code02_PartitionAndQuickSort.java:146

↓ 2 callersMethodisFull

()

src/class06/Code02_Heap.java:23

↓ 2 callersMethodisMSum1

(int num)

src/class38/Code03_MSumToN.java:5

↓ 2 callersMethodisSameArray

(int[] arr1, int[] arr2)

src/class41/Code02_BestSplitForEveryPosition.java:99

↓ 2 callersMethodisSameValueStructure

(Node head1, Node head2)

src/class11/Code02_SerializeAndReconstructTree.java:198

↓ 2 callersMethodlcs1

(String s1, String s2)

src/class45/Code03_LongestCommonSubstringConquerByHeight.java:14

↓ 2 callersMethodlcs2

(String s1, String s2)

src/class45/Code03_LongestCommonSubstringConquerByHeight.java:48

↓ 2 callersMethodleftToMid

(int n)

src/class17/Code02_Hanoi.java:24

↓ 2 callersMethodleq

(int a1, int a2, int b1, int b2)

src/class45/Code01_InsertS2MakeMostAlphabeticalOrder.java:195

↓ 2 callersMethodleq

(int a1, int a2, int b1, int b2)

src/class45/Code04_LongestRepeatingSubstring.java:139

↓ 2 callersMethodleq

(int a1, int a2, int b1, int b2)

src/class45/Code02_CreateMaximumNumber.java:204

↓ 2 callersMethodleq

(int a1, int a2, int b1, int b2)

src/class45/Code03_LongestCommonSubstringConquerByHeight.java:196

↓ 2 callersMethodleq

(int a1, int a2, int b1, int b2)

src/class44/Code01_LastSubstringInLexicographicalOrder.java:126

↓ 2 callersMethodleq

(int a1, int a2, int b1, int b2)

src/class44/DC3.java:114

↓ 2 callersMethodmaintain

(AVLNode<K, V> cur)

src/class35/Code01_AVLTreeMap.java:46

↓ 2 callersMethodmanacherString

(String str)

src/class28/Code01_Manacher.java:38

↓ 2 callersMethodmatrixPower

(int[][] m, int p)

src/class26/Code03_ZeroLeftOneStringNumber.java:73

↓ 2 callersMethodmaxCombine

(String s1, String s2)

src/class45/Code01_InsertS2MakeMostAlphabeticalOrder.java:28

↓ 2 callersMethodmerge

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

src/class04/Code01_MergeSort.java:27

↓ 2 callersMethodmidToLeft

(int n)

src/class17/Code02_Hanoi.java:54

↓ 2 callersMethodmidToRight

(int n)

src/class17/Code02_Hanoi.java:44

↓ 2 callersMethodnearestIndex

(int[] arr, int value)

src/class01/Code05_BSNearRight.java:8

↓ 2 callersMethodnearestIndex

(int[] arr, int value)

src/class01/Code05_BSNearLeft.java:8

↓ 2 callersMethodnetherlandsFlag

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

src/class05/Code02_PartitionAndQuickSort.java:35

↓ 2 callersMethodnextIndex

(int i)

src/class03/Code04_RingArray.java:44

↓ 2 callersMethodnum

(int n)

src/class25/Code05_CountSubmatricesWithAllOnes.java:77

↓ 2 callersMethodnumIslands2

(char[][] board)

src/class15/Code02_NumberOfIslands.java:141

↓ 2 callersMethodnumIslands3

(char[][] board)

src/class15/Code02_NumberOfIslands.java:13

↓ 2 callersMethodpartition

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

src/class29/Code01_FindMinKth.java:67

↓ 2 callersMethodpickRandomOne

(Node head)

src/class13/Code03_lowestAncestor.java:106

↓ 2 callersMethodpoll

()

src/class03/Code03_DoubleEndsQueueToStackAndQueue.java:117

↓ 2 callersMethodpop

()

src/class03/Code03_DoubleEndsQueueToStackAndQueue.java:96

↓ 2 callersMethodpop

()

src/class06/Code02_Heap.java:38

↓ 2 callersMethodpop

()

src/class06/Code02_Heap.java:108

↓ 2 callersMethodpreMoreThanLast

(int[] nums1, int i, int[] nums2, int j)

src/class45/Code02_CreateMaximumNumber.java:36

↓ 2 callersMethodpreSerial

(TreeNode head)

src/class27/Code02_TreeEqual.java:40

↓ 2 callersMethodprintArray

(int[] arr)

src/class08/Code05_ShellSort.java:90

↓ 2 callersMethodprintArray

(int[] arr)

src/class25/Code01_MonotonousStack.java:137

↓ 2 callersMethodprintArray

(int[] arr)

src/class01/Code03_InsertionSort.java:75

↓ 2 callersMethodprintArray

(int[] arr)

src/class01/Code02_BubbleSort.java:76

↓ 2 callersMethodprintArray

(int[] arr)

src/class04/Code02_SmallSum.java:108

↓ 2 callersMethodprintArray

(int[] arr)

src/class04/Code03_ReversePair.java:101

↓ 2 callersMethodprintArray

(int[] arr)

src/class04/Code01_MergeSort.java:116

↓ 2 callersMethodprintArray

(int[] arr)

src/class04/Code04_BiggerThanRightTwice.java:106

↓ 2 callersMethodprintArray

(int[] arr)

src/class06/Code03_HeapSort.java:110

↓ 2 callersMethodprintEdge

(Node head)

src/class30/Code01_MorrisTraversal.java:131

↓ 2 callersMethodprintLinkedList

(Node node)

src/class09/Code03_SmallerEqualBigger.java:114

↓ 2 callersMethodprintMatrix

(int[][] matrix)

src/class40/Code06_RotateMatrix.java:26

↓ 2 callersMethodprintTree

(Node head)

src/class30/Code01_MorrisTraversal.java:154

↓ 2 callersMethodprocess

(int[] arr, int index, long w, int end, int bag, TreeMap<Long, Long> map)

src/class39/Code02_SnacksWaysMain1.java:114

↓ 2 callersMethodprocess

(int[] pre, int level, int N)

src/class43/Code03_PavingTile.java:28

↓ 2 callersMethodprocess1

(int[] arr, int i, int v, int s)

src/class47/Code02_RestoreWays.java:68

↓ 2 callersMethodprocess2

(int pre, int i, int N, int M)

src/class43/Code03_PavingTile.java:89

↓ 2 callersMethodprocess3

(int pre, int i, int N, int M, int[][] dp)

src/class43/Code03_PavingTile.java:130

↓ 2 callersMethodprocess4

(int[] arr, int i, int end, int pre, HashSet<Integer> ans)

src/class39/IsSum.java:128

↓ 2 callersMethodprocess4

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

src/class39/Code01_SubsquenceMaxModM.java:104

← previous next →201–300 of 1,411, ranked by callers