Functions — github.com/coderbruis/AlgorithmsInJava

hub / github.com/coderbruis/AlgorithmsInJava / functions

Functions342 in github.com/coderbruis/AlgorithmsInJava

⨍ Functions 342◇ Types & classes 60

↓ 14 callersMethodswap

(int[] arr, int sourceIndex, int targetIndex)

src/main/java/com/bruis/algorithminjava/algorithm/sort/Sort2026.java:329

↓ 13 callersMethodput

(K key, V value)

src/main/java/com/bruis/algorithminjava/datastructures/list/HashMapLRUCache.java:60

↓ 11 callersMethodget

(int index)

src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java:87

↓ 9 callersMethodadd

(int index, E e)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedList.java:29

↓ 7 callersMethodgetSize

()

src/main/java/com/bruis/algorithminjava/datastructures/stack/Stack.java:7

↓ 7 callersMethodmax

(int i, int j)

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/MaximumGap.java:154

↓ 6 callersMethodcontainsKey

(K key)

src/main/java/com/bruis/algorithminjava/datastructures/list/HashMapLRUCache.java:46

↓ 5 callersMethodaddFirst

(E e)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedList.java:21

↓ 5 callersMethodgetCapacity

()

src/main/java/com/bruis/algorithminjava/datastructures/queue/MyLoopQueue.java:33

↓ 5 callersMethodisEmpty

()

src/main/java/com/bruis/algorithminjava/datastructures/stack/Stack.java:8

↓ 5 callersMethodput

(K key, V value)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListLRUCache.java:53

↓ 5 callersMethodsort

(int[] nums, int left, int right)

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/SortColors.java:20

↓ 4 callersMethodcheckNotEmpty

()

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:170

↓ 4 callersMethodfindIndex

(K key)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListLRUCache.java:82

↓ 4 callersMethodpeek

()

src/main/java/com/bruis/algorithminjava/datastructures/stack/Stack.java:12

↓ 4 callersMethodsort

(int[] arr)

src/main/java/com/bruis/algorithminjava/algorithm/sort/InsertionSort.java:8

↓ 4 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/QuickSort3Ways.java:53

↓ 4 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexMapHeap.java:183

↓ 4 callersMethodswapIndexes

(int i, int j)

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:155

↓ 3 callersMethodcontains

(int i)

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:44

↓ 3 callersMethodget

(int index)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListWithDummyHead.java:49

↓ 3 callersMethodgetE

()

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListWithDummyHead.java:200

↓ 3 callersMethodgetMax

()

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:72

↓ 3 callersMethodgetMaxIndex

()

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:77

↓ 3 callersMethodgetSize

()

src/main/java/com/bruis/algorithminjava/datastructures/queue/Queue.java:7

↓ 3 callersMethodinsert

(int index, E value)

src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java:37

↓ 3 callersMethodprintData

(E[] data, int size)

src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java:165

↓ 3 callersMethodprintHeap

(int[] heap)

src/main/java/com/bruis/algorithminjava/datastructures/heap/HeapPrinter.java:11

↓ 3 callersMethodpush

(E e)

src/main/java/com/bruis/algorithminjava/datastructures/stack/Stack.java:9

↓ 3 callersMethodremove

(int index)

src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java:123

↓ 3 callersMethodremoveNode

(Node<K, V> node)

src/main/java/com/bruis/algorithminjava/datastructures/list/HashMapLRUCache.java:124

↓ 3 callersMethodshiftDown

(int k)

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:141

↓ 3 callersMethodshiftDown

索引堆中, 数据之间的比较根据data的大小进行比较, 但实际操作的是索引由于是由1开始计算索引，所以左子树为 2 k @param k

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexMapHeap.java:141

↓ 3 callersMethodsize

()

src/main/java/com/bruis/algorithminjava/algorithm/sort/Heap.java:84

↓ 3 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/HeapSort01.java:67

↓ 3 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/QuickSort2Ways.java:59

↓ 3 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/QuickSort2.java:60

↓ 3 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/BubbleSort.java:73

↓ 3 callersMethodswap

(int a, int b)

src/main/java/com/bruis/algorithminjava/algorithm/sort/Heap.java:117

↓ 3 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/SortColors.java:45

↓ 3 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/MaximumGap.java:158

↓ 3 callersMethodtoString

()

src/main/java/com/bruis/algorithminjava/datastructures/stack/MyStack.java:58

↓ 2 callersMethodadd

(int index, E e)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListWithDummyHead.java:65

↓ 2 callersMethodaddFirst

(Node<K, V> node)

src/main/java/com/bruis/algorithminjava/datastructures/list/HashMapLRUCache.java:106

↓ 2 callersMethodaddLast

(E e)

src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java:78

↓ 2 callersMethodchange

(int i, int item)

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:110

↓ 2 callersMethodcheckIndex

(int i)

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:164

↓ 2 callersMethoddoMergeSort

(int[] arr, int left, int mid, int right)

src/main/java/com/bruis/algorithminjava/algorithm/sort/Sort2026.java:123

↓ 2 callersMethodget

(K key)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListLRUCache.java:43

↓ 2 callersMethodget

(K key)

src/main/java/com/bruis/algorithminjava/datastructures/list/HashMapLRUCache.java:50

↓ 2 callersMethodget

(int index)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedList.java:56

↓ 2 callersMethodgetE

()

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListQueue.java:96

↓ 2 callersMethodgetValue

()

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListLRUCache.java:127

↓ 2 callersMethodisEmpty

()

src/main/java/com/bruis/algorithminjava/datastructures/queue/MyLoopQueue.java:28

↓ 2 callersMethodisEmpty

()

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListQueue.java:28

↓ 2 callersMethodisSorted

判断arr数组是否有序 @param arr @return

src/main/java/com/bruis/algorithminjava/utils/SortTestHelper.java:81

↓ 2 callersMethodisVowel

1. 元音字母是？

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/ReverseVowels.java:48

↓ 2 callersMethodmoveToFirst

(Node<K, V> node)

src/main/java/com/bruis/algorithminjava/datastructures/list/HashMapLRUCache.java:88

↓ 2 callersMethodpop

()

src/main/java/com/bruis/algorithminjava/datastructures/stack/Stack.java:11

↓ 2 callersMethodprintSpaces

(int count)

src/main/java/com/bruis/algorithminjava/datastructures/heap/HeapPrinter.java:39

↓ 2 callersMethodremove

(K key)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListLRUCache.java:68

↓ 2 callersMethodremove

(int index)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedList.java:99

↓ 2 callersMethodremoveElement

(int index)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListWithDummyHead.java:106

↓ 2 callersMethodremoveFirst

()

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedList.java:122

↓ 2 callersMethodresize

(int newCapacity)

src/main/java/com/bruis/algorithminjava/datastructures/queue/MyLoopQueue.java:78

↓ 2 callersMethodresize

(int newSize)

src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java:157

↓ 2 callersMethodshiftDown

下沉操作 @param k

src/main/java/com/bruis/algorithminjava/algorithm/sort/HeapSort01.java:41

↓ 2 callersMethodshiftDown

下层操作 @param k

src/main/java/com/bruis/algorithminjava/algorithm/sort/Heap.java:107

↓ 2 callersMethodshiftDown

(int a)

src/main/java/com/bruis/algorithminjava/datastructures/heap/MaxHeapHeapify.java:44

↓ 2 callersMethodshiftUp

(int k)

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:134

↓ 2 callersMethodshiftUp

索引堆中, 数据之间的比较根据data的大小进行比较, 但实际操作的是索引 @param k

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexMapHeap.java:124

↓ 2 callersMethodsiftDown2

优化下沉过程, 不适用swap交换，通过赋值来代替。 @param arr @param n @param k

src/main/java/com/bruis/algorithminjava/algorithm/sort/HeapSort02.java:58

↓ 2 callersMethodsize

()

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:40

↓ 2 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/Test.java:43

↓ 2 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/QuickSort.java:50

↓ 2 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/InsertionSort.java:49

↓ 2 callersMethodswap

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/HeapSort02.java:79

↓ 2 callersMethodswap

(int a, int b)

src/main/java/com/bruis/algorithminjava/datastructures/heap/MaxHeapHeapify.java:57

↓ 1 callersMethodaddLast

(E e)

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListWithDummyHead.java:83

↓ 1 callersMethodceil

(int[] arr, int v)

src/main/java/com/bruis/algorithminjava/algorithm/sort/BinarySearchFloorAndCeil.java:29

↓ 1 callersMethodcontainsDuplicate

(int[] nums)

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/ContainsDuplicate_217.java:18

↓ 1 callersMethoddelete

(int index)

src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java:55

↓ 1 callersMethoddemoChangeByOriginalIndex

()

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexHeap.java:176

↓ 1 callersMethoddequeue

head tail removeFirst <- [a, b, c, d, ..., z] <- addLast

src/main/java/com/bruis/algorithminjava/datastructures/queue/MyQueue.java:46

↓ 1 callersMethoddequeue

()

src/main/java/com/bruis/algorithminjava/datastructures/queue/MyLoopQueue.java:55

↓ 1 callersMethoddoQuickSort

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/Test.java:24

↓ 1 callersMethoddoQuickSort

(int[] arr, int left, int right)

src/main/java/com/bruis/algorithminjava/algorithm/sort/Sort2026.java:182

↓ 1 callersMethoddoSort

(int[] arr)

src/main/java/com/bruis/algorithminjava/algorithm/sort/BucketSort.java:34

↓ 1 callersMethoddoThreeWayQuickSort

1) arr[l+1...lt] < p(arr[l]) 2) arr[lt+1...i-1] = p(arr[l]) 3) arr[gt...r] > p(arr[l]) <p> [a, b, c, d, e, f, g, h, i, j, k]

src/main/java/com/bruis/algorithminjava/algorithm/sort/Sort2026.java:299

↓ 1 callersMethoddoTwoWayQuickSort

(int[] arr, int left, int right)

src/main/java/com/bruis/algorithminjava/algorithm/sort/Sort2026.java:233

↓ 1 callersMethodenqueue

head tail [a, b, c, d, ..., z] <- addLast @param e

src/main/java/com/bruis/algorithminjava/datastructures/queue/MyQueue.java:36

↓ 1 callersMethodenqueue

进队 head tail [a, b, c, d, ..., z] <- addLast @param e

src/main/java/com/bruis/algorithminjava/datastructures/queue/MyLoopQueue.java:45

↓ 1 callersMethodextractMax

获取最大堆中堆顶元素

src/main/java/com/bruis/algorithminjava/algorithm/sort/HeapSort01.java:27

↓ 1 callersMethodextractMax

()

src/main/java/com/bruis/algorithminjava/datastructures/heap/MaxHeapHeapify.java:24

↓ 1 callersMethodextractMax

获取最大索引堆中堆顶元素的值，即索引堆中存储的最大数据 @return

src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexMapHeap.java:91

↓ 1 callersMethodfind

(E e)

src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java:114

↓ 1 callersMethodgenerateRandomIntArray

()

src/main/java/com/bruis/algorithminjava/datastructures/heap/HeapSort.java:21

↓ 1 callersMethodgetFirst

()

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedList.java:68

↓ 1 callersMethodgetFirst

()

src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java:100

↓ 1 callersMethodgetKey

()

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListLRUCache.java:123

next →1–100 of 342, ranked by callers