Skip to content

Add english translation 添加英文翻译 #100

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Feb 19, 2021
Merged

Add english translation 添加英文翻译 #100

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Add english translation 添加英文翻译
  • Loading branch information
Wee Hong committed Feb 19, 2021
commit 5a2331afd4884855557d5c25bcc1e08fde9b6c21
12 changes: 6 additions & 6 deletions website/content/ChapterOne/Data_Structure.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,14 +14,14 @@ weight: 1
|:-------:|:-------|:------|:------|
|顺序线性表：向量 <br>Vector||||
|单链表<br>Singly Linked List|1. 双向链表 Double Linked Lists<br>2. 静态链表 Static List<br>3. 对称矩阵 Symmetric Matrix<br>4. 稀疏矩阵 Sparse Matrix|||
|哈希表<br>Hash Table|1. 散列函数 Hash Function<br>2. 解决碰撞/填充因子<br>|||
|栈和队列<br>Stack & Queue|1. 广义栈<br>2. 双端队列 Deque<br>|||
|队列<br>Queue|1. 链表实现<br>2. 循环数组实现<br>3. 双端队列 Deque|||
|哈希表<br>Hash Table|1. 散列函数 Hash Function<br>2. 解决碰撞/填充因子 Collision Resolution<br>|||
|栈和队列<br>Stack & Queue|1. 广义表 Generalized List/GList<br>2. 双端队列 Deque<br>|||
|队列<br>Queue|1. 链表实现 Linked List Implementation<br>2. 循环数组实现 ArrayQueue<br>3. 双端队列 Deque<br>4. 优先队列 Priority Queue<br>5. 循环队列 Circular Queue|||
|字符串<br>String|1. KMP 算法<br>2. 有限状态自动机<br>3. 模式匹配有限状态自动机<br>4. BM 模式匹配算法<br>5. BM-KMP 算法<br>6. BF 算法|||
|树<br>Tree|1. 二叉树 Binary Tree<br>2. 并查集 Union-Find<br>3. Huffman 树|||
|数组实现的堆<br>Heap|1. 极大堆和极小堆<br>2. 极大极小堆<br>3. 双端堆 Deap<br>4. d 叉堆|||
|树实现的堆<br>Heap|1. 左堆<br>2. 扁堆<br>3. 二项式堆<br>4. 斐波那契堆 Fibonacco Heap<br>5. 配对堆 Pairing Heap|||
|查找<br>Find|1. 哈希表 Hash<br>2. 跳跃表 Skip List<br>3. 排序二叉树 Binary Sort Tree<br>4. AVL 树<br>5. B 树 / B+ 树 / B* 树<br>6. AA 树<br>7. 红黑树 Red Black Tree<br>8. 排序二叉堆 Binary Heap<br>9. Splay 树<br>10. 双链树 Double Chained Tree<br>11. Trie 树<br>12. R 树|||
|数组实现的堆<br>Heap|1. 极大堆和极小堆 Max Heap and Min Heap<br>2. 极大极小堆<br>3. 双端堆 Deap<br>4. d 叉堆|||
|树实现的堆<br>Heap|1. 左堆 Leftist Tree/Leftist Heap<br>2. 扁堆<br>3. 二项式堆<br>4. 斐波那契堆 Fibonacco Heap<br>5. 配对堆 Pairing Heap|||
|查找<br>Search|1. 哈希表 Hash<br>2. 跳跃表 Skip List<br>3. 排序二叉树 Binary Sort Tree<br>4. AVL 树<br>5. B 树 / B+ 树 / B* 树<br>6. AA 树<br>7. 红黑树 Red Black Tree<br>8. 排序二叉堆 Binary Heap<br>9. Splay 树<br>10. 双链树 Double Chained Tree<br>11. Trie 树<br>12. R 树|||
|--------------------------------------------|--------------------------------------------------------------------------------------------|---------------------------|-----------------------------------|


Expand Down