[leetcode] 665. Non-decreasing Array

题目：

Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1element.

We define an array is non-decreasing if array[i] <= array[i + 1] holds for every i (1 <= i < n).

Example 1:

Input: [4,2,3]
Output: True
Explanation: You could modify the first 4 to 1 to get a non-decreasing array.

Example 2:

Input: [4,2,1]
Output: False
Explanation: You can't get a non-decreasing array by modify at most one element.

Note: The n belongs to [1, 10,000].

代码：

class Solution {
public:
    bool checkPossibility(vector<int>& nums) {
        int i = 0;
        int j = nums.size()-1;
        while(i < nums.size() - 1 && nums[i] <= nums[i+1]) i++;
        while(j > 0 && nums[j] >= nums[j-1]) j--;
        if(j <= i) return true;
        if(j != i+1) return false;
        if((j+1 < nums.size() && nums[i] <= nums[j+1] || j+1>=nums.size()) || (i-1>=0 && nums[i-1] < nums[j]) || i-1<0) return true;
        else return false;
    }
};