# LeetCode - 0665. Non-decreasing Array
### 題目網址：https://leetcode.com/problems/non-decreasing-array/
###### tags: `LeetCode` `Medium`

/*
    -LeetCode format-
    Problem: 665. Non-decreasing Array
    Difficulty: Medium
    
    by Inversionpeter
*/



class Solution {
public:
    bool checkPossibility(vector<int>& nums) {
        int fail = -1;
        for (int i = 1; i != nums.size(); ++i)
            if (nums[i - 1] > nums[i]) {
                if (fail != -1)
                    return false;
                fail = i;
            }
        return fail == -1 || fail == 1 || fail == nums.size() - 1 || nums[fail - 2] <= nums[fail] || nums[fail - 1] <= nums[fail + 1];
    }
};