Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit b9674df

Browse files
Create 802.py
1 parent f0f274e commit b9674df

File tree

1 file changed

+24
-0
lines changed

1 file changed

+24
-0
lines changed

‎500-1000/802.py‎

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
class Solution:
2+
def eventualSafeNodes(self, graph):
3+
n = len(graph)
4+
state = [0] * n # 0: unvisited, 1: visiting, 2: safe
5+
safe = []
6+
7+
def dfs(node):
8+
if state[node] > 0:
9+
return state[node] == 2 # Return true if already safe
10+
11+
state[node] = 1 # Mark as visiting
12+
13+
for neighbor in graph[node]:
14+
if state[neighbor] == 1 or not dfs(neighbor):
15+
return False # Cycle detected
16+
17+
state[node] = 2 # Mark as safe
18+
return True
19+
20+
for i in range(n):
21+
if dfs(i):
22+
safe.append(i)
23+
24+
return safe

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /