LeetCode-665：Non-decreasing Array (判断是否为非递减数组)

Question

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].

问题解析：

给定数组，判断是否能够只修改一个元素，就可以使得数组是非递减数组，即对每个元素均有array[i] <= array[i + 1]。

Answer

Solution 1：

贪心思想求解。

• 首先题目比较明确，但是却容易出错。找到array[i] > array[i+1]的情况时，需要对二者进行修改，要么修改array[i]，要么修改array[i+1]，如：[3,5,2,4]，如不修改，则判断为真，实则为假；
• 具体是对array[i]做修改还是对array[i+1]做修改，需要判断array[i-1]和array[i+1]两者的大小，具体分两种情况
• 情况一：[2,5,3,4]，当i=1时，array[i]=5，此时array[i-1]=2 < array[i+1]=3，则需修改“5”为“3”，即令array[i]=array[i+1]，则保证数组返回真；
• 情况二：[4,5,3,7]，当i=1时，array[i]=5，此时array[i-1]=4 > array[i+1]=3，则需修改“3”为“5”，即令array[i+1]=array[i]，则保证数组返回真；
• 加入count<=1的判断条件在遍历循环中，只要数组中出现两次修改，则退出，避免后面不必要的计算。

class Solution {
    public boolean checkPossibility(int[] nums) {
        int count = 0;
        for (int i = 0; i < nums.length-1 && count <= 1; i++){
            if (nums[i] > nums[i+1]){
                count++;
                if (i-1 < 0 || nums[i-1] <= nums[i+1]) nums[i] = nums[i+1];
                else nums[i+1] = nums[i];
            }
        }

        return count <= 1;
    }
}

• 时间复杂度：O(n)，空间复杂度：O(1)