solved(python): programmers

- 연습문제 / 뒤에 있는 큰 수 찾기

Author: himitery

programmers/python/연습문제/뒤에_있는_큰_수_찾기/__init__.py

@@ -0,0 +1,17 @@
+from typing import List
+
+
+def solution(numbers: List[int]) -> List[int]:
+    n = len(numbers)
+    stack, results = [], [-1] * n
+
+    for idx in range(n - 1, -1, -1):
+        while stack and stack[-1] <= numbers[idx]:
+            stack.pop()
+
+        if stack:
+            results[idx] = stack[-1]
+
+        stack.append(numbers[idx])
+
+    return results

programmers/python/연습문제/뒤에_있는_큰_수_찾기/main.py

@@ -0,0 +1,38 @@
+[
+  {
+    "params": [
+      [
+        2,
+        3,
+        3,
+        5
+      ]
+    ],
+    "expected": [
+      3,
+      5,
+      5,
+      -1
+    ]
+  },
+  {
+    "params": [
+      [
+        9,
+        1,
+        5,
+        3,
+        6,
+        2
+      ]
+    ],
+    "expected": [
+      -1,
+      5,
+      6,
+      6,
+      -1,
+      -1
+    ]
+  }
+]

programmers/python/연습문제/뒤에_있는_큰_수_찾기/sample.json

@@ -0,0 +1,28 @@
+import json
+import os
+import unittest
+
+from parameterized import parameterized
+
+from .main import solution
+
+
+def load_sample(filename: str):
+    path = os.path.join(os.path.dirname(os.path.abspath(__file__)), filename)
+
+    with open(path, "r") as file:
+        return [(case["params"], case["expected"]) for case in json.load(file)]
+
+
+class TestCase(unittest.TestCase):
+    @parameterized.expand(load_sample("sample.json"))
+    def test_case(self, params: list, expected: any):
+        # When
+        result = solution(*params)
+
+        # Then
+        self.assertEqual(expected, result)
+
+
+if __name__ == "__main__":
+    unittest.main()