1631. Path With Minimum Effort
1631. Path With Minimum Effort
這個題目算是比較變態的一題，但是絕對是面試時間內做得出來的題目，要會這題一定要先做過 875. Koko
Graph
2101. Detonate the Maximum Bombs
2101. Detonate the Maximum Bombs
class Solution:
def maximumDetonation(self,
2368. Reachable Nodes With Restrictions
2368. Reachable Nodes With Restrictions
class Solution:
def reachableNodes(self,
695. Max Area of Island
695. Max Area of Island
class Solution:
def maxAreaOfIsland(self,
841. Keys and Rooms
841. Keys and Rooms
透過拿到的鑰匙來造訪後面的房間，是圖形搜索的一種問題。
class Solution:
def canVisitAllRooms(
1466. Reorder Routes to Make All Paths Lead to the City Zero
1466. Reorder Routes to Make All Paths Lead to the
1584. Min Cost to Connect All Points
這一題如果不用 UnionFind 的確會有點難做。
class UnionFind:
def __init__(self, size):
self.
1091. Shortest Path in Binary Matrix
1091. Shortest Path in Binary Matrix
可以先練習這些題目
* 200. Number of
787. Cheapest Flights Within K Stops
787. Cheapest Flights Within K Stops
這一題的考點
1. 在 BFS
399. Evaluate Division
399. Evaluate Division
class Solution:
def calcEquation(self, equations: List[