✨ Added solution to 665

Sathish Babu · Sathish Babu · commit 40ca759eb699 · 2020-06-05T19:10:30.000+05:30
diff --git a/src/0665.Non-decreasing-Array/README.md b/src/0665.Non-decreasing-Array/README.md
@@ -5,11 +5,25 @@
 
 ## Description
 
+Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.
+
+We define an array is non-decreasing if nums[i] <= nums[i + 1] holds for every i (0-based) such that (0 <= i <= n - 2).
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: nums = [4,2,3]
+Output: true
+Explanation: You could modify the first 4 to 1 to get a non-decreasing array.
+```
+
+**Example 2:**
+
+```
+Input: nums = [4,2,1]
+Output: false
+Explanation: You can't get a non-decreasing array by modify at most one element.
+
 ```
 
 ## 题意
diff --git a/src/0665.Non-decreasing-Array/Solution.go b/src/0665.Non-decreasing-Array/Solution.go
@@ -1,5 +1,18 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(nums []int) bool {
+	c := 0
+	for i := 0; i < len(nums)-1; i++ {
+		if nums[i] > nums[i+1] {
+			if i > 0 {
+				if nums[i-1] <= nums[i+1] {
+					nums[i] = nums[i-1]
+				} else {
+					nums[i+1] = nums[i]
+				}
+			}
+			c++
+		}
+	}
+	return c <= 1
 }
diff --git a/src/0665.Non-decreasing-Array/Solution_test.go b/src/0665.Non-decreasing-Array/Solution_test.go
@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
+		inputs []int
 		expect bool
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", []int{4, 2, 3}, true},
+		{"TestCase", []int{4, 2, 1}, false},
+		{"TestCase", []int{1, 2, 5, 4}, true},
 	}
 
 	//	开始测试
