Introduction
Array
Binary Search
Two Pointers
BFS
- 1 Traverse
  Number of Islands
  Clone Gragh
  Number of Distinct Islands
  Pacific Atlantic Water Flow
  Surrounded Regions
  Walls and Gates
  Max Area of Island
- 2 Shortest
  01 Matrix
  Knight Shortest Path
  Shortest Distance from All Buildings
  Best Meet Point
  Shortest Bridge
  Snakes and Ladders
  Bus Route
DFS
Tree
String
Data Structures
Advanced Data Structures
Graph
Dynamic Programming
Common Methods
Design/OOD
Appendix
- Java Built-in
  Comparator
  Stream
  String Pool
- Multithreading
  Synchronized
  Producer-Consumer
  CountDownLatch
  Semaphore
  Thread Pool
  DeadLock
  Inter-thread Communication

Powered by GitBook

5 Memo

其实就是DP，不同写法

PreviousUnique Paths III NextKnight Dialer

Last updated 5 years ago

On this page