fix: add solution files to lc problem: No.0581.Shortest Unsorted Continuous Subarray

Author: maolonglong

solution/0500-0599/0581.Shortest Unsorted Continuous Subarray/Solution.go

@@ -0,0 +1,21 @@
+func findUnsortedSubarray(nums []int) int {
+	n := len(nums)
+	maxn, minn := math.MinInt32, math.MaxInt32
+	left, right := -1, -1
+	for i := 0; i < n; i++ {
+		if maxn > nums[i] {
+			right = i
+		} else {
+			maxn = nums[i]
+		}
+		if minn < nums[n-i-1] {
+			left = n - i - 1
+		} else {
+			minn = nums[n-i-1]
+		}
+	}
+	if right == -1 {
+		return 0
+	}
+	return right - left + 1
+}

solution/0500-0599/0581.Shortest Unsorted Continuous Subarray/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def findUnsortedSubarray(self, nums: List[int]) -> int:
+        n = len(nums)
+        numsSorted = sorted(nums)
+        left, right = 0, n - 1
+        while left < n and nums[left] == numsSorted[left]:
+            left += 1
+        while right >= 0 and nums[right] == numsSorted[right]:
+            right -= 1
+        return 0 if right == -1 else right - left + 1