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

Methodmain

(String[] args)

data_struct_study/src/queue/Main.java:25

Methodmain

(String[] args)

data_struct_study/src/queue/ArrayQueue.java:61

Methodmain

(String[] args)

data_struct_study/src/heap_and_priority_queue/Solution.java:384

Methodmain

(String[] args)

data_struct_study/src/heap_and_priority_queue/Main.java:31

Methodmain

(String[] args)

data_struct_study/src/stack_problem/Solution20.java:44

Methodmain

(String[] args)

data_struct_study/src/stack_problem/Main.java:11

Methodmain

(String[] args)

data_struct_study/src/stack_problem/Solution_2.java:90

Methodmain

(String[] args)

data_struct_study/src/red_black_tree/Main2.java:11

Methodmain

(String[] args)

data_struct_study/src/red_black_tree/RBTree.java:353

Methodmain

(String[] args)

data_struct_study/src/red_black_tree/Main.java:11

Methodmain

(String[] args)

data_struct_study/src/red_black_tree/Main3.java:10

Methodmain

(String[] args)

data_struct_study/src/map/LinkedListMap.java:118

Methodmain

(String[] args)

data_struct_study/src/map/BSTMap.java:192

Methodmain

(String[] args)

data_struct_study/src/set/Main2.java:25

Methodmain

(String[] args)

data_struct_study/src/set/Main1.java:7

Methodmain

(String[] args)

data_struct_study/src/set/LinkedListSet.java:68

Methodmain

(String[] args)

data_struct_study/src/hash_table/Main.java:96

Methodmain

(String[] args)

data_struct_study/src/avl/AVLTree.java:376

Methodmain

(String[] args)

data_struct_study/src/avl/Main.java:8

Methodmain

(String[] args)

data_struct_study/src/avl/BST.java:170

Methodmain

(String[] args)

data_struct_study/src/dynamic_problem/Main.java:16

Methodmain

(String[] args)

data_struct_study/src/queue_problem/Solution102.java:74

Methodmain

(String[] args)

data_struct_study/src/queue_problem/Solution279_2.java:50

Methodmain

(String[] args)

data_struct_study/src/array/Student.java:21

Methodmain

(String[] args)

data_struct_study/src/array/Main.java:6

Methodmain

(String[] args)

data_struct_study/src/other_problem/Main.java:123

Methodmain

(String[] args)

data_struct_study/src/greedy_problem/Main.java:11

Methodmain

(String[] args)

data_struct_study/src/binary_search_tree_problem/Main.java:11

Methodmain

(String[] args)

data_struct_study/src/recursion/Solution.java:43

Methodmain

(String[] args)

data_struct_study/src/recursion/Solution5.java:72

Methodmain

(String[] args)

data_struct_study/src/recursion/Sum.java:16

Methodmain

(String[] args)

data_struct_study/src/trie/Main.java:28

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution3_3.java:54

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution238.java:32

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution88.java:45

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution344.java:47

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution3_2.java:43

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution11.java:44

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution3.java:42

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution_3.java:79

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution3_4.java:48

Methodmain

(String[] args)

data_struct_study/src/array_problem/Main.java:80

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution_2.java:42

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution215.java:90

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution_1.java:39

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution167_2.java:59

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution167.java:51

Methodmain

(String[] args)

data_struct_study/src/array_problem/Solution167_3.java:39

MethodmajorityElement

(int[] nums)

data_struct_study/src/other_problem/Solution169.java:7

MethodmajorityElement

(int[] nums)

data_struct_study/src/other_problem/Solution169_2.java:8

MethodmaxAreaOfIsland

(int[][] grid)

data_struct_study/src/array_problem/Solution695.java:8

MethodmaxDepth

(TreeNode root)

data_struct_study/src/binary_search_tree_problem/Solution104.java:22

MethodmaxInWindows

(int[] num, int size)

data_struct_study/src/dynamic_problem/Solution239.java:8

MethodmaxProfit

(int[] prices)

data_struct_study/src/dynamic_problem/Solution309.java:17

MethodmaxProfit_k_1

(int[] prices)

data_struct_study/src/dynamic_problem/Solution121.java:29

MethodmaxProfit_k_2

(int[] prices)

data_struct_study/src/dynamic_problem/Solution122.java:90

MethodmaxProfit_k_any

(int max_k, int[] prices)

data_struct_study/src/dynamic_problem/Solution122.java:102

MethodmaxProfit_with_cool

(int[] prices)

data_struct_study/src/dynamic_problem/Solution122.java:66

MethodmaxProfit_with_fee

(int[] prices, int fee)

data_struct_study/src/dynamic_problem/Solution122.java:79

MethodmaxSubArray

(int[] nums)

data_struct_study/src/dynamic_problem/Solution53.java:13

MethodmaximalSquare

(char[][] matrix)

data_struct_study/src/dynamic_problem/Solution221.java:11

Methodmerge

(E a, E b)

data_struct_study/src/segment_tree/NumArray.java:7

Methodmerge

(int[][] intervals)

data_struct_study/src/array_problem/Solution56.java:17

Methodmerge

(int[] nums1, int m, int[] nums2, int n)

data_struct_study/src/array_problem/Solution88.java:19

MethodmergeKLists

(ListNode[] lists)

data_struct_study/src/LinkedList_problem/Solution23.java:16

MethodmergeKLists2

(ListNode[] lists)

data_struct_study/src/LinkedList_problem/Solution23.java:53

MethodmergeTwoLists

(ListNode l1, ListNode l2)

data_struct_study/src/LinkedList_problem/Solution21.java:13

MethodminDepth

(TreeNode root)

data_struct_study/src/binary_search_tree_problem/Solution111.java:12

MethodminDistance

(String word1, String word2)

data_struct_study/src/dynamic_problem/Solution72.java:11

MethodminNumberdisappered

1、哈希法：时间复杂度O(n)，空间复杂度O(n)

data_struct_study/src/array_problem/Solution_3.java:32

MethodminPathSum

(int[][] grid)

data_struct_study/src/dynamic_problem/Solution64.java:10

MethodmoveZeroes

(int[] nums)

data_struct_study/src/array_problem/Solution283_2.java:9

MethodmoveZeroes

(int[] nums)

data_struct_study/src/array_problem/Solution283_4.java:5

MethodmoveZeroes

(int[] nums)

data_struct_study/src/array_problem/Solution283.java:12

MethodmoveZeroes

(int[] nums)

data_struct_study/src/array_problem/Solution283_3.java:9

MethodmySqrt

(int x)

data_struct_study/src/other_problem/Solution69.java:5

Methodnext

()

data_struct_study/src/other_problem/Solution_2.java:64

Methodnext

()

data_struct_study/src/other_problem/Solution_2.java:89

MethodnumDecodings

(String s)

data_struct_study/src/dynamic_problem/Solution91.java:5

MethodnumIslands

(char[][] grid)

data_struct_study/src/backstracking_problem/Solution200.java:15

MethodnumSquare

(int n)

data_struct_study/src/dynamic_problem/Solution279.java:8

MethodnumSquares

(int n)

data_struct_study/src/queue_problem/Solution279.java:20

MethodnumberOfBoomerangs

(int[][] points)

data_struct_study/src/hash_table_problem/Solution447.java:16

MethododdEvenList

(ListNode head)

data_struct_study/src/LinkedList_problem/Solution328.java:5

Methodpartition

(String s)

data_struct_study/src/backstracking_problem/Solution131.java:11

MethodpathSum

(TreeNode root, int sum)

data_struct_study/src/binary_search_tree_problem/Solution437.java:21

Methodpop

()

data_struct_study/src/stack_problem/Solution155.java:30

Methodpop

()

data_struct_study/src/stack_problem/Solution_1.java:26

MethodpostOrder

后序遍历

data_struct_study/src/binary_search_tree/BST.java:247

MethodpostOrderTraversal

(TreeNode root)

data_struct_study/src/stack_problem/Solution145_2.java:34

MethodpostorderTraversal

(TreeNode root)

data_struct_study/src/stack_problem/Solution145.java:21

MethodpreOrder

前序遍历

data_struct_study/src/binary_search_tree/BST.java:177

MethodpreOrderNR

前序遍历非递归实现，需要借助栈存储下一步要访问的元素

data_struct_study/src/binary_search_tree/BST.java:200

MethodpreorderTraversal

(TreeNode root)

data_struct_study/src/stack_problem/Solution144_2.java:34

MethodpreorderTraversal

(TreeNode root)

data_struct_study/src/stack_problem/Solution144.java:24

MethodprintList

(List<Integer> nums)

data_struct_study/src/heap_and_priority_queue/Solution.java:378

Methodpush

(int e)

data_struct_study/src/stack_problem/Solution155.java:23

Methodpush

(int node)

data_struct_study/src/stack_problem/Solution_1.java:21

MethodqueryFirst

查询数组中第一个位置的元素 @return 数组中的元素

data_struct_study/src/array/Array.java:184

MethodqueryLast

查询数组中最后一个位置的元素 @return 数组中的元素

data_struct_study/src/array/Array.java:175

← previous next →601–700 of 806, ranked by callers