goDonng/

directory
v0.0.0-...-adc727d Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Oct 28, 2020 License: Apache-2.0

README

Play-with-Data-Structures

本仓库代码基于 liuyubobobo 老师在慕课网上的实战课程《玩儿转数据结构》，课程本身是基于 Java 语言讲解的，原仓库地址：https://github.com/liuyubobobo/Play-with-Data-Structures

数据结构研究的是数据如何在计算机中进行组织和存储，使得我们可以高效的获取数据或者修改数据。

我们需要根据应用的不同，灵活选择最合适的数据结构。

数据结构的分类

1. 线性结构

数组，栈，队列，链表，哈希表...

2. 树结构

二叉树，二分搜索树，AVL，红黑树，Treap，Splay，堆，Trie，线段树，K-D树，并查集，哈夫曼树...

3. 图结构

邻接矩阵，邻接表

此项目涉及的数据结构

不包含图结构，图论领域以算法为主。

  • 数组 栈 队列 链表
  • 二分搜索树 堆 线段树 Trie
  • 并查集 AVL 红黑树 哈希表

Directories

Path Synopsis
02-Arrays
01-Array-Basics/src
02-Create-Our-Own-Array/src
02-Create-Our-Own-Array/src/Array
03-Add-Element-in-Array/src
03-Add-Element-in-Array/src/Array
04-Query-and-Update-Element/src
04-Query-and-Update-Element/src/Array
05-Contain-Find-and-Remove/src
05-Contain-Find-and-Remove/src/Array
06-Generic-Data-Structure/src
06-Generic-Data-Structure/src/Array
06-Generic-Data-Structure/src/Student
07-Dynamic-Array/src
07-Dynamic-Array/src/Array
09-Amortized-Time-Complexity/src
09-Amortized-Time-Complexity/src/Array
03-Stacks-and-Queues
02-Array-Stack/src
02-Array-Stack/src/Array
02-Array-Stack/src/ArrayStack
02-Array-Stack/src/Stack
03-A-Stack-Problem-in-Leetcode/src/Solution
04-More-about-Leetcode/src/Array
04-More-about-Leetcode/src/ArrayStack
04-More-about-Leetcode/src/Solution
04-More-about-Leetcode/src/Stack
05-Array-Queue/src
05-Array-Queue/src/Array
05-Array-Queue/src/ArrayQueue
05-Array-Queue/src/Queue
05-Array-Queue/src/Solution
06-Loop-Queue/src
06-Loop-Queue/src/Array
06-Loop-Queue/src/ArrayQueue
06-Loop-Queue/src/LoopQueue
06-Loop-Queue/src/Queue
07-Implementation-of-Loop-Queue/src
07-Implementation-of-Loop-Queue/src/Array
07-Implementation-of-Loop-Queue/src/ArrayQueue
07-Implementation-of-Loop-Queue/src/LoopQueue
07-Implementation-of-Loop-Queue/src/Queue
08-Queues-Comparison/src
08-Queues-Comparison/src/Array
08-Queues-Comparison/src/ArrayQueue
08-Queues-Comparison/src/LoopQueue
08-Queues-Comparison/src/Queue
Optional-01-Loop-Queue-without-Wasting-One-Space/src/LoopQueue
Optional-01-Loop-Queue-without-Wasting-One-Space/src/Queue
Optional-01-Loop-Queue-without-Wasting-One-Space/src/Solution
Optional-02-Loop-Queue-without-Size-Member/src/LoopQueue
Optional-02-Loop-Queue-without-Size-Member/src/Queue
Optional-02-Loop-Queue-without-Size-Member/src/Solution
04-Linked-List
01-Linked-List-Basics/src/LinkedList
02-Add-Elements-in-LinkedList/src/LinkedList
03-DummyHead-in-LinkedList/src/LinkedList
04-Query-and-Update-in-LinkedList/src
04-Query-and-Update-in-LinkedList/src/LinkedList
05-Remove-Element-in-LinkedList/src
05-Remove-Element-in-LinkedList/src/LinkedList
06-Implement-Stack-in-LinkedList/src
06-Implement-Stack-in-LinkedList/src/Array
06-Implement-Stack-in-LinkedList/src/ArrayStack
06-Implement-Stack-in-LinkedList/src/LinkedList
06-Implement-Stack-in-LinkedList/src/LinkedListStack
06-Implement-Stack-in-LinkedList/src/Solution
06-Implement-Stack-in-LinkedList/src/Stack
07-Implement-Queue-in-LinkedList/src
07-Implement-Queue-in-LinkedList/src/Array
07-Implement-Queue-in-LinkedList/src/ArrayQueue
07-Implement-Queue-in-LinkedList/src/LinkedListQueue
07-Implement-Queue-in-LinkedList/src/LoopQueue
07-Implement-Queue-in-LinkedList/src/Queue
07-Implement-Queue-in-LinkedList/src/Solution
05-Recursion
01-Linked-List-Problems-in-Leetcode/src/ListNode
01-Linked-List-Problems-in-Leetcode/src/Solution
01-Linked-List-Problems-in-Leetcode/src/Solution2
01-Linked-List-Problems-in-Leetcode/src/Solution3
02-Test-Your-LinkedList-Solution/src
02-Test-Your-LinkedList-Solution/src/ListNode
02-Test-Your-LinkedList-Solution/src/Solution
02-Test-Your-LinkedList-Solution/src/Solution2
02-Test-Your-LinkedList-Solution/src/Solution3
03-Recursion-Basics/src
03-Recursion-Basics/src/ListNode
03-Recursion-Basics/src/Solution
03-Recursion-Basics/src/Solution2
03-Recursion-Basics/src/Solution3
03-Recursion-Basics/src/Sum
04-LinkedList-and-Recursion/src
04-LinkedList-and-Recursion/src/ListNode
04-LinkedList-and-Recursion/src/Solution
04-LinkedList-and-Recursion/src/Solution2
04-LinkedList-and-Recursion/src/Solution3
04-LinkedList-and-Recursion/src/Solution4
04-LinkedList-and-Recursion/src/Sum
06-Debug-Recursive-Solution/src/ListNode
06-Debug-Recursive-Solution/src/Solution
Optional-01-Recursive-LinkedList/src
Optional-01-Recursive-LinkedList/src/LinkedList
Optional-01-Recursive-LinkedList/src/LinkedListR
Optional-01-Recursive-LinkedList/src/Solution
06-Binary-Search-Tree
02-Binary-Search-Tree-Basics/src/BST
03-Add-Elements-in-BST/src/BST
04-Improved-Add-Elements-in-BST/src/BST
04-Improved-Add-Elements-in-BST/src/Solution
05-Search-in-BST/src/BST
06-PreOrder-Traverse-in-BST/src
06-PreOrder-Traverse-in-BST/src/BST
07-InOrder-and-PostOrder-Traverse-in-BST/src
07-InOrder-and-PostOrder-Traverse-in-BST/src/BST
09-Non-Recursion-Preorder-Traverse-in-BST/src
09-Non-Recursion-Preorder-Traverse-in-BST/src/Array
09-Non-Recursion-Preorder-Traverse-in-BST/src/ArrayStack
09-Non-Recursion-Preorder-Traverse-in-BST/src/BST
09-Non-Recursion-Preorder-Traverse-in-BST/src/Solution
10-Level-Traverse-in-BST/src
10-Level-Traverse-in-BST/src/Array
10-Level-Traverse-in-BST/src/BST
10-Level-Traverse-in-BST/src/LoopQueue
11-Remove-Min-and-Max-in-BST/src
11-Remove-Min-and-Max-in-BST/src/BST
12-Remove-Elements-in-BST/src
12-Remove-Elements-in-BST/src/BST
07-Set-and-Map
01-Set-Basics-and-BSTSet/src
01-Set-Basics-and-BSTSet/src/BST
01-Set-Basics-and-BSTSet/src/BSTSet
01-Set-Basics-and-BSTSet/src/Set
02-LinkedListSet/src
02-LinkedListSet/src/LinkedList
02-LinkedListSet/src/LinkedListSet
02-LinkedListSet/src/Set
03-Time-Complexity-of-Set/src
03-Time-Complexity-of-Set/src/BST
03-Time-Complexity-of-Set/src/BSTSet
03-Time-Complexity-of-Set/src/LinkedList
03-Time-Complexity-of-Set/src/LinkedListSet
03-Time-Complexity-of-Set/src/Set
04-TreeSet-and-Set-Problems-in-Leetcode/src/BSTSetSolution
04-TreeSet-and-Set-Problems-in-Leetcode/src/LinkedListSetSolution
04-TreeSet-and-Set-Problems-in-Leetcode/src/Solution
05-Map-Basics/src/Map
06-LinkedListMap/src
06-LinkedListMap/src/LinkedListMap
06-LinkedListMap/src/Map
06-LinkedListMap/src/Solution
07-BSTMap/src/BSTMap
07-BSTMap/src/Map
07-BSTMap/src/Solution
08-More-about-Map/src
08-More-about-Map/src/BSTMap
08-More-about-Map/src/LinkedListMap
08-More-about-Map/src/Map
09-Leetcode-Problems-about-Map-and-Set/src/BSTMapSolution350
09-Leetcode-Problems-about-Map-and-Set/src/BSTSetSolution349
09-Leetcode-Problems-about-Map-and-Set/src/LinkedListMapSolution350
09-Leetcode-Problems-about-Map-and-Set/src/LinkedListSetSolution349
09-Leetcode-Problems-about-Map-and-Set/src/Solution349
09-Leetcode-Problems-about-Map-and-Set/src/Solution350
08-Heap-and-Priority-Queue
02-Heap-Basics/src/Array
02-Heap-Basics/src/MaxHeap
03-Add-and-Sift-Up-in-Heap/src/Array
03-Add-and-Sift-Up-in-Heap/src/MaxHeap
04-Extract-and-Sift-Down-in-Heap/src
04-Extract-and-Sift-Down-in-Heap/src/Array
04-Extract-and-Sift-Down-in-Heap/src/MaxHeap
04-Extract-and-Sift-Down-in-Heap/src/Solution
05-Heapify-and-Replace-in-Heap/src
05-Heapify-and-Replace-in-Heap/src/Array
05-Heapify-and-Replace-in-Heap/src/MaxHeap
05-Heapify-and-Replace-in-Heap/src/Solution
06-Priority-Queue/src
06-Priority-Queue/src/Array
06-Priority-Queue/src/MaxHeap
06-Priority-Queue/src/PriorityQueue
06-Priority-Queue/src/Queue
06-Priority-Queue/src/Solution
07-Priority-Queue-Problems-in-Leetcode/src/Array
07-Priority-Queue-Problems-in-Leetcode/src/Solution
09-Segment-Tree
02-Segment-Tree-Basics/src/SegmentTree
03-Building-Segment-Tree/src
03-Building-Segment-Tree/src/Merger
03-Building-Segment-Tree/src/SegmentTree
04-Query-in-Segment-Tree/src
04-Query-in-Segment-Tree/src/Merger
04-Query-in-Segment-Tree/src/SegmentTree
05-Segment-Tree-Problems-in-Leetcode/src
05-Segment-Tree-Problems-in-Leetcode/src/Merger
05-Segment-Tree-Problems-in-Leetcode/src/NumArray
05-Segment-Tree-Problems-in-Leetcode/src/NumArray2
05-Segment-Tree-Problems-in-Leetcode/src/NumArray3
05-Segment-Tree-Problems-in-Leetcode/src/NumArrayComplete
05-Segment-Tree-Problems-in-Leetcode/src/SegmentTree
06-Update-Single-Element-in-Segment-Tree/src
06-Update-Single-Element-in-Segment-Tree/src/Merger
06-Update-Single-Element-in-Segment-Tree/src/NumArray
06-Update-Single-Element-in-Segment-Tree/src/NumArrayComplete
06-Update-Single-Element-in-Segment-Tree/src/SegmentTree
10-Trie
02-Trie-Basics/src/Trie
03-Searching-in-Trie/src
03-Searching-in-Trie/src/BST
03-Searching-in-Trie/src/BSTSet
03-Searching-in-Trie/src/Set
03-Searching-in-Trie/src/Trie
04-Prefix-in-Trie/src
04-Prefix-in-Trie/src/BST
04-Prefix-in-Trie/src/BSTSet
04-Prefix-in-Trie/src/Set
04-Prefix-in-Trie/src/Trie
04-Prefix-in-Trie/src/Trie208
05-Trie-and-Pattern-Match/src/WordDictionary
06-Trie-and-Map/src
08-Trie-Using-HashMap-and-Array/src
08-Trie-Using-HashMap-and-Array/src/BST
08-Trie-Using-HashMap-and-Array/src/BSTMap
08-Trie-Using-HashMap-and-Array/src/BSTSet
08-Trie-Using-HashMap-and-Array/src/Map
08-Trie-Using-HashMap-and-Array/src/Set
08-Trie-Using-HashMap-and-Array/src/Trie
08-Trie-Using-HashMap-and-Array/src/Trie2
08-Trie-Using-HashMap-and-Array/src/Trie3
11-Union-Find
01-What-is-UnionFind/src/UF
02-Quick-Find/src/LinkedList
02-Quick-Find/src/LinkedListSet
02-Quick-Find/src/Set
02-Quick-Find/src/Solution
02-Quick-Find/src/UF
02-Quick-Find/src/UnionFind1
03-Quick-Union/src/Solution
03-Quick-Union/src/UF
03-Quick-Union/src/UnionFind1
03-Quick-Union/src/UnionFind2
04-Optimized-by-Size/src
04-Optimized-by-Size/src/UF
04-Optimized-by-Size/src/UnionFind1
04-Optimized-by-Size/src/UnionFind2
04-Optimized-by-Size/src/UnionFind3
05-Optimized-by-Rank/src
05-Optimized-by-Rank/src/UF
05-Optimized-by-Rank/src/UnionFind1
05-Optimized-by-Rank/src/UnionFind2
05-Optimized-by-Rank/src/UnionFind3
05-Optimized-by-Rank/src/UnionFind4
06-Path-Compression/src
06-Path-Compression/src/UF
06-Path-Compression/src/UnionFind1
06-Path-Compression/src/UnionFind2
06-Path-Compression/src/UnionFind3
06-Path-Compression/src/UnionFind4
06-Path-Compression/src/UnionFind5
07-More-about-Union-Find/src
07-More-about-Union-Find/src/Solution
07-More-about-Union-Find/src/UF
07-More-about-Union-Find/src/UnionFind1
07-More-about-Union-Find/src/UnionFind2
07-More-about-Union-Find/src/UnionFind3
07-More-about-Union-Find/src/UnionFind4
07-More-about-Union-Find/src/UnionFind5
07-More-about-Union-Find/src/UnionFind6
12-AVL-Tree
02-Calculating-Balance-Factor/src
02-Calculating-Balance-Factor/src/AVLTree
02-Calculating-Balance-Factor/src/BSTMap
03-Checking-Balancing-and-Binary-Search-Property/src/AVLTree
03-Checking-Balancing-and-Binary-Search-Property/src/BSTMap
04-Rotation-Operations/src/AVLTree
04-Rotation-Operations/src/BSTMap
05-The-Implementation-of-Left-Rotation-and-Right-Rotation/src/AVLTree
05-The-Implementation-of-Left-Rotation-and-Right-Rotation/src/BSTMap
06-LR-and-RL/src
06-LR-and-RL/src/AVLTree
06-LR-and-RL/src/BSTMap
06-LR-and-RL/src/Solution
07-Remove-Elements-in-AVL-Tree/src
07-Remove-Elements-in-AVL-Tree/src/AVLTree
07-Remove-Elements-in-AVL-Tree/src/BSTMap
07-Remove-Elements-in-AVL-Tree/src/Solution349
07-Remove-Elements-in-AVL-Tree/src/Solution350
08-Map-and-Set-in-AVL-Tree/src/AVLMap
08-Map-and-Set-in-AVL-Tree/src/AVLSet
08-Map-and-Set-in-AVL-Tree/src/AVLTree
08-Map-and-Set-in-AVL-Tree/src/BST
08-Map-and-Set-in-AVL-Tree/src/BSTMap
08-Map-and-Set-in-AVL-Tree/src/BSTSet
08-Map-and-Set-in-AVL-Tree/src/LinkedList
08-Map-and-Set-in-AVL-Tree/src/LinkedListMap
08-Map-and-Set-in-AVL-Tree/src/LinkedListSet
08-Map-and-Set-in-AVL-Tree/src/Map
08-Map-and-Set-in-AVL-Tree/src/Set
08-Map-and-Set-in-AVL-Tree/src/Solution349
08-Map-and-Set-in-AVL-Tree/src/Solution350
08-Map-and-Set-in-AVL-Tree/src/TestMapMain
08-Map-and-Set-in-AVL-Tree/src/TestSetMain
13-Red-Black-Tree
03-The-Equivalence-of-RBTree-and-2-3-Tree/src
03-The-Equivalence-of-RBTree-and-2-3-Tree/src/AVLTree
03-The-Equivalence-of-RBTree-and-2-3-Tree/src/BSTMap
03-The-Equivalence-of-RBTree-and-2-3-Tree/src/Map
03-The-Equivalence-of-RBTree-and-2-3-Tree/src/RBTree
05-Keep-Root-Black-and-Left-Rotation/src
05-Keep-Root-Black-and-Left-Rotation/src/AVLTree
05-Keep-Root-Black-and-Left-Rotation/src/BSTMap
05-Keep-Root-Black-and-Left-Rotation/src/Map
05-Keep-Root-Black-and-Left-Rotation/src/RBTree
06-Flip-Colors-and-Right-Rotation/src
06-Flip-Colors-and-Right-Rotation/src/AVLTree
06-Flip-Colors-and-Right-Rotation/src/BSTMap
06-Flip-Colors-and-Right-Rotation/src/Map
06-Flip-Colors-and-Right-Rotation/src/RBTree
07-Adding-Elements-in-Red-Black-Tree/src
07-Adding-Elements-in-Red-Black-Tree/src/AVLTree
07-Adding-Elements-in-Red-Black-Tree/src/BSTMap
07-Adding-Elements-in-Red-Black-Tree/src/Map
07-Adding-Elements-in-Red-Black-Tree/src/RBTree
08-The-Performance-of-Red-Black-Tree/src
08-The-Performance-of-Red-Black-Tree/src/AVLTree
08-The-Performance-of-Red-Black-Tree/src/BSTMap
08-The-Performance-of-Red-Black-Tree/src/Main2
08-The-Performance-of-Red-Black-Tree/src/Main3
08-The-Performance-of-Red-Black-Tree/src/Map
08-The-Performance-of-Red-Black-Tree/src/RBTree
14-Hash-Table
01-Hash-Table-Basics/src/Solution
03-Hash-Function-in-Java/src
03-Hash-Function-in-Java/src/Student
05-Hash-Table-Implementation/src
05-Hash-Table-Implementation/src/AVLTree
05-Hash-Table-Implementation/src/BSTMap
05-Hash-Table-Implementation/src/HashTable
05-Hash-Table-Implementation/src/RBTree
06-Resizing-in-Hash-Table/src
06-Resizing-in-Hash-Table/src/AVLTree
06-Resizing-in-Hash-Table/src/BSTMap
06-Resizing-in-Hash-Table/src/HashTable
06-Resizing-in-Hash-Table/src/RBTree
07-More-About-Resizing-in-Hash-Table/src
07-More-About-Resizing-in-Hash-Table/src/AVLTree
07-More-About-Resizing-in-Hash-Table/src/BSTMap
07-More-About-Resizing-in-Hash-Table/src/HashTable
07-More-About-Resizing-in-Hash-Table/src/RBTree
Overview
Array
BinarySearchTree
Interfaces/Array
Interfaces/Queue
Interfaces/Stack
LinkedList/IsPalindrome
LinkedList/LinkedList
LinkedList/LoopLinkedList
LinkedList/TwoWayLinkedList
MaxHeap
Utils
FileOperation
Interfaces

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.