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 1 element.

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 cnt = 0;
        vector<int> d;      
        for(int i = 0; i < nums.size() - 1; i++){
            int t = nums[i + 1] - nums[i];
            if(t < 0) cnt++;
            d.push_back(t);
        }
        if(cnt > 1) return false;
        if(!d.empty()){
            for(int i = 1; i < d.size() - 1; i++){
                if(d[i] < 0 && abs(d[i]) > abs(d[i - 1]) && abs(d[i]) > abs(d[i + 1]))
                   return false;
            }        
        }
        return true;
    }
};