reverse
diff --git a/‎src/0581.Shortest-Unsorted-Continuous-Subarray/Solution.go
Lines changed: 49 additions & 0 deletions b/‎src/0581.Shortest-Unsorted-Continuous-Subarray/Solution.go
Lines changed: 49 additions & 0 deletions
diff --git a/‎src/0581.Shortest-Unsorted-Continuous-Subarray/Solution_test.go
Lines changed: 24 additions & 0 deletions b/‎src/0581.Shortest-Unsorted-Continuous-Subarray/Solution_test.go
Lines changed: 24 additions & 0 deletions
@@ -18,3 +18,52 @@ func Solution(nums []int) int {
 	}
 	return end - start + 1
 }
+
+func Solution2(nums []int) int {
+	n := len(nums)
+	if n < 2 {
+		return 0
+	}
+	l, r := 0, n-1
+	for l < n-1 {
+		if nums[l] > nums[l+1] {
+			break
+		}
+		l++
+	}
+	for r > 0 {
+		if nums[r] < nums[r-1] {
+			break
+		}
+		r--
+	}
+	if l >= r {
+		return 0
+	}
+	mi, ma := math.MaxInt32, math.MinInt32
+	for i := l; i <= r; i++ {
+		mi = min(mi, nums[i])
+		ma = max(ma, nums[i])
+	}
+	for l >= 0 && mi < nums[l] {
+		l--
+	}
+	for r < n && ma > nums[r] {
+		r++
+	return r - l - 1
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
@@ -29,6 +29,30 @@ func TestSolution(t *testing.T) {
 	}
 }
 
+func TestSolution2(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs []int
+		expect int
+	}{
+		{"TestCase", []int{2, 6, 4, 8, 10, 9, 15}, 5},
+		{"TestCase", []int{1, 2, 3, 3, 3}, 0},
+		{"TestCase", []int{1}, 0},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution2(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
 //	压力测试
 func BenchmarkSolution(b *testing.B) {