Fall in love with [] data structure Data Structures and Algorithms

Complexity and LeetCode

The complexity of the problem of knowledge and LeetCode brush guide

Array (Array)

[Array] Array dynamic expansion array ArrayList (Java, C ++)

List (List)

[List] singly linked list SingleLinkedList, doubly linked list LinkedList

[] One-way circular list CircleList circular linked list, two-way circulation list and Joseph Central issues

Stack (Stack)

Stack Stack Stack Stack []

Queue (Queue)

] [Queue Queue Queue queue, deque DeQueue, circular queue CircleQueue, double-ended circular queue CircleDeque

[Queue priority queue Queue] the Priority Queue (binary heap implementation)

Tree (Tree)

[] Tree Tree binary search tree BinarySearchTree

Tree [trees] balanced binary search tree AVLTree

Tree [trees] BST, AVLTree, red-black tree RBTree

Tree [trees] trie Trie

Hash table (HashTable)

[] Hash table hash table describes the source as well as from the analysis Integer, Float, Long, Double, String, defined object from the hash value calculation

Collection (Set)

【集合Set】ListSet、TreeSet、HashSet

Mapping (Map)

【映射Map】TreeMap，HashMap，LinkedHashMap

Heap (Heap)

Heap Heap] [binary heap BinaryHeap, minimum heap solve the problem TOPK

Disjoint-set (Union Find)

[Disjoint-set] Union Find

Sorting Algorithm Daquan

Sorting Algorithm Daquan

Pre-sorting algorithm code environment knowledge and preparation

Bubble sort (Bubble Sort)
Selection Sort (Selection Sort)
heap sort (Insertion Sort)

Insertion sort (Insertion Sort)

Merge sort (Merge Sort)

Quick Sort (Quick SortQuick)

Hill sorting (Shell Sort)

Counting sequencing (Counting Sort)

Radix sort (Radix Sort)
bucket sort (Bucket Sort)
sleep sort (Sleep Sort)