Time: 155 ms (79.93%), Space: 17.8 MB (85.91%) - LeetHub

Author: RootProgrammer

0581-shortest-unsorted-continuous-subarray/0581-shortest-unsorted-continuous-subarray.py

@@ -0,0 +1,22 @@
+class Solution:
+    def findUnsortedSubarray(self, nums: List[int]) -> int:
+        size = len(nums)
+        current = nums[0]
+        end = 0
+
+        for index in range(1, size):
+            if nums[index] < current:
+                end = index
+            else:
+                current = nums[index]
+
+        current = nums[-1]
+        start = 0
+
+        for index in range(size - 2, -1, -1):
+            if nums[index] > current:
+                start = index
+            else:
+                current = nums[index]
+
+        return end - start + 1 if end != start else 0