MCPcopy Create free account

hub / github.com/CCCshengjiang/algorithm / functions

Functions231 in github.com/CCCshengjiang/algorithm

⨍ Functions 231◇ Types & classes 80
↓ 29 callersMethodisEmpty
()
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:14
↓ 18 callersMethodpush
(int value)
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:22
↓ 14 callersMethodpoll
()
data-structure-algorithm/src/cn/cwblue/heap/improved/MyHeap.java:34
↓ 10 callersMethodpop
()
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:30
↓ 8 callersMethodpeek
()
data-structure-algorithm/src/cn/cwblue/stack/TwoStacksImplementQueue.java:44
↓ 8 callersMethodpop
()
data-structure-algorithm/src/cn/cwblue/stack/TwoStacksImplementQueue.java:35
↓ 8 callersMethodpush
(int data)
data-structure-algorithm/src/cn/cwblue/stack/TwoStacksImplementQueue.java:30
↓ 7 callersMethodpush
(int data)
data-structure-algorithm/src/cn/cwblue/stack/GetMinStack.java:26
↓ 5 callersMethodpush
(T value)
data-structure-algorithm/src/cn/cwblue/heap/improved/MyHeap.java:28
↓ 5 callersMethodswap
(int[] arr, int i, int j)
data-structure-algorithm/src/cn/cwblue/sort/quick/PartitionAndQuickSort.java:46
↓ 4 callersMethodequals
(Object o)
data-structure-algorithm/src/cn/cwblue/graph/GraphGenerator.java:52
↓ 4 callersMethodgetId
获取 @return id
data-structure-algorithm/src/cn/cwblue/heap/improved/Student.java:24
↓ 4 callersMethodswap
(int[] arr, int i, int j)
data-structure-algorithm/src/cn/cwblue/sort/quick/QuickSort.java:38
↓ 3 callersMethodcompare
(Student o1, Student o2)
data-structure-algorithm/src/cn/cwblue/heap/improved/test.java:14
↓ 3 callersMethodgenerateNode
(String val)
data-structure-algorithm/src/cn/cwblue/binarytree/SerializeAndReconstructTree.java:131
↓ 3 callersMethodpop
()
data-structure-algorithm/src/cn/cwblue/stack/GetMinStack.java:36
↓ 3 callersMethodswap
(int[] arr, int i, int j)
data-structure-algorithm/src/cn/cwblue/heap/HeapSort.java:33
↓ 3 callersMethodswap
(int[] heap, int i, int j)
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:61
↓ 3 callersMethodswap
(int i, int j)
data-structure-algorithm/src/cn/cwblue/heap/improved/MyHeap.java:71
↓ 2 callersMethodgetDigit
(int num, int digit)
data-structure-algorithm/src/cn/cwblue/sort/bucket/radix/RadixSort.java:54
↓ 2 callersMethodgetLoopNode
(Node head)
data-structure-algorithm/src/cn/cwblue/linkedlist/FindFirstIntersectNode.java:100
↓ 2 callersMethodheapInsert
(int index)
data-structure-algorithm/src/cn/cwblue/heap/improved/MyHeap.java:64
↓ 2 callersMethodheapify
(int[] arr, int index, int heapSize)
data-structure-algorithm/src/cn/cwblue/heap/HeapSort.java:19
↓ 2 callersMethodheapify
(int index, int heapSize)
data-structure-algorithm/src/cn/cwblue/heap/improved/MyHeap.java:50
↓ 2 callersMethodisEmpty
()
data-structure-algorithm/src/cn/cwblue/heap/improved/MyHeap.java:20
↓ 2 callersMethodisFull
()
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:18
↓ 2 callersMethodmerge
(int[] arr, int left, int mid, int right)
data-structure-algorithm/src/cn/cwblue/sort/merge/MergeSort.java:26
↓ 2 callersMethodnextIndex
(int index)
data-structure-algorithm/src/cn/cwblue/queue/RingArray.java:43
↓ 2 callersMethodpop
()
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:95
↓ 2 callersMethodpush
(int value)
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:88
↓ 2 callersMethodpushToPull
()
data-structure-algorithm/src/cn/cwblue/stack/TwoStacksImplementQueue.java:21
↓ 2 callersMethodresearch
(String word)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:69
↓ 2 callersMethodsearch
(String word)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:61
↓ 2 callersMethodsearch
(String word)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:128
↓ 2 callersMethodswap
(Node[] arr, int i, int j)
data-structure-algorithm/src/cn/cwblue/linkedlist/SmallEqualBig.java:103
↓ 1 callersMethodBSTNodeProcess
(Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/MaxSubBSTNode.java:41
↓ 1 callersMethodbalancedProcess
(Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/IsBalancedTree.java:33
↓ 1 callersMethodbestArrange
(Programs[] programs)
data-structure-algorithm/src/cn/cwblue/greedy/BestArrange.java:24
↓ 1 callersMethodbestArrange2
贪心算法 @param programs 总会议数 @return 然会能安排的最多的会议数量
data-structure-algorithm/src/cn/cwblue/greedy/BestArrange.java:68
↓ 1 callersMethodbothLoop
(Node head1, Node loop1, Node head2, Node loop2)
data-structure-algorithm/src/cn/cwblue/linkedlist/FindFirstIntersectNode.java:34
↓ 1 callersMethodcomparator
(int[] arr)
data-structure-algorithm/src/cn/cwblue/sort/bucket/counting/CountSort.java:26
↓ 1 callersMethodcomparator
(int[] arr)
data-structure-algorithm/src/cn/cwblue/sort/bucket/radix/RadixSort.java:59
↓ 1 callersMethodcopyButExcept
(Programs[] programs, int i)
data-structure-algorithm/src/cn/cwblue/greedy/BestArrange.java:52
↓ 1 callersMethodcopyListWithRandom
(Node head)
data-structure-algorithm/src/cn/cwblue/linkedlist/CopyListWithRandom.java:24
↓ 1 callersMethodcountSort
(int[] arr)
data-structure-algorithm/src/cn/cwblue/sort/bucket/counting/CountSort.java:6
↓ 1 callersMethoddelete
(String word)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:44
↓ 1 callersMethoddelete
(String word)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:146
↓ 1 callersMethoddistanceProcess
(Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/MaxDistance.java:32
↓ 1 callersMethodfunc
(char[] chars, int index, List<String> ans, String path)
data-structure-algorithm/src/cn/cwblue/dp/PrintAllSubsequences.java:27
↓ 1 callersMethodfunc
(int n, String left, String right, String other)
data-structure-algorithm/src/cn/cwblue/dp/Hanoi.java:20
↓ 1 callersMethodfunc
(Stack<Integer> stack)
data-structure-algorithm/src/cn/cwblue/dp/ReverseStackUsingRecursive.java:28
↓ 1 callersMethodgenerateRandomArr
(int arrLen)
data-structure-algorithm/src/cn/cwblue/sort/bucket/counting/CountSort.java:33
↓ 1 callersMethodgenerateRandomArr
(int arrLen, int num)
data-structure-algorithm/src/cn/cwblue/sort/bucket/radix/RadixSort.java:70
↓ 1 callersMethodgenerateRandomNum
(int num)
data-structure-algorithm/src/cn/cwblue/sort/bucket/radix/RadixSort.java:66
↓ 1 callersMethodgenerateRandomString
(int strLen)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:184
↓ 1 callersMethodgetHeapSize
()
data-structure-algorithm/src/cn/cwblue/heap/improved/MyHeap.java:24
↓ 1 callersMethodgetIntersectNode
(Node head1, Node head2)
data-structure-algorithm/src/cn/cwblue/linkedlist/FindFirstIntersectNode.java:19
↓ 1 callersMethodgetLeftMost
(Node node)
data-structure-algorithm/src/cn/cwblue/binarytree/SuccessorNode.java:44
↓ 1 callersMethodgetMax
(int[] arr)
data-structure-algorithm/src/cn/cwblue/recursion/GetMax.java:14
↓ 1 callersMethodgetMaxDistance
(Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/MaxDistance.java:28
↓ 1 callersMethodgetMaxHappy
(Employee boss)
data-structure-algorithm/src/cn/cwblue/binarytree/MaxHappy.java:33
↓ 1 callersMethodgetMaxSubBSTNode
(Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/MaxSubBSTNode.java:34
↓ 1 callersMethodgetMin
()
data-structure-algorithm/src/cn/cwblue/stack/GetMinStack.java:45
↓ 1 callersMethodgetSmallSum
(int[] arr)
data-structure-algorithm/src/cn/cwblue/sort/merge/GetSmallSum.java:9
↓ 1 callersMethodgetSuccessorNode
(Node node)
data-structure-algorithm/src/cn/cwblue/binarytree/SuccessorNode.java:27
↓ 1 callersMethodhanoi
(int n)
data-structure-algorithm/src/cn/cwblue/dp/Hanoi.java:13
↓ 1 callersMethodheapInsert
(int[] heap, int index)
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:54
↓ 1 callersMethodheapSort
(int[] arr)
data-structure-algorithm/src/cn/cwblue/heap/HeapSort.java:4
↓ 1 callersMethodheapify
(int[] heap, int index, int heapSize)
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:40
↓ 1 callersMethodinsert
(String word)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:25
↓ 1 callersMethodinsert
(String word)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:108
↓ 1 callersMethodisBalanced
(Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/IsBalancedTree.java:29
↓ 1 callersMethodisEmpty
()
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:80
↓ 1 callersMethodisFull
()
data-structure-algorithm/src/cn/cwblue/heap/Heap.java:84
↓ 1 callersMethodisMSumAwesome
(int num)
data-structure-algorithm/src/cn/cwblue/bruteforce/MSumToN.java:28
↓ 1 callersMethodisPalindrom1
(Node head)
data-structure-algorithm/src/cn/cwblue/linkedlist/IsPalindromList.java:20
↓ 1 callersMethodisPalindrom2
(Node head)
data-structure-algorithm/src/cn/cwblue/linkedlist/IsPalindromList.java:46
↓ 1 callersMethodlistPartition1
(Node head, int pivot)
data-structure-algorithm/src/cn/cwblue/linkedlist/SmallEqualBig.java:13
↓ 1 callersMethodlistPartition2
(Node head, int pivot)
data-structure-algorithm/src/cn/cwblue/linkedlist/SmallEqualBig.java:37
↓ 1 callersMethodmaxBits
(int[] arr)
data-structure-algorithm/src/cn/cwblue/sort/bucket/radix/RadixSort.java:14
↓ 1 callersMethodmaxWidthNoMap
(Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/TreeMaxWidth.java:53
↓ 1 callersMethodmerge
(int[] arr, int left, int mid, int right)
data-structure-algorithm/src/cn/cwblue/sort/merge/GetSmallSum.java:24
↓ 1 callersMethodmergeSort
(int[] arr)
data-structure-algorithm/src/cn/cwblue/sort/merge/MergeSort.java:9
↓ 1 callersMethodmergeSort2
(int[] arr)
data-structure-algorithm/src/cn/cwblue/sort/merge/MergeSort.java:45
↓ 1 callersMethodmidPreOrDownMidPre
(Node head)
data-structure-algorithm/src/cn/cwblue/linkedlist/LinkedListMid.java:60
↓ 1 callersMethodminBags
(int apple)
data-structure-algorithm/src/cn/cwblue/bruteforce/AppleMinBags.java:14
↓ 1 callersMethodnetherlandsFlag
(int[] arr, int num)
data-structure-algorithm/src/cn/cwblue/sort/quick/PartitionAndQuickSort.java:4
↓ 1 callersMethodnetherlandsFlag2
(int[] arr, int left, int right)
data-structure-algorithm/src/cn/cwblue/sort/quick/PartitionAndQuickSort.java:22
↓ 1 callersMethodnoLoop
(Node head1, Node head2)
data-structure-algorithm/src/cn/cwblue/linkedlist/FindFirstIntersectNode.java:71
↓ 1 callersMethodpartition
(int[] arr, int left, int right)
data-structure-algorithm/src/cn/cwblue/sort/quick/QuickSort.java:21
↓ 1 callersMethodpartition
(Node[] arr, int pivot)
data-structure-algorithm/src/cn/cwblue/linkedlist/SmallEqualBig.java:88
↓ 1 callersMethodpos2
(Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/RecursiveTraversalBT.java:82
↓ 1 callersMethodpos3
(Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/RecursiveTraversalBT.java:104
↓ 1 callersMethodpreBuild
(Queue<String> preQueue)
data-structure-algorithm/src/cn/cwblue/binarytree/SerializeAndReconstructTree.java:57
↓ 1 callersMethodprefixNum
(String word)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:65
↓ 1 callersMethodprefixNum
(String word)
data-structure-algorithm/src/cn/cwblue/tiretree/TrieTreeSearch.java:165
↓ 1 callersMethodpres
(Queue<String> queue, Node head)
data-structure-algorithm/src/cn/cwblue/binarytree/SerializeAndReconstructTree.java:34
↓ 1 callersMethodprintAllFolds
(int n)
data-structure-algorithm/src/cn/cwblue/binarytree/PaperFold.java:21
↓ 1 callersMethodprintEdge
(int[][] matrix, int firstRow, int firstColumn, int endRow, int endColumn)
data-structure-algorithm/src/cn/cwblue/matrix/PrintMatrixSpiralOrder.java:20
↓ 1 callersMethodprintMatrix
(int[][] matrix, int aRow, int aColumn, int bRow, int bColumn, boolean flag)
data-structure-algorithm/src/cn/cwblue/matrix/ZigzagPrintMatrix.java:35
next →1–100 of 231, ranked by callers