1976. 到达目的地的方案数
Medium | Dynamic Programming, Graph Theory, Topological Sort, Shortest Path
Medium | Dynamic Programming, Graph Theory, Topological Sort, Shortest Path
Hard | Breadth-First Search, Graph Theory, Shortest Path
Medium | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Medium | Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Path
Medium | Binary Search, Depth-First Search, Breadth-First Search, Graph Theory, Shortest Path
Hard | Array, Bit Manipulation, Graph Theory, Heap (Priority Queue), Shortest Path, Bitmask
Medium | Graph Theory, Heap (Priority Queue), Shortest Path
Hard | Array, Binary Search, Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path
Medium | Graph Theory, Heap (Priority Queue), Shortest Path
Medium | Array, String, Graph Theory, Shortest Path
Hard | Array, String, Dynamic Programming, Graph Theory, Trie, Shortest Path
Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path
Hard | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path
Hard | Graph Theory, Design, Heap (Priority Queue), Shortest Path
Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path
Hard | Graph Theory, Heap (Priority Queue), Shortest Path
Hard | Bit Manipulation, Graph Theory, Heap (Priority Queue), Enumeration, Shortest Path
Hard | Graph Theory, Heap (Priority Queue), Shortest Path