Time: 0 ms (100%), Space: 18 MB (13.08%) - LeetHub

Author: hogan-tech

1552-build-an-array-with-stack-operations/1552-build-an-array-with-stack-operations.py

@@ -0,0 +1,28 @@
+#time complexity: O(n)
+#space complexity: O(1)
+from typing import List
+
+
+class Solution:
+    def buildArray(self, target: List[int], n: int) -> List[str]:
+        result = []
+        idx = 0
+        for item in target:
+            while idx < item - 1:
+                result.append("Push")
+                result.append("Pop")
+                idx += 1
+            result.append("Push")
+            idx += 1
+        return result
+
+
+target = [1, 3]
+n = 3
+print(Solution().buildArray(target, n))
+target = [1, 2, 3]
+n = 3
+print(Solution().buildArray(target, n))
+target = [1, 2]
+n = 4
+print(Solution().buildArray(target, n))