OJ
search
⌘Ctrlk
OJ
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
    • Employee Importance
    • Remove Invalid Parentheses
    • Word Ladder II
    • 773. Sliding Puzzle
    • 407. Trapping Rain Water II
    • Level-order Traversal
    • Letter Combinations of a Phone Number
    • 1197. Minimum Knight Moves
    • 247. Strobogrammatic Number II
    • 1298. Maximum Candies You Can Get from Boxes
    • 1311. Get Watched Videos by Your Friends
    • 1391. Check if There is a Valid Path in a Grid
    • 815. Bus Routes
    • 扫格
      • Walls and Gates
      • Minesweeper
      • 01 Matrix
      • 1293. Shortest Path with Obstacles Elimination
      • Pacific Atlantic Water Flow
      • The Maze II
      • The Maze
      • The Maze III
      • 1036. Escape a Large Maze
      • 317. Shortest Distance from All Buildings
    • Topological Sort
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Breadth-first Search

扫格

Walls and Gateschevron-rightMinesweeperchevron-right01 Matrixchevron-right1293. Shortest Path with Obstacles Eliminationchevron-rightPacific Atlantic Water Flowchevron-rightThe Maze IIchevron-rightThe Mazechevron-rightThe Maze IIIchevron-right1036. Escape a Large Mazechevron-right317. Shortest Distance from All Buildingschevron-right
Previous815. Bus Routeschevron-leftNextWalls and Gateschevron-right

Last updated 6 years ago