Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/JsonChao/Awesome-Algorithm-Study
/ functions
Functions
806 in github.com/JsonChao/Awesome-Algorithm-Study
⨍
Functions
806
◇
Types & classes
394
↓ 1 callers
Method
findKthLargest
(int[] nums, int k)
data_struct_study/src/array_problem/Solution215.java:31
↓ 1 callers
Method
findPath
(TreeNode root, int sum)
data_struct_study/src/binary_search_tree_problem/Solution437.java:32
↓ 1 callers
Method
findRotation
(int[] nums, int a, int b)
data_struct_study/src/array_problem/Solution33.java:24
↓ 1 callers
Method
flipColors
颜色翻转:在2-3树中的2节点添加一个新节点后会进行颜色翻转(flipColors),即根黑子红变为根红子黑。 @param node 当前子树的根节点
data_struct_study/src/red_black_tree/RBTree.java:144
↓ 1 callers
Method
forward
(HashMap<Integer, Integer> countForNum, int num)
data_struct_study/src/array_problem/Solution128.java:23
↓ 1 callers
Method
generateBSTString
生成以 root 为根节点的 BST 字符串 @param root Node @param deep Deep @param sb StringBuilder
data_struct_study/src/binary_search_tree/BST.java:486
↓ 1 callers
Method
generateBroad
(int n, LinkedList<Integer> row)
data_struct_study/src/backstracking_problem/Solution51.java:62
↓ 1 callers
Method
generateCombination
(int n, int k, int start, LinkedList<Integer> c)
data_struct_study/src/backstracking_problem/Solution77_2.java:29
↓ 1 callers
Method
generateCombination
(int n, int k, int start, LinkedList<Integer> c)
data_struct_study/src/backstracking_problem/Solution77.java:29
↓ 1 callers
Method
generateDepthString
(int depth)
data_struct_study/src/recursion/Solution5.java:65
↓ 1 callers
Method
generateSquareList
(int n)
data_struct_study/src/dynamic_problem/Solution279.java:24
↓ 1 callers
Method
get
(K k)
data_struct_study/src/hash_table/HashTable.java:80
↓ 1 callers
Method
getFirst
获取链表头部的元素 @return 链表头部的元素
data_struct_study/src/LinkedList/LinkedList.java:151
↓ 1 callers
Method
getFront
()
data_struct_study/src/heap_and_priority_queue/Solution.java:310
↓ 1 callers
Method
getMaxLength
(int[] nums, int index)
data_struct_study/src/dynamic_problem/Solution300.java:45
↓ 1 callers
Method
getSize
获取数组的大小
data_struct_study/src/queue/Array.java:82
↓ 1 callers
Method
getSize
()
data_struct_study/src/red_black_tree/RBTree.java:131
↓ 1 callers
Method
getSize
()
data_struct_study/src/map/LinkedListMap.java:108
↓ 1 callers
Method
getSize
()
data_struct_study/src/map/BSTMap.java:182
↓ 1 callers
Method
getSize
()
data_struct_study/src/avl/AVLTree.java:112
↓ 1 callers
Method
getSize
()
data_struct_study/src/avl/BST.java:28
↓ 1 callers
Method
getSize
获取数组的大小
data_struct_study/src/array/Array.java:100
↓ 1 callers
Method
hashCode
()
data_struct_study/src/hash_table/Student.java:17
↓ 1 callers
Method
helper
(TreeNode node, Integer a, Integer b)
data_struct_study/src/binary_search_tree_problem/Solution98.java:26
↓ 1 callers
Method
inArea
(int x, int y)
data_struct_study/src/backstracking_problem/Solution200.java:54
↓ 1 callers
Method
inOrder
BST 中序遍历后的数据时升序的
data_struct_study/src/avl/AVLTree.java:101
↓ 1 callers
Method
inOrder
(TreeNode root, int k)
data_struct_study/src/binary_search_tree_problem/Solution230.java:20
↓ 1 callers
Method
isAccess
(int newX, int newY)
data_struct_study/src/backstracking_problem/Solution79.java:65
↓ 1 callers
Method
isContains
(E e)
data_struct_study/src/set/BSTSet.java:23
↓ 1 callers
Method
isEmpty
()
data_struct_study/src/heap_and_priority_queue/PriorityQueue.java:34
↓ 1 callers
Method
isLeaf
(TreeNode node)
data_struct_study/src/binary_search_tree_problem/Solution404.java:22
↓ 1 callers
Method
isPalindrome
(String s, int start, int end)
data_struct_study/src/backstracking_problem/Solution131.java:36
↓ 1 callers
Method
isValid
(String s)
data_struct_study/src/stack_problem/Solution20.java:12
↓ 1 callers
Method
lcs
(String s1, String s2, int m, int n)
data_struct_study/src/dynamic_problem/Solution1143.java:46
↓ 1 callers
Method
leftRotate
node x / \ 左旋转 / \ T1 x ---------> node T3 / \ / \ T2 T3 T1 T2 @param
data_struct_study/src/red_black_tree/RBTree.java:185
↓ 1 callers
Method
lengthOfLongestSubstring
(String s)
data_struct_study/src/array_problem/Solution3_3.java:14
↓ 1 callers
Method
lengthOfLongestSubstring
(String s)
data_struct_study/src/array_problem/Solution3_2.java:15
↓ 1 callers
Method
lengthOfLongestSubstring
(String s)
data_struct_study/src/array_problem/Solution3_4.java:18
↓ 1 callers
Method
majorityElement
(int[] nums)
data_struct_study/src/array_problem/Solution_2.java:20
↓ 1 callers
Method
match
(Node cur, String word, int index)
data_struct_study/src/trie/WordDictionary.java:48
↓ 1 callers
Method
max3
(int a, int b, int c)
data_struct_study/src/dynamic_problem/Solution343_3.java:33
↓ 1 callers
Method
max3
(int a, int b, int c)
data_struct_study/src/dynamic_problem/Solution343.java:36
↓ 1 callers
Method
max3
(int a, int b, int c)
data_struct_study/src/dynamic_problem/Solution343_2.java:45
↓ 1 callers
Method
maxArea
(int[] height)
data_struct_study/src/array_problem/Solution11.java:19
↓ 1 callers
Method
maxDepth
(TreeNode root)
data_struct_study/src/binary_search_tree_problem/Solution110.java:23
↓ 1 callers
Method
maxLen
(HashMap<Integer, Integer> countForNum)
data_struct_study/src/array_problem/Solution128.java:38
↓ 1 callers
Method
maxProfit_k_inf
(int[] prices)
data_struct_study/src/dynamic_problem/Solution122.java:46
↓ 1 callers
Method
maxValue
获取最大值 @return 最大值
data_struct_study/src/binary_search_tree/BST.java:326
↓ 1 callers
Method
merge
(T[] nums, int l, int m, int h)
data_struct_study/src/sort_problem/MergeSort.java:14
↓ 1 callers
Method
merge
(ListNode[] lists, int left, int right)
data_struct_study/src/LinkedList_problem/Solution23.java:61
↓ 1 callers
Method
mergeTwoLists
(ListNode l1, ListNode l2)
data_struct_study/src/LinkedList_problem/Solution23.java:75
↓ 1 callers
Method
minNumberdisappered2
return the min number @param arr int整型一维数组 the array @return int整型
data_struct_study/src/array_problem/Solution_3.java:52
↓ 1 callers
Method
minimum
(Node node)
data_struct_study/src/red_black_tree/RBTree.java:276
↓ 1 callers
Method
minimum
(Node node)
data_struct_study/src/map/BSTMap.java:139
↓ 1 callers
Method
minimum
(Node node)
data_struct_study/src/avl/AVLTree.java:266
↓ 1 callers
Method
minimum
(Node node)
data_struct_study/src/avl/BST.java:93
↓ 1 callers
Method
partition
(T[] nums, int l, int h)
data_struct_study/src/sort_problem/QuickSort.java:49
↓ 1 callers
Method
partition
(T[] nums, int l, int h)
data_struct_study/src/sort_problem/QuickSelection.java:31
↓ 1 callers
Method
partition
(int[] nums, int l, int r)
data_struct_study/src/array_problem/Solution215.java:55
↓ 1 callers
Method
peek
()
data_struct_study/src/LinkedList/LinkedListStack.java:20
↓ 1 callers
Method
peek
()
data_struct_study/src/stack/ArrayStack.java:33
↓ 1 callers
Method
permute
(int[] nums)
data_struct_study/src/backstracking_problem/Solution46.java:14
↓ 1 callers
Method
permuteUnique
(int[] nums)
data_struct_study/src/backstracking_problem/Solution47.java:15
↓ 1 callers
Method
pop
()
data_struct_study/src/LinkedList/LinkedListStack.java:15
↓ 1 callers
Method
preOrderSumNumbers
(TreeNode root, int sum)
data_struct_study/src/binary_search_tree_problem/Solution_1.java:32
↓ 1 callers
Method
productExceptSelf
(int[] nums)
data_struct_study/src/array_problem/Solution238.java:11
↓ 1 callers
Method
push
(E e)
data_struct_study/src/LinkedList/LinkedListStack.java:10
↓ 1 callers
Method
putQueue
(int n, int index, LinkedList<Integer> row)
data_struct_study/src/backstracking_problem/Solution51.java:39
↓ 1 callers
Method
query
返回搜索区间 [queryL...queryR] 的值 @param queryL queryLeft @param queryR queryRight @return 搜索区间 [queryL...queryR] 的值
data_struct_study/src/segment_tree/NumArray.java:60
↓ 1 callers
Method
queryFirst
查询数组中第一个位置的元素 @return 数组中的元素
data_struct_study/src/queue/Array.java:166
↓ 1 callers
Method
queryLast
查询数组中最后一个位置的元素 @return 数组中的元素
data_struct_study/src/queue/Array.java:157
↓ 1 callers
Method
recursivelyCheck
(ListNode currentNode)
data_struct_study/src/LinkedList_problem/Solution_4_3.java:23
↓ 1 callers
Method
remove
(K key)
data_struct_study/src/avl/AVLTree.java:288
↓ 1 callers
Method
removeElement
从链表中删除元素e @param e E
data_struct_study/src/LinkedList/LinkedList.java:231
↓ 1 callers
Method
removeElements
(ListNode head, int val)
data_struct_study/src/recursion/Solution.java:13
↓ 1 callers
Method
removeElements
(ListNode head, int val, int depth)
data_struct_study/src/recursion/Solution5.java:35
↓ 1 callers
Method
removeLast
()
data_struct_study/src/heap_and_priority_queue/Solution.java:132
↓ 1 callers
Method
removeMaxValue
删除最大节点 @return 最大节点
data_struct_study/src/binary_search_tree/BST.java:384
↓ 1 callers
Method
removeMin
(Node node)
data_struct_study/src/red_black_tree/RBTree.java:284
↓ 1 callers
Method
removeMin
(Node node)
data_struct_study/src/map/BSTMap.java:148
↓ 1 callers
Method
removeMin
(Node node)
data_struct_study/src/avl/BST.java:101
↓ 1 callers
Method
restoreIpAddresses
(String s)
data_struct_study/src/backstracking_problem/Solution93.java:25
↓ 1 callers
Method
reverse
(int x)
data_struct_study/src/other_problem/Solution_1.java:17
↓ 1 callers
Method
reverse
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution25.java:79
↓ 1 callers
Method
reverseString
(String s)
data_struct_study/src/array_problem/Solution344.java:20
↓ 1 callers
Method
rightNode
返回完全二叉树的数组表示中,一个节点的索引它所对应的右孩子节点的索引 @param index 某一个节点的索引 @return 一个节点的索引它所对应的右孩子节点的索引
data_struct_study/src/heap_and_priority_queue/MaxHeap.java:89
↓ 1 callers
Method
rightRotate
node x / \ 右旋转 / \ x T2 -------> y node / \ / \ y T1 T1 T2
data_struct_study/src/red_black_tree/RBTree.java:161
↓ 1 callers
Method
searchWord
(char[][] board, String word, int index, int startX, int startY)
data_struct_study/src/backstracking_problem/Solution79.java:43
↓ 1 callers
Method
set
(K key, V newValue)
data_struct_study/src/map/LinkedListMap.java:98
↓ 1 callers
Method
set
(K key, V newValue)
data_struct_study/src/map/BSTMap.java:172
↓ 1 callers
Method
set
(K k, V v)
data_struct_study/src/hash_table/HashTable.java:70
↓ 1 callers
Method
shuffle
(T[] nums)
data_struct_study/src/sort_problem/QuickSort.java:38
↓ 1 callers
Method
siftUp
堆中元素的上浮 @param k 要上浮元素的 index 下标
data_struct_study/src/heap_and_priority_queue/MaxHeap.java:109
↓ 1 callers
Method
siftUp
(int k)
data_struct_study/src/heap_and_priority_queue/Solution.java:229
↓ 1 callers
Method
solve
(String s)
data_struct_study/src/stack_problem/Solution_2.java:22
↓ 1 callers
Method
sort
(T[] nums)
data_struct_study/src/sort_problem/MergeSort.java:36
↓ 1 callers
Method
sum
(int[] arr)
data_struct_study/src/recursion/Sum.java:5
↓ 1 callers
Method
swap
(int[] nums, int k, int i)
data_struct_study/src/array_problem/Solution283_4.java:20
↓ 1 callers
Method
swap
(int[] arr,int i,int j)
data_struct_study/src/array_problem/Solution_3.java:73
↓ 1 callers
Method
swap
(int[] nums, int k, int i)
data_struct_study/src/array_problem/Solution283_3.java:20
← previous
next →
201–300 of 806, ranked by callers