Skip to content

Latest commit

 

History

History
33 lines (25 loc) · 723 Bytes

File metadata and controls

33 lines (25 loc) · 723 Bytes

Implement the most common data structures and algorithms from scratch.

Implement Data Structures

  • Design Singly Linked List ✅
  • Design Double Linked List ✅
  • Design Double-ended Queue
  • Design LRU ✅
    • way1: 利用Map结构
    • way2: hash表+双向链表
  • Design Hash Table(Medium)
  • Design Binary Search Tree(Medium)
  • Design Heap(Medium)
  • Design Graph(Medium)
  • Design Disjoint Set (Union-Find)(Medium)
  • Design Segment Tree(Hard)

Sorting ✅

  • Insertion Sort
  • Merge Sort
  • Quick Sort

队列

  • 优先队列 new PQueue(comparisonFunc)

Graphs

  • Design Graph 邻接表
  • Design Graph 邻接矩阵
  • 矩阵DFS搜索:Matrix Depth-First Search
  • 矩阵BFS搜索:Matrix Breadth-First Search