feat: [LeetCode #649] Dota2 Seante (#36)

* feat: [LeetCode #649] Dota2 Seante
Тип: Queue
Сложность: medium
Временная сложность: O(n)
Пространственная сложность: O(n)

-

Ссылка: https://leetcode.com/problems/decode-string/

Author: onixlas

src/queue/dota2_senate/__init__.py

@@ -0,0 +1,26 @@
+from collections import deque
+
+
+class Solution:
+    def predictPartyVictory(self, senate: str) -> str:
+        radiant_queue = deque()
+        dire_queue = deque()
+
+        length = len(senate)
+
+        for i in range(length):
+            if senate[i] == "R":
+                radiant_queue.append(i)
+            else:
+                dire_queue.append(i)
+
+        while radiant_queue and dire_queue:
+            radiant = radiant_queue.popleft()
+            dire = dire_queue.popleft()
+
+            if radiant < dire:
+                radiant_queue.append(radiant + length)
+            else:
+                dire_queue.append(dire + length)
+
+        return "Radiant" if radiant_queue else "Dire"

src/queue/dota2_senate/solution.py

@@ -0,0 +1,11 @@
+import pytest
+from src.queue.dota2_senate.solution import Solution
+
+
+@pytest.mark.parametrize(
+    "senate, expected",
+    [("RD", "Radiant"), ("RDD", "Dire")],
+)
+def test_predict_party_victory(senate, expected):
+    solution = Solution()
+    assert solution.predictPartyVictory(senate) == expected