MCPcopy Create free account

hub / github.com/JsonChao/Awesome-Algorithm-Study / functions

Functions806 in github.com/JsonChao/Awesome-Algorithm-Study

↓ 1 callersMethodfindKthLargest
(int[] nums, int k)
data_struct_study/src/array_problem/Solution215.java:31
↓ 1 callersMethodfindPath
(TreeNode root, int sum)
data_struct_study/src/binary_search_tree_problem/Solution437.java:32
↓ 1 callersMethodfindRotation
(int[] nums, int a, int b)
data_struct_study/src/array_problem/Solution33.java:24
↓ 1 callersMethodflipColors
颜色翻转:在2-3树中的2节点添加一个新节点后会进行颜色翻转(flipColors),即根黑子红变为根红子黑。 @param node 当前子树的根节点
data_struct_study/src/red_black_tree/RBTree.java:144
↓ 1 callersMethodforward
(HashMap<Integer, Integer> countForNum, int num)
data_struct_study/src/array_problem/Solution128.java:23
↓ 1 callersMethodgenerateBSTString
生成以 root 为根节点的 BST 字符串 @param root Node @param deep Deep @param sb StringBuilder
data_struct_study/src/binary_search_tree/BST.java:486
↓ 1 callersMethodgenerateBroad
(int n, LinkedList<Integer> row)
data_struct_study/src/backstracking_problem/Solution51.java:62
↓ 1 callersMethodgenerateCombination
(int n, int k, int start, LinkedList<Integer> c)
data_struct_study/src/backstracking_problem/Solution77_2.java:29
↓ 1 callersMethodgenerateCombination
(int n, int k, int start, LinkedList<Integer> c)
data_struct_study/src/backstracking_problem/Solution77.java:29
↓ 1 callersMethodgenerateDepthString
(int depth)
data_struct_study/src/recursion/Solution5.java:65
↓ 1 callersMethodgenerateSquareList
(int n)
data_struct_study/src/dynamic_problem/Solution279.java:24
↓ 1 callersMethodget
(K k)
data_struct_study/src/hash_table/HashTable.java:80
↓ 1 callersMethodgetFirst
获取链表头部的元素 @return 链表头部的元素
data_struct_study/src/LinkedList/LinkedList.java:151
↓ 1 callersMethodgetFront
()
data_struct_study/src/heap_and_priority_queue/Solution.java:310
↓ 1 callersMethodgetMaxLength
(int[] nums, int index)
data_struct_study/src/dynamic_problem/Solution300.java:45
↓ 1 callersMethodgetSize
获取数组的大小
data_struct_study/src/queue/Array.java:82
↓ 1 callersMethodgetSize
()
data_struct_study/src/red_black_tree/RBTree.java:131
↓ 1 callersMethodgetSize
()
data_struct_study/src/map/LinkedListMap.java:108
↓ 1 callersMethodgetSize
()
data_struct_study/src/map/BSTMap.java:182
↓ 1 callersMethodgetSize
()
data_struct_study/src/avl/AVLTree.java:112
↓ 1 callersMethodgetSize
()
data_struct_study/src/avl/BST.java:28
↓ 1 callersMethodgetSize
获取数组的大小
data_struct_study/src/array/Array.java:100
↓ 1 callersMethodhashCode
()
data_struct_study/src/hash_table/Student.java:17
↓ 1 callersMethodhelper
(TreeNode node, Integer a, Integer b)
data_struct_study/src/binary_search_tree_problem/Solution98.java:26
↓ 1 callersMethodinArea
(int x, int y)
data_struct_study/src/backstracking_problem/Solution200.java:54
↓ 1 callersMethodinOrder
BST 中序遍历后的数据时升序的
data_struct_study/src/avl/AVLTree.java:101
↓ 1 callersMethodinOrder
(TreeNode root, int k)
data_struct_study/src/binary_search_tree_problem/Solution230.java:20
↓ 1 callersMethodisAccess
(int newX, int newY)
data_struct_study/src/backstracking_problem/Solution79.java:65
↓ 1 callersMethodisContains
(E e)
data_struct_study/src/set/BSTSet.java:23
↓ 1 callersMethodisEmpty
()
data_struct_study/src/heap_and_priority_queue/PriorityQueue.java:34
↓ 1 callersMethodisLeaf
(TreeNode node)
data_struct_study/src/binary_search_tree_problem/Solution404.java:22
↓ 1 callersMethodisPalindrome
(String s, int start, int end)
data_struct_study/src/backstracking_problem/Solution131.java:36
↓ 1 callersMethodisValid
(String s)
data_struct_study/src/stack_problem/Solution20.java:12
↓ 1 callersMethodlcs
(String s1, String s2, int m, int n)
data_struct_study/src/dynamic_problem/Solution1143.java:46
↓ 1 callersMethodleftRotate
node x / \ 左旋转 / \ T1 x ---------> node T3 / \ / \ T2 T3 T1 T2 @param
data_struct_study/src/red_black_tree/RBTree.java:185
↓ 1 callersMethodlengthOfLongestSubstring
(String s)
data_struct_study/src/array_problem/Solution3_3.java:14
↓ 1 callersMethodlengthOfLongestSubstring
(String s)
data_struct_study/src/array_problem/Solution3_2.java:15
↓ 1 callersMethodlengthOfLongestSubstring
(String s)
data_struct_study/src/array_problem/Solution3_4.java:18
↓ 1 callersMethodmajorityElement
(int[] nums)
data_struct_study/src/array_problem/Solution_2.java:20
↓ 1 callersMethodmatch
(Node cur, String word, int index)
data_struct_study/src/trie/WordDictionary.java:48
↓ 1 callersMethodmax3
(int a, int b, int c)
data_struct_study/src/dynamic_problem/Solution343_3.java:33
↓ 1 callersMethodmax3
(int a, int b, int c)
data_struct_study/src/dynamic_problem/Solution343.java:36
↓ 1 callersMethodmax3
(int a, int b, int c)
data_struct_study/src/dynamic_problem/Solution343_2.java:45
↓ 1 callersMethodmaxArea
(int[] height)
data_struct_study/src/array_problem/Solution11.java:19
↓ 1 callersMethodmaxDepth
(TreeNode root)
data_struct_study/src/binary_search_tree_problem/Solution110.java:23
↓ 1 callersMethodmaxLen
(HashMap<Integer, Integer> countForNum)
data_struct_study/src/array_problem/Solution128.java:38
↓ 1 callersMethodmaxProfit_k_inf
(int[] prices)
data_struct_study/src/dynamic_problem/Solution122.java:46
↓ 1 callersMethodmaxValue
获取最大值 @return 最大值
data_struct_study/src/binary_search_tree/BST.java:326
↓ 1 callersMethodmerge
(T[] nums, int l, int m, int h)
data_struct_study/src/sort_problem/MergeSort.java:14
↓ 1 callersMethodmerge
(ListNode[] lists, int left, int right)
data_struct_study/src/LinkedList_problem/Solution23.java:61
↓ 1 callersMethodmergeTwoLists
(ListNode l1, ListNode l2)
data_struct_study/src/LinkedList_problem/Solution23.java:75
↓ 1 callersMethodminNumberdisappered2
return the min number @param arr int整型一维数组 the array @return int整型
data_struct_study/src/array_problem/Solution_3.java:52
↓ 1 callersMethodminimum
(Node node)
data_struct_study/src/red_black_tree/RBTree.java:276
↓ 1 callersMethodminimum
(Node node)
data_struct_study/src/map/BSTMap.java:139
↓ 1 callersMethodminimum
(Node node)
data_struct_study/src/avl/AVLTree.java:266
↓ 1 callersMethodminimum
(Node node)
data_struct_study/src/avl/BST.java:93
↓ 1 callersMethodpartition
(T[] nums, int l, int h)
data_struct_study/src/sort_problem/QuickSort.java:49
↓ 1 callersMethodpartition
(T[] nums, int l, int h)
data_struct_study/src/sort_problem/QuickSelection.java:31
↓ 1 callersMethodpartition
(int[] nums, int l, int r)
data_struct_study/src/array_problem/Solution215.java:55
↓ 1 callersMethodpeek
()
data_struct_study/src/LinkedList/LinkedListStack.java:20
↓ 1 callersMethodpeek
()
data_struct_study/src/stack/ArrayStack.java:33
↓ 1 callersMethodpermute
(int[] nums)
data_struct_study/src/backstracking_problem/Solution46.java:14
↓ 1 callersMethodpermuteUnique
(int[] nums)
data_struct_study/src/backstracking_problem/Solution47.java:15
↓ 1 callersMethodpop
()
data_struct_study/src/LinkedList/LinkedListStack.java:15
↓ 1 callersMethodpreOrderSumNumbers
(TreeNode root, int sum)
data_struct_study/src/binary_search_tree_problem/Solution_1.java:32
↓ 1 callersMethodproductExceptSelf
(int[] nums)
data_struct_study/src/array_problem/Solution238.java:11
↓ 1 callersMethodpush
(E e)
data_struct_study/src/LinkedList/LinkedListStack.java:10
↓ 1 callersMethodputQueue
(int n, int index, LinkedList<Integer> row)
data_struct_study/src/backstracking_problem/Solution51.java:39
↓ 1 callersMethodquery
返回搜索区间 [queryL...queryR] 的值 @param queryL queryLeft @param queryR queryRight @return 搜索区间 [queryL...queryR] 的值
data_struct_study/src/segment_tree/NumArray.java:60
↓ 1 callersMethodqueryFirst
查询数组中第一个位置的元素 @return 数组中的元素
data_struct_study/src/queue/Array.java:166
↓ 1 callersMethodqueryLast
查询数组中最后一个位置的元素 @return 数组中的元素
data_struct_study/src/queue/Array.java:157
↓ 1 callersMethodrecursivelyCheck
(ListNode currentNode)
data_struct_study/src/LinkedList_problem/Solution_4_3.java:23
↓ 1 callersMethodremove
(K key)
data_struct_study/src/avl/AVLTree.java:288
↓ 1 callersMethodremoveElement
从链表中删除元素e @param e E
data_struct_study/src/LinkedList/LinkedList.java:231
↓ 1 callersMethodremoveElements
(ListNode head, int val)
data_struct_study/src/recursion/Solution.java:13
↓ 1 callersMethodremoveElements
(ListNode head, int val, int depth)
data_struct_study/src/recursion/Solution5.java:35
↓ 1 callersMethodremoveLast
()
data_struct_study/src/heap_and_priority_queue/Solution.java:132
↓ 1 callersMethodremoveMaxValue
删除最大节点 @return 最大节点
data_struct_study/src/binary_search_tree/BST.java:384
↓ 1 callersMethodremoveMin
(Node node)
data_struct_study/src/red_black_tree/RBTree.java:284
↓ 1 callersMethodremoveMin
(Node node)
data_struct_study/src/map/BSTMap.java:148
↓ 1 callersMethodremoveMin
(Node node)
data_struct_study/src/avl/BST.java:101
↓ 1 callersMethodrestoreIpAddresses
(String s)
data_struct_study/src/backstracking_problem/Solution93.java:25
↓ 1 callersMethodreverse
(int x)
data_struct_study/src/other_problem/Solution_1.java:17
↓ 1 callersMethodreverse
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution25.java:79
↓ 1 callersMethodreverseString
(String s)
data_struct_study/src/array_problem/Solution344.java:20
↓ 1 callersMethodrightNode
返回完全二叉树的数组表示中,一个节点的索引它所对应的右孩子节点的索引 @param index 某一个节点的索引 @return 一个节点的索引它所对应的右孩子节点的索引
data_struct_study/src/heap_and_priority_queue/MaxHeap.java:89
↓ 1 callersMethodrightRotate
node x / \ 右旋转 / \ x T2 -------> y node / \ / \ y T1 T1 T2
data_struct_study/src/red_black_tree/RBTree.java:161
↓ 1 callersMethodsearchWord
(char[][] board, String word, int index, int startX, int startY)
data_struct_study/src/backstracking_problem/Solution79.java:43
↓ 1 callersMethodset
(K key, V newValue)
data_struct_study/src/map/LinkedListMap.java:98
↓ 1 callersMethodset
(K key, V newValue)
data_struct_study/src/map/BSTMap.java:172
↓ 1 callersMethodset
(K k, V v)
data_struct_study/src/hash_table/HashTable.java:70
↓ 1 callersMethodshuffle
(T[] nums)
data_struct_study/src/sort_problem/QuickSort.java:38
↓ 1 callersMethodsiftUp
堆中元素的上浮 @param k 要上浮元素的 index 下标
data_struct_study/src/heap_and_priority_queue/MaxHeap.java:109
↓ 1 callersMethodsiftUp
(int k)
data_struct_study/src/heap_and_priority_queue/Solution.java:229
↓ 1 callersMethodsolve
(String s)
data_struct_study/src/stack_problem/Solution_2.java:22
↓ 1 callersMethodsort
(T[] nums)
data_struct_study/src/sort_problem/MergeSort.java:36
↓ 1 callersMethodsum
(int[] arr)
data_struct_study/src/recursion/Sum.java:5
↓ 1 callersMethodswap
(int[] nums, int k, int i)
data_struct_study/src/array_problem/Solution283_4.java:20
↓ 1 callersMethodswap
(int[] arr,int i,int j)
data_struct_study/src/array_problem/Solution_3.java:73
↓ 1 callersMethodswap
(int[] nums, int k, int i)
data_struct_study/src/array_problem/Solution283_3.java:20
← previousnext →201–300 of 806, ranked by callers