Functions — github.com/JsonChao/Awesome-Algorithm-Study

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

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

⨍ Functions 806◇ Types & classes 394

MethodTrie2

()

data_struct_study/src/trie/Trie2.java:26

MethodTrie206

Initialize your data structure here.

data_struct_study/src/trie/Trie206.java:24

MethodTrie3

()

data_struct_study/src/trie/Trie3.java:23

MethodUnionFind1

(int size)

data_struct_study/src/union_find/UnionFind1.java:7

MethodUnionFind2

(int size)

data_struct_study/src/union_find/UnionFind2.java:10

MethodUnionFind3

(int size)

data_struct_study/src/union_find/UnionFind3.java:19

MethodUnionFind4

(int size)

data_struct_study/src/union_find/UnionFind4.java:19

MethodUnionFind5

(int size)

data_struct_study/src/union_find/UnionFind5.java:21

MethodUnionFind6

(int size)

data_struct_study/src/union_find/UnionFind6.java:25

MethodWordDictionary

Initialize your data structure here.

data_struct_study/src/trie/WordDictionary.java:24

Methodadd

向堆中添加元素 @param e E

data_struct_study/src/heap_and_priority_queue/MaxHeap.java:98

Methodadd

(E e)

data_struct_study/src/heap_and_priority_queue/Solution.java:224

MethodaddFirst

(E e)

data_struct_study/src/heap_and_priority_queue/Solution.java:74

MethodaddFirst

向数组开始添加一个元素时间复杂度：O（n）

data_struct_study/src/array/Array.java:123

MethodaddTwoNumbers

(ListNode l1, ListNode l2)

data_struct_study/src/LinkedList_problem/Solution2.java:13

MethodaddTwoNumbers

(ListNode l1, ListNode l2)

data_struct_study/src/LinkedList_problem/Solution445.java:27

MethodaddWord

Adds a word into the data structure.

data_struct_study/src/trie/WordDictionary.java:29

MethodbinarySearch

(Comparable[] arr, int n, Comparable target)

data_struct_study/src/array_problem/BinarySearch.java:8

MethodbinarySearch

(Comparable[] arr, int n, Comparable target)

data_struct_study/src/array_problem/BinarySearch2.java:17

MethodbinaryTreePaths

(TreeNode root)

data_struct_study/src/binary_search_tree_problem/Solution257.java:20

MethodcanPartition

(int[] nums)

data_struct_study/src/dynamic_problem/Solution416_2.java:9

MethodcanPartition

(int[] nums)

data_struct_study/src/dynamic_problem/Solution416.java:32

MethodclimbStairs

(int n)

data_struct_study/src/dynamic_problem/Solution70_3.java:13

MethodclimbStairs

(int n)

data_struct_study/src/dynamic_problem/Solution70_2.java:15

MethodclimbStairs

(int n)

data_struct_study/src/dynamic_problem/Solution70.java:17

MethodcoinChange

(int[] coins, int amount)

data_struct_study/src/dynamic_problem/Solution322.java:7

MethodcombinationSum

(int[] candidates, int target)

data_struct_study/src/backstracking_problem/Solution39.java:8

MethodcombinationSum2

(int[] candidates, int target)

data_struct_study/src/backstracking_problem/Solution40.java:9

MethodcombinationSum3

(int k, int n)

data_struct_study/src/backstracking_problem/Solution216.java:8

Methodcombine

(int n, int k)

data_struct_study/src/backstracking_problem/Solution77_2.java:17

Methodcombine

(int n, int k)

data_struct_study/src/backstracking_problem/Solution77.java:17

Methodcompare

(Pair<Integer, Integer> o1, Pair<Integer, Integer> o2)

data_struct_study/src/queue_problem/Solution347.java:17

Methodcompare

(Interval o1, Interval o2)

data_struct_study/src/greedy_problem/Solution435.java:37

Methodcompare

(Interval o1, Interval o2)

data_struct_study/src/greedy_problem/Solution435_2.java:29

Methodcontains

判断是否包含元素 e @param e E @return 是否包含元素 e

data_struct_study/src/binary_search_tree/BST.java:148

Methodcontains

数组中是否包含某元素 @return 是否包含某元素

data_struct_study/src/queue/Array.java:201

Methodcontains

(E e)

data_struct_study/src/heap_and_priority_queue/Solution.java:93

MethodcontainsDuplicate

(int[] nums)

data_struct_study/src/hash_table_problem/Solution217.java:14

MethodcontainsNearbyAlmostDuplicate

(int[] nums, int k, int t)

data_struct_study/src/hash_table_problem/Solution220.java:14

MethodcontainsNearbyDuplicate

(int[] nums, int k)

data_struct_study/src/hash_table_problem/Solution219.java:17

MethoddeleteDuplicates

(ListNode head)

data_struct_study/src/LinkedList_problem/Solution83.java:8

MethoddeleteElement

删除数组中指定的元素 @param e 被删除的元素 @return 是否删除成功

data_struct_study/src/queue/Array.java:248

MethoddeleteNode

(ListNode node)

data_struct_study/src/LinkedList_problem/Solution237.java:10

Methoddequeue

()

data_struct_study/src/queue/Queue.java:7

Methoddequeue

()

data_struct_study/src/heap_and_priority_queue/PriorityQueue.java:29

MethoddetectCycle

(ListNode head)

data_struct_study/src/LinkedList_problem/Solution142.java:12

Methodenqueue

(E e)

data_struct_study/src/queue/Queue.java:5

Methodenqueue

(E e)

data_struct_study/src/heap_and_priority_queue/PriorityQueue.java:24

MethodenqueueMessage

(Message message)

data_struct_study/src/other_problem/Solution_2.java:52

MethodenqueueMessage

(Message message)

data_struct_study/src/other_problem/Solution_2.java:68

MethodenqueueMessage

(Message message)

data_struct_study/src/other_problem/Solution_2.java:101

MethoderaseOverlapIntervals

(Interval[] intervals)

data_struct_study/src/greedy_problem/Solution435.java:29

MethoderaseOverlapIntervals

(Interval[] intervals)

data_struct_study/src/greedy_problem/Solution435_2.java:21

Methodexist

(char[][] board, String word)

data_struct_study/src/backstracking_problem/Solution79.java:15

Methodfib

(int n)

data_struct_study/src/dynamic_problem/Solution509_2.java:12

Methodfib

(int n)

data_struct_study/src/dynamic_problem/Solution509.java:8

Methodfib

(int n)

data_struct_study/src/dynamic_problem/Solution509_3.java:10

MethodfindAnagrams

(String s, String p)

data_struct_study/src/array_problem/Solution438.java:15

MethodfindCircleNNum

(int[][] M)

data_struct_study/src/array_problem/Solution547.java:7

MethodfindContentChildren

(int[] g, int[] s)

data_struct_study/src/greedy_problem/Solution455.java:13

MethodfindContentChildren

(int[] g, int[] s)

data_struct_study/src/greedy_problem/Solution455_2.java:12

MethodfindFirstCommonNode

(ListNode pHead1, ListNode pHead2)

data_struct_study/src/LinkedList_problem/Solution_1.java:15

MethodfindKthToTail

(ListNode head, int k)

data_struct_study/src/LinkedList_problem/Solution_3.java:19

MethodfindTargetSumWays

(int[] nums, int S)

data_struct_study/src/dynamic_problem/Solution494.java:14

MethodfindTargetSumWays

(int[] nums, int S)

data_struct_study/src/dynamic_problem/Solution494_2.java:5

MethodfirstUniqChar

(String s)

data_struct_study/src/hash_table/Solution1.java:8

MethodfourSumCount

(int[] A, int[] B, int[] C, int[] D)

data_struct_study/src/hash_table_problem/Solution454_2.java:11

MethodfourSumCount

(int[] A, int[] B, int[] C, int[] D)

data_struct_study/src/hash_table_problem/Solution454.java:17

MethodfrequencySort

(String s)

data_struct_study/src/hash_table_problem/Solution451.java:9

MethodgenerateParenthesis

(int n)

data_struct_study/src/backstracking_problem/Solution22.java:13

Methodget

获取指定下标的元素 @param index 下标 @return 指定下标的元素

data_struct_study/src/segment_tree/NumArray.java:161

Methodget

获取指定下标的元素 @param index 下标 @return 指定下标的元素

data_struct_study/src/segment_tree/SegmentTree.java:193

Methodget

(int index)

data_struct_study/src/heap_and_priority_queue/Solution.java:79

Methodget

(int key)

data_struct_study/src/other_problem/Solution146.java:32

MethodgetCapacity

获取数组的容量 @return 容量

data_struct_study/src/queue/Array.java:75

MethodgetCapacity

()

data_struct_study/src/heap_and_priority_queue/Solution.java:37

MethodgetCapacity

获取数组的容量 @return 容量

data_struct_study/src/array/Array.java:93

MethodgetCode

()

data_struct_study/src/other_problem/Solution_2.java:30

MethodgetFront

()

data_struct_study/src/LinkedList/LinkedListQueue.java:89

MethodgetFront

()

data_struct_study/src/queue/LoopQueue.java:99

MethodgetFront

()

data_struct_study/src/queue/Queue.java:13

MethodgetFront

()

data_struct_study/src/queue/ArrayQueue.java:41

MethodgetFront

()

data_struct_study/src/heap_and_priority_queue/PriorityQueue.java:44

MethodgetFront

()

data_struct_study/src/heap_and_priority_queue/Solution.java:289

MethodgetIntersectionNode

(ListNode headA, ListNode headB)

data_struct_study/src/LinkedList_problem/Solution160.java:5

MethodgetLast

获取链表尾部的元素 @return 链表尾部的元素

data_struct_study/src/LinkedList/LinkedList.java:160

MethodgetMin

()

data_struct_study/src/stack_problem/Solution155.java:37

MethodgetMsg

()

data_struct_study/src/other_problem/Solution_2.java:38

MethodgetSize

()

data_struct_study/src/LinkedList/LinkedListQueue.java:84

MethodgetSize

()

data_struct_study/src/LinkedList/LinkedListStack.java:25

MethodgetSize

获取链表的大小 @return 链表的大小

data_struct_study/src/LinkedList/LinkedList.java:70

MethodgetSize

()

data_struct_study/src/union_find/UnionFind3.java:30

MethodgetSize

()

data_struct_study/src/union_find/UnionFind1.java:15

MethodgetSize

()

data_struct_study/src/union_find/UnionFind6.java:36

MethodgetSize

()

data_struct_study/src/union_find/UnionFind5.java:32

MethodgetSize

()

data_struct_study/src/union_find/UF.java:5

MethodgetSize

()

data_struct_study/src/union_find/UnionFind4.java:30

MethodgetSize

()

data_struct_study/src/union_find/UnionFind2.java:19

MethodgetSize

()

data_struct_study/src/segment_tree/NumArray.java:151

MethodgetSize

()

data_struct_study/src/segment_tree/SegmentTree.java:183

← previous next →401–500 of 806, ranked by callers