Time: 0 ms (100%), Space: 17.6 MB (90.64%) - LeetHub

Author: hogan-tech

1009-pancake-sorting/1009-pancake-sorting.py

@@ -0,0 +1,19 @@
+# time complexity: O(n^2)
+# space complexity: O(n)
+from typing import List
+
+
+class Solution:
+    def pancakeSort(self, arr: List[int]):
+        result = []
+        for lastIdx in range(len(arr), 1, -1):
+            currIdx = arr.index(lastIdx)
+            result.extend([currIdx + 1, lastIdx])
+            arr = arr[:currIdx:-1] + arr[:currIdx]
+        return result
+
+
+arr = [3, 2, 4, 1]
+print(Solution().pancakeSort(arr))
+arr = [1, 2, 3]
+print(Solution().pancakeSort(arr))