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
Method
remove
删除指定的节点 @param e E
data_struct_study/src/binary_search_tree/BST.java:413
Method
remove
(K key)
data_struct_study/src/red_black_tree/RBTree.java:298
Method
remove
(K key)
data_struct_study/src/map/LinkedListMap.java:66
Method
remove
(K key)
data_struct_study/src/map/BSTMap.java:84
Method
remove
(E e)
data_struct_study/src/set/BSTSet.java:18
Method
remove
(E e)
data_struct_study/src/set/LinkedListSet.java:48
Method
remove
(K k)
data_struct_study/src/hash_table/HashTable.java:55
Method
remove
(K key)
data_struct_study/src/avl/BST.java:115
Method
removeElement
(E e)
data_struct_study/src/heap_and_priority_queue/Solution.java:137
Method
removeElements
(ListNode head, int val)
data_struct_study/src/recursion/Solution2.java:8
Method
removeElements
(ListNode head, int val)
data_struct_study/src/recursion/Solution4.java:5
Method
removeElements
(ListNode head, int val)
data_struct_study/src/recursion/Solution3.java:8
Method
removeElements
(ListNode head, int val)
data_struct_study/src/LinkedList_problem/Solution203.java:21
Method
removeFirst
()
data_struct_study/src/heap_and_priority_queue/Solution.java:127
Method
removeMin
(Node node)
data_struct_study/src/avl/AVLTree.java:274
Method
removeNthFromEnd
(ListNode head, int n)
data_struct_study/src/LinkedList_problem/Solution19_2.java:14
Method
removeNthFromEnd
(ListNode head, int n)
data_struct_study/src/LinkedList_problem/Solution19.java:15
Method
replace
替换堆中最大的元素 @param e e @return 堆中最大的元素
data_struct_study/src/heap_and_priority_queue/MaxHeap.java:185
Method
replace
(E e)
data_struct_study/src/heap_and_priority_queue/Solution.java:274
Method
reverseKGroup
(ListNode head, int k)
data_struct_study/src/LinkedList_problem/Solution25.java:26
Method
reverseList
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution206.java:27
Method
reverseList
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution206_2.java:22
Method
reverseVowels
(String s)
data_struct_study/src/array_problem/Solution345.java:29
Method
rightChild
(int index)
data_struct_study/src/heap_and_priority_queue/Solution.java:219
Method
rightSideView
(TreeNode root)
data_struct_study/src/queue_problem/Solution199.java:44
Method
rightSideView2
(TreeNode root)
data_struct_study/src/queue_problem/Solution199.java:89
Method
rob
(int[] nums)
data_struct_study/src/dynamic_problem/Solution198.java:18
Method
rob
(int[] nums)
data_struct_study/src/dynamic_problem/Solution198_3.java:14
Method
rob
(int[] nums)
data_struct_study/src/dynamic_problem/Solution198_6.java:8
Method
rob
(int[] nums)
data_struct_study/src/dynamic_problem/Solution198_5.java:14
Method
rob
(int[] nums)
data_struct_study/src/dynamic_problem/Solution198_2.java:10
Method
rob
(int[] nums)
data_struct_study/src/dynamic_problem/Solution213.java:5
Method
rob
(int[] nums)
data_struct_study/src/dynamic_problem/Solution198_7.java:14
Method
rob
(TreeNode root)
data_struct_study/src/dynamic_problem/Solution337.java:12
Method
rob
(int[] nums)
data_struct_study/src/dynamic_problem/Solution198_4.java:5
Method
rob
(int[] nums)
data_struct_study/src/binary_search_tree_problem/Solution198_8.java:10
Method
search
Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter.
data_struct_study/src/trie/WordDictionary.java:44
Method
search
Returns if the word is in the trie.
data_struct_study/src/trie/Trie206.java:44
Method
search
(int[] nums, int target)
data_struct_study/src/array_problem/Solution33.java:12
Method
select
(T[] nums, int k)
data_struct_study/src/sort_problem/QuickSelection.java:13
Method
set
修改链表指定位置的元素 @param index 链表指定位置 @param e 链表指定位置的元素
data_struct_study/src/LinkedList/LinkedList.java:170
Method
set
将 index 的值更新为 e @param index index @param e E
data_struct_study/src/segment_tree/NumArray.java:111
Method
set
将 index 的值更新为 e @param index index @param e E
data_struct_study/src/segment_tree/SegmentTree.java:143
Method
set
修改数组中指定位置的元素
data_struct_study/src/queue/Array.java:187
Method
set
(int index, E e)
data_struct_study/src/heap_and_priority_queue/Solution.java:86
Method
set
修改数组中指定位置的元素
data_struct_study/src/array/Array.java:205
Method
setCode
(int code)
data_struct_study/src/other_problem/Solution_2.java:34
Method
setMsg
(String msg)
data_struct_study/src/other_problem/Solution_2.java:42
Method
singleNumber
(int[] nums)
data_struct_study/src/other_problem/Solution136.java:8
Method
solve
(char[][] board)
data_struct_study/src/backstracking_problem/Solution130.java:12
Method
solveNQueens
(int n)
data_struct_study/src/backstracking_problem/Solution51.java:26
Method
sort
(T[] nums)
data_struct_study/src/sort_problem/Bubble.java:9
Method
sort
(T[] nums)
data_struct_study/src/sort_problem/Selection.java:12
Method
sort
(T[] nums)
data_struct_study/src/sort_problem/Insertion.java:19
Method
sort
(T[] nums)
data_struct_study/src/sort_problem/Shell.java:17
Method
sort
(T[] nums)
data_struct_study/src/sort_problem/QuickSort.java:22
Method
sort
(T[] nums)
data_struct_study/src/sort_problem/QuickSelection.java:45
Method
sort
数组第 0 个位置不能有元素
data_struct_study/src/sort_problem/HeapSort.java:34
Method
sort
(T[] nums, int l, int h)
data_struct_study/src/sort_problem/ThreeWayQuickSort.java:20
Method
sortColors
(int[] nums)
data_struct_study/src/array_problem/Solution75.java:31
Method
sortColors
(int[] nums)
data_struct_study/src/array_problem/Solution75_2.java:10
Method
sortInList
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution_2.java:13
Method
sortList
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution148.java:8
Method
sortedArrayToBST
(int[] nums)
data_struct_study/src/binary_search_tree_problem/Solution108.java:15
Method
startsWith
Returns if there is any word in the trie that starts with the given prefix.
data_struct_study/src/trie/Trie206.java:59
Method
subsets
(int[] nums)
data_struct_study/src/backstracking_problem/Solution78.java:11
Method
subsetsWithDup
(int[] nums)
data_struct_study/src/backstracking_problem/Solution90.java:9
Method
sum
给用户调用的函数 @param arr 数组 @return 数组的和
data_struct_study/src/recursion/Main.java:32
Method
sum
(String prefix)
data_struct_study/src/trie/MapSum.java:42
Method
sumNumbers
(TreeNode root)
data_struct_study/src/binary_search_tree_problem/Solution_1.java:23
Method
sumOfLeftLeaves
(TreeNode root)
data_struct_study/src/binary_search_tree_problem/Solution404.java:12
Method
sumRange
(int i, int j)
data_struct_study/src/segment_tree/NumArray.java:235
Method
sumRange
(int i, int j)
data_struct_study/src/segment_tree/NumArray3.java:29
Method
sumRange
(int i, int j)
data_struct_study/src/segment_tree/NumArray2.java:18
Method
swap
(int i, int j)
data_struct_study/src/array/Array.java:303
Method
swapPairs
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution24.java:11
Method
threeSum
(int[] nums)
data_struct_study/src/hash_table_problem/Solution15.java:22
Method
toString
()
data_struct_study/src/LinkedList/LinkedListQueue.java:28
Method
toString
()
data_struct_study/src/LinkedList/LinkedListStack.java:35
Method
toString
()
data_struct_study/src/LinkedList/LinkedList.java:50
Method
toString
()
data_struct_study/src/segment_tree/NumArray.java:190
Method
toString
()
data_struct_study/src/stack/ArrayStack.java:48
Method
toString
()
data_struct_study/src/queue/LoopQueue.java:108
Method
toString
()
data_struct_study/src/queue/Array.java:285
Method
toString
()
data_struct_study/src/queue/ArrayQueue.java:46
Method
toString
()
data_struct_study/src/map/LinkedListMap.java:29
Method
toString
()
data_struct_study/src/array/Student.java:13
Method
toString
()
data_struct_study/src/LinkedList_problem/ListNode.java:30
Method
top
()
data_struct_study/src/stack_problem/Solution155.java:42
Method
topKFrequent
(int[] nums, int k)
data_struct_study/src/heap_and_priority_queue/Solution2.java:23
Method
topKFrequent
(int[] nums, int k)
data_struct_study/src/queue_problem/Solution347.java:69
Method
trap
(int[] height)
data_struct_study/src/array_problem/Solution42.java:12
Method
twoSum
(int[] nums, int target)
data_struct_study/src/hash_table_problem/Solution1.java:17
Method
unionElements
(int p, int q)
data_struct_study/src/union_find/UnionFind3.java:54
Method
unionElements
(int p, int q)
data_struct_study/src/union_find/UnionFind1.java:34
Method
unionElements
(int p, int q)
data_struct_study/src/union_find/UnionFind6.java:62
Method
unionElements
(int p, int q)
data_struct_study/src/union_find/UnionFind5.java:58
Method
unionElements
(int p, int q)
data_struct_study/src/union_find/UF.java:9
Method
unionElements
(int p, int q)
data_struct_study/src/union_find/UnionFind4.java:54
Method
unionElements
(int p, int q)
data_struct_study/src/union_find/UnionFind2.java:43
← previous
next →
701–800 of 806, ranked by callers