MCPcopy Create free account

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

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

⨍ Functions 806◇ Types & classes 394
↓ 2 callersMethodaddLast
(E e)
data_struct_study/src/heap_and_priority_queue/Solution.java:69
↓ 2 callersMethodbuildStack
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution445.java:60
↓ 2 callersMethodcontains
(K k)
data_struct_study/src/hash_table/HashTable.java:36
↓ 2 callersMethodcontains
数组中是否包含某元素 @return 是否包含某元素
data_struct_study/src/array/Array.java:219
↓ 2 callersMethoddeleteElement
删除数组中指定的元素 @param e 被删除的元素 @return 是否删除成功
data_struct_study/src/array/Array.java:266
↓ 2 callersMethoddeleteLast
删除数组中最后的元素 @return 被删除的元素
data_struct_study/src/queue/Array.java:238
↓ 2 callersMethoddequeue
()
data_struct_study/src/heap_and_priority_queue/Solution.java:320
↓ 2 callersMethodenqueue
(E e)
data_struct_study/src/heap_and_priority_queue/Solution.java:315
↓ 2 callersMethodexpand
(String s, int l, int r)
data_struct_study/src/array_problem/Solution5.java:23
↓ 2 callersMethodextractMax
获取堆中最大元素 @return 堆中最大元素
data_struct_study/src/heap_and_priority_queue/MaxHeap.java:137
↓ 2 callersMethodfirstCharacterIndex
(String s, int start)
data_struct_study/src/set/FileOperation.java:66
↓ 2 callersMethodfirstCharacterIndex
(String s, int start)
data_struct_study/src/avl/FileOperation.java:62
↓ 2 callersMethodgenerateString
生成二叉树深度描述字符串 -- 表示深度为1 ---- 表示深度为 2 依次类推 @param deep Deep @return 二叉树深度描述字符串
data_struct_study/src/binary_search_tree/BST.java:507
↓ 2 callersMethodget
查询链表中指定节点的元素 @param index 指定节点的下标 @return 指定节点的元素
data_struct_study/src/LinkedList/LinkedList.java:133
↓ 2 callersMethodgetSize
()
data_struct_study/src/heap_and_priority_queue/Solution.java:300
↓ 2 callersMethodgetSize
()
data_struct_study/src/set/LinkedListSet.java:58
↓ 2 callersMethodisBSTTree
()
data_struct_study/src/avl/AVLTree.java:68
↓ 2 callersMethodisBalance
()
data_struct_study/src/avl/AVLTree.java:81
↓ 2 callersMethodisContains
(E e)
data_struct_study/src/set/Set.java:9
↓ 2 callersMethodisEmpty
()
data_struct_study/src/binary_search_tree/BST.java:106
↓ 2 callersMethodisEmpty
()
data_struct_study/src/stack/ArrayStack.java:43
↓ 2 callersMethodisEmpty
队列为空时，front 与 tail 都指向同一处 @return 队列是否为空
data_struct_study/src/queue/LoopQueue.java:38
↓ 2 callersMethodisEmpty
()
data_struct_study/src/set/Set.java:13
↓ 2 callersMethodisEnglishLetter
(char ch)
data_struct_study/src/set/FileOperation.java:61
↓ 2 callersMethodleftChild
(int index)
data_struct_study/src/heap_and_priority_queue/Solution.java:214
↓ 2 callersMethodleftNode
返回完全二叉树的数组表示中，一个节点的索引它所对应的左孩子节点的索引 @param index 某一个节点的索引 @return 一个节点的索引它所对应的左孩子节点的索引
data_struct_study/src/heap_and_priority_queue/MaxHeap.java:79
↓ 2 callersMethodless
(T[] nums, int i, int j)
data_struct_study/src/sort_problem/HeapSort.java:76
↓ 2 callersMethodmakeRecently
(int key)
data_struct_study/src/other_problem/Solution146.java:60
↓ 2 callersMethodminValue
获取最小值 @return 最小值
data_struct_study/src/binary_search_tree/BST.java:297
↓ 2 callersMethodnumSquares
(int n)
data_struct_study/src/queue_problem/Solution279_2.java:13
↓ 2 callersMethodpop
()
data_struct_study/src/stack/ArrayStack.java:28
↓ 2 callersMethodpush
(E e)
data_struct_study/src/stack/ArrayStack.java:23
↓ 2 callersMethodquery
查询数组中指定位置的元素 @return 数组中的元素
data_struct_study/src/array/Array.java:193
↓ 2 callersMethodremove
(E e)
data_struct_study/src/set/Set.java:7
↓ 2 callersMethodremoveMinValue
删除最小节点 @return 被删除的最小值
data_struct_study/src/binary_search_tree/BST.java:355
↓ 2 callersMethodresize
(int newCapacity)
data_struct_study/src/queue/LoopQueue.java:62
↓ 2 callersMethodresize
扩容/缩容 时间复杂度：O（n） @param capacity
data_struct_study/src/queue/Array.java:144
↓ 2 callersMethodresize
(int newCapacity)
data_struct_study/src/heap_and_priority_queue/Solution.java:169
↓ 2 callersMethodresize
(int newCapacity)
data_struct_study/src/hash_table/HashTable.java:84
↓ 2 callersMethodresize
扩容/缩容 时间复杂度：O（n） @param capacity
data_struct_study/src/array/Array.java:162
↓ 2 callersMethodreverseList
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution_4_4.java:41
↓ 2 callersMethodsink
(T[] nums, int k, int N)
data_struct_study/src/sort_problem/HeapSort.java:54
↓ 2 callersMethodswap
(int[] nums, int i, int j)
data_struct_study/src/array_problem/Solution75_2.java:30
↓ 2 callersMethodswap
(int[] nums, int i, int j)
data_struct_study/src/array_problem/Solution215.java:84
↓ 2 callersMethodtestHeap
(Integer[] testData, boolean isHeapify)
data_struct_study/src/heap_and_priority_queue/Main.java:66
↓ 2 callersMethodtestSet
(Set<String> set, String filename)
data_struct_study/src/set/Main2.java:7
↓ 2 callersMethodtryRob
(int[] nums, int first, int last)
data_struct_study/src/dynamic_problem/Solution213.java:20
↓ 1 callersMethodFindNumsAppearOnce
(int[] nums, int num1[], int num2[])
data_struct_study/src/array_problem/Solution_1.java:16
↓ 1 callersMethodadd
(String s, int count1, int count2, int n)
data_struct_study/src/backstracking_problem/Solution22.java:18
↓ 1 callersMethodadd
(K key, V value)
data_struct_study/src/map/LinkedListMap.java:55
↓ 1 callersMethodadd
(K key, V value)
data_struct_study/src/map/BSTMap.java:42
↓ 1 callersMethodadd
(K k, V v)
data_struct_study/src/hash_table/HashTable.java:40
↓ 1 callersMethodadd
(String word)
data_struct_study/src/trie/Trie3.java:34
↓ 1 callersMethodadd
(String word)
data_struct_study/src/trie/Trie2.java:37
↓ 1 callersMethodadd
向 trie 中添加一个新的单词 @param word 单词
data_struct_study/src/trie/Trie.java:59
↓ 1 callersMethodaddFirst
向数组开始添加一个元素 时间复杂度：O（n）
data_struct_study/src/queue/Array.java:105
↓ 1 callersMethodbackTracing
(int start, int size, boolean[] visited, List<Integer> tempSubset, List<List<Integer>> subsets, int[] nums)
data_struct_study/src/backstracking_problem/Solution90.java:23
↓ 1 callersMethodbackTracing
(int start, int size, List<Integer> tempSubset, List<List<Integer>> subsets, int[] nums)
data_struct_study/src/backstracking_problem/Solution78.java:23
↓ 1 callersMethodbackTracing
(String s, List<String> tempPartition, List<List<String>> partitions)
data_struct_study/src/backstracking_problem/Solution131.java:20
↓ 1 callersMethodbacktracking
(int k, int n, int start, List<Integer> tempCombination, List<List<Integer>> combinations)
data_struct_study/src/backstracking_problem/Solution216.java:17
↓ 1 callersMethodbacktracking
(List<Integer> permuteList, List<List<Integer>> permutes, boolean[] visited, int[] nums)
data_struct_study/src/backstracking_problem/Solution47.java:32
↓ 1 callersMethodbacktracking
(List<Integer> permuteList, List<List<Integer>> permutes, boolean[] visited, int[] nums)
data_struct_study/src/backstracking_problem/Solution46.java:28
↓ 1 callersMethodbacktracking
(List<Integer> tempCombination, List<List<Integer>> combinations, boolean[] visited, int start, int target, in
data_struct_study/src/backstracking_problem/Solution40.java:20
↓ 1 callersMethodbacktracking
(ArrayList<Integer> tempCombination, List<List<Integer>> combinations, int start, int target, int[] candidates
data_struct_study/src/backstracking_problem/Solution39.java:15
↓ 1 callersMethodbinarySearch
(int[] arr, int l, int r, int target)
data_struct_study/src/array_problem/Solution167_2.java:33
↓ 1 callersMethodbreakInteger
(int n)
data_struct_study/src/dynamic_problem/Solution343.java:23
↓ 1 callersMethodbreakInteger
(int n)
data_struct_study/src/dynamic_problem/Solution343_2.java:27
↓ 1 callersMethodbuildSegmentTree
在 treeIndex 的位置创建表示区间 [l...r] 的线段树 @param treeIndex treeIndex 位置 @param l left index @param r right index
data_struct_study/src/segment_tree/NumArray.java:36
↓ 1 callersMethodbuildSegmentTree
在 treeIndex 的位置创建表示区间 [l...r] 的线段树 @param treeIndex treeIndex 位置 @param l left index @param r right index
data_struct_study/src/segment_tree/SegmentTree.java:68
↓ 1 callersMethodcalcWays
(int n)
data_struct_study/src/dynamic_problem/Solution70.java:26
↓ 1 callersMethodcontains
(K key)
data_struct_study/src/map/LinkedListMap.java:87
↓ 1 callersMethodcontains
(K key)
data_struct_study/src/map/BSTMap.java:161
↓ 1 callersMethodcontains
(String word)
data_struct_study/src/trie/Trie3.java:51
↓ 1 callersMethodcontains
(String word)
data_struct_study/src/trie/Trie2.java:54
↓ 1 callersMethodcontains
判断单词 word 是否包含在 Trie 中 @param word 单词 @return 单词 word 是否包含在 Trie 中
data_struct_study/src/trie/Trie.java:84
↓ 1 callersMethodcountSum
(int[] nums)
data_struct_study/src/dynamic_problem/Solution494.java:35
↓ 1 callersMethoddeleteFirst
删除数组中最开始的元素 @return 被删除的元素
data_struct_study/src/queue/Array.java:229
↓ 1 callersMethoddeleteFirst
删除数组中最开始的元素 @return 被删除的元素
data_struct_study/src/array/Array.java:247
↓ 1 callersMethoddeleteLast
删除数组中最后的元素 @return 被删除的元素
data_struct_study/src/array/Array.java:256
↓ 1 callersMethoddequeue
()
data_struct_study/src/LinkedList/LinkedListQueue.java:58
↓ 1 callersMethoddequeue
()
data_struct_study/src/queue/LoopQueue.java:74
↓ 1 callersMethoddequeue
()
data_struct_study/src/queue/ArrayQueue.java:26
↓ 1 callersMethoddequeue
()
data_struct_study/src/heap_and_priority_queue/Solution.java:288
↓ 1 callersMethoddfs
(String s, int segId, int segStart)
data_struct_study/src/backstracking_problem/Solution93.java:32
↓ 1 callersMethoddfs
(char[][] grid, int x, int y)
data_struct_study/src/backstracking_problem/Solution200.java:40
↓ 1 callersMethoddfs
(TreeNode root, int depth)
data_struct_study/src/queue_problem/Solution199.java:94
↓ 1 callersMethoddfs
(int[][] M, int i, boolean[] visited)
data_struct_study/src/array_problem/Solution547.java:23
↓ 1 callersMethoddfs
(int[][] grid, int i, int j)
data_struct_study/src/array_problem/Solution695.java:26
↓ 1 callersMethoddis
(int[] point1, int[] point2)
data_struct_study/src/hash_table_problem/Solution447.java:42
↓ 1 callersMethodendOfFirstHalf
(ListNode head)
data_struct_study/src/LinkedList_problem/Solution_4_4.java:54
↓ 1 callersMethodenqueue
(E e)
data_struct_study/src/LinkedList/LinkedListQueue.java:44
↓ 1 callersMethodenqueue
(E e)
data_struct_study/src/queue/LoopQueue.java:48
↓ 1 callersMethodenqueue
(E e)
data_struct_study/src/queue/ArrayQueue.java:21
↓ 1 callersMethodenqueue
(E e)
data_struct_study/src/heap_and_priority_queue/Solution.java:287
↓ 1 callersMethodextractMax
()
data_struct_study/src/heap_and_priority_queue/Solution.java:245
↓ 1 callersMethodfind
查找数组中对应元素的下标 @return 对应元素的下标
data_struct_study/src/queue/Array.java:215
↓ 1 callersMethodfind
(E e)
data_struct_study/src/heap_and_priority_queue/Solution.java:102
↓ 1 callersMethodfind
查找数组中对应元素的下标 @return 对应元素的下标
data_struct_study/src/array/Array.java:233
↓ 1 callersMethodfindCombinations
(String digits, int index, String s)
data_struct_study/src/backstracking_problem/Solution17.java:52
↓ 1 callersMethodfindInDuplicate
判读当前窗口新的右边界是否已现在滑动窗口中，有则返回离左边界最近的下标（即飞跃值）
data_struct_study/src/array_problem/Solution3_3.java:45
← previousnext →101–200 of 806, ranked by callers