Functions — github.com/coderbruis/AlgorithmsInJava

hub / github.com/coderbruis/AlgorithmsInJava / functions

Functions342 in github.com/coderbruis/AlgorithmsInJava

⨍ Functions 342◇ Types & classes 60

↓ 1 callersMethodgetLast

()

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

↓ 1 callersMethodgetReversePairs

(int[] nums)

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/ReversePairs.java:54

↓ 1 callersMethodheapSort

(int[] arr)

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

↓ 1 callersMethodheapify

堆化完后并没有排序完成 @param arr

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

↓ 1 callersMethodheapify

堆化

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

↓ 1 callersMethodheapify

()

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

↓ 1 callersMethodinsert

(int value)

src/main/java/com/bruis/algorithminjava/datastructures/heap/MaxHeap.java:31

↓ 1 callersMethodinsert

(int i, int item)

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

↓ 1 callersMethodinsert

插入新元素 @param i @param item

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

↓ 1 callersMethodisEmpty

()

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

↓ 1 callersMethodisEmpty

()

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

↓ 1 callersMethodisEmpty

()

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

↓ 1 callersMethodisPalindrome

(String str)

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/IsPalindrome.java:15

↓ 1 callersMethodlowerBound

(int[] arr, int v)

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

↓ 1 callersMethodmaxProduct

问题1 ：算法没有包括数组头部元素的比较；问题2 : 数组没有考虑到每个元素本身大小的比较； @param nums @return

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/MaximumProductSubarray.java:21

↓ 1 callersMethodmaximumGapOptimize2

基于桶排序时间复杂度：O(N) 空间复杂度：O(N) @param nums @return

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

↓ 1 callersMethodmerge

将arr[left...mid]和arr[mid+1...right]两部分进行归并 @param arr @param left @param mid @param right

src/main/java/com/bruis/algorithminjava/algorithm/sort/MergeSort.java:22

↓ 1 callersMethodmerge

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/MergeSortBU.java:12

↓ 1 callersMethodmerge

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

src/main/java/com/bruis/algorithminjava/algorithm/sort/MergeSortAdvanced01.java:13

↓ 1 callersMethodmergeCount

(int[] nums, int[] temp, int start, int end)

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/ReversePairs.java:114

↓ 1 callersMethodmergeSortInner

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

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

↓ 1 callersMethodmoveToFirst

(int index)

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

↓ 1 callersMethodoptimizeSolution01

借助jdk hashmap，时间复杂度: O(n) 空间复杂度：O(n) @param nums @param target @return

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/TwoSum.java:47

↓ 1 callersMethodpartition

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

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

↓ 1 callersMethodpartition

对arr[left...right]部分进行partition操作返回p, 使得arr[left...p-1] < arr[p] ; arr[p+1...right] > arr[p] @param arr @param left @param right @return

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

↓ 1 callersMethodpartition

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

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

↓ 1 callersMethodpartition

对arr[left...right]部分进行partition操作返回p, 使得arr[left...p-1] < arr[p] ; arr[p+1...right] > arr[p] @param arr @param left @param right @return

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

↓ 1 callersMethodpartition

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

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

↓ 1 callersMethodpop

[a, b, c, d, ..., z] -> removeLast @return

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

↓ 1 callersMethodprintList

()

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

↓ 1 callersMethodpush

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

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

↓ 1 callersMethodquickSort

(int[] nums)

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

↓ 1 callersMethodquickSort3ways

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

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

↓ 1 callersMethodremove

(K key)

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

↓ 1 callersMethodremoveFirst

()

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

↓ 1 callersMethodremoveLast

()

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

↓ 1 callersMethodremoveLast

()

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

↓ 1 callersMethodremoveLast

()

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

↓ 1 callersMethodreversePairs

使用自顶向下的归并排序算法计算逆序对，用来额外的空间。 @param nums @return

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/ReversePairs.java:46

↓ 1 callersMethodreversePairs3

相比解法二时间复杂度常数和空间复杂度更低 @param nums @return

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/ReversePairs.java:103

↓ 1 callersMethodset

(E e, int index)

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

↓ 1 callersMethodsetE

(E e)

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

↓ 1 callersMethodsetValue

(V value)

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

↓ 1 callersMethodshiftUp

上浮操作 @param k

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

↓ 1 callersMethodshiftUp

(int a)

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

↓ 1 callersMethodsort

(int[] arr)

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

↓ 1 callersMethodsort

(int[] arr)

src/main/java/com/bruis/algorithminjava/algorithm/sort/ShellSort.java:10

↓ 1 callersMethodsort

(int[] arr)

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

↓ 1 callersMethodsort2

(int[] arr)

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

↓ 1 callersMethodsortColors

(int[] nums)

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

↓ 1 callersMethodsubarraySum04

O (n) 前缀和 + 哈希表 @param nums @param k @return

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/SubarraySumEqualsK.java:117

↓ 1 callersMethodswap

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

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

↓ 1 callersMethodswap

(int a, int b)

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

↓ 1 callersMethodtestIndexes

()

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

↓ 1 callersMethodtestSort

(int[] arr)

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

↓ 1 callersMethodthreeSum

nums = [-1, 0, 1, 2, -1, -4] <p> a + b + c = 0 <p> [ [-1, 0, 1], [-1, -1, 2] ] @param nums @return

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/ThreeSum.java:34

↓ 1 callersMethodtoArray

()

src/main/java/com/bruis/algorithminjava/datastructures/heap/MaxHeap.java:45

↓ 1 callersMethodtoArray

()

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

↓ 1 callersMethodtopKFrequent

桶排序

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

↓ 1 callersMethodtwoPointer

双指针时间复杂度：O(n) 空间复杂度：O(1) @param numbers @param target @return

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/TwoSumII.java:21

↓ 1 callersMethodtwoSum

nums = [2, 7, 11, 15], target = 9 返回: [0, 1] @param nums @param target @return

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/TwoSum.java:25

↓ 1 callersMethodtwoWayPartition

循环过程中： arr[left + 1...i - 1] <= p arr[j + 1...right] >= p <p> 最后 swap(arr, left, j) 后： arr[left...j - 1] <= p arr[j] == p arr[j + 1...right] >= p

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

↓ 1 callersMethodtwoWayQuickSort

(int[] arr)

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

↓ 1 callersMethodupdate

(int index, E value)

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

↓ 1 callersMethodupperBound

(int[] arr, int v)

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

↓ 1 callersMethodviolentSolution

(int[] nums)

src/main/java/com/bruis/algorithminjava/algorithm/leetcode/MaximumSubarray_53.java:25

MethodBucketSort

(int range)

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

MethodCacheEntry

(K key, V value)

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

MethodHashMapLRUCache

(int capacity)

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

MethodHeap

初始化堆 @param capacity

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

MethodHeapSort

()

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

MethodIndexHeap

(int capacity)

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

MethodIndexMapHeap

(int capacity)

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

MethodMaxHeap

()

src/main/java/com/bruis/algorithminjava/datastructures/heap/MaxHeap.java:16

MethodMaxHeapHeapify

()

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

MethodMinStack

()

src/main/java/com/bruis/algorithminjava/algorithm/stack/MinStack.java:26

MethodMyArray

(int capacity)

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

MethodMyLinkedList

()

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

MethodMyLinkedListLRUCache

(int capacity)

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

MethodMyLinkedListQueue

()

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

MethodMyLinkedListStack

()

src/main/java/com/bruis/algorithminjava/datastructures/list/MyLinkedListStack.java:17

MethodMyLinkedListWithDummyHead

()

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

MethodMyLoopQueue

(int capacity)

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

MethodMyQueue

(int capacity)

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

MethodMyStack

(int capacity)

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

MethodNode

()

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

MethodNode

(E e, Node next)

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

MethodNode

()

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

MethodNode

()

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

MethodSortTestHelper

SortTestHelper不允许产生任何实例

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

MethodaddFirst

(E e)

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

MethodaddFirst

(E e)

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

MethodaddLast

(E e)

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

MethodbinarySearch

(int[] arr, int target)

src/main/java/com/bruis/algorithminjava/algorithm/sort/BinarySearch.java:12

MethodbubbleSort

(int[] arr)

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

MethodbucketMapSolution

基于桶排序 @param nums @return

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

Methodchange

@param i @param item

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

Methodcontains

(E e)

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

Methodcontains

(E e)

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

Methodcontains

(E e)

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

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