class Solution:
def predictPartyVictory(self, senate: str) -> str:
r_q = deque()
d_q = deque()
for i, s in enumerate(senate):
if s == "R":
r_q.append(i)
else:
d_q.append(i)
while r_q and d_q:
d = d_q.popleft()
r = r_q.popleft()
if d < r:
d_q.append(d+len(senate))
else:
r_q.append(r+len(senate))
return "Dire" if d_q else "Radiant"
https://youtu.be/zZA5KskfMuQ?si=T9Gxrx1PE66ynrsr
'LeetCode > LeetCode75' 카테고리의 다른 글
| 206. Reverse Linked List (0) | 2024.11.15 |
|---|---|
| [LeetCode 75] Medium - 2095. Delete the Middle Node of a Linked List (0) | 2024.11.15 |
| [LeetCode 75] Easy - 933. Number of Recent Calls (0) | 2024.11.14 |
| [LeetCode 75] Medium - 2352. Equal Row and Column Pairs (0) | 2024.11.14 |
| [LeetCode 75] Easy - 643. Maximum Average Subarray I (0) | 2024.11.12 |