✨ Added solution to 581

Sathish Babu · Sathish Babu · commit 61bde0b3f189 · 2020-06-05T16:42:12.000+05:30
diff --git a/src/0581.Shortest-Unsorted-Continuous-Subarray/README.md b/src/0581.Shortest-Unsorted-Continuous-Subarray/README.md
@@ -5,11 +5,16 @@
 
 ## Description
 
+Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.
+
+You need to find the shortest such subarray and output its length.
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: [2, 6, 4, 8, 10, 9, 15]
+Output: 5
+Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
 ```
 
 ## 题意
diff --git a/src/0581.Shortest-Unsorted-Continuous-Subarray/Solution.go b/src/0581.Shortest-Unsorted-Continuous-Subarray/Solution.go
@@ -1,5 +1,20 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "math"
+
+func Solution(nums []int) int {
+	start, end, min, max := 0, -1, math.MaxInt32, math.MinInt32
+	for i, j := 0, len(nums)-1; i < len(nums); i, j = i+1, j-1 {
+		if nums[i] >= max {
+			max = nums[i]
+		} else {
+			end = i
+		}
+		if nums[j] <= min {
+			min = nums[j]
+		} else {
+			start = j
+		}
+	}
+	return end - start + 1
 }
diff --git a/src/0581.Shortest-Unsorted-Continuous-Subarray/Solution_test.go b/src/0581.Shortest-Unsorted-Continuous-Subarray/Solution_test.go
@@ -10,12 +10,11 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs []int
+		expect int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", []int{2, 6, 4, 8, 10, 9, 15}, 5},
+		{"TestCase", []int{1, 2, 3, 3, 3}, 0},
 	}
 
 	//	开始测试
