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].
题解:
此题我们需要明确一点,对此数组遍历一遍,如果发现当前元素的值比后面的那个元素的值要大,就记录下相关的次数和位置,如果出现这种次数大于等于两次,那么就直接返回false,表明已经不可能是true了。否则当出现的次数为1时,我们需要继续考虑4种情况:
针对[3,4,2,3]这个数组,
1)4变成它前面的3,那么需要判断变为新数组[3,3,2,3],是否满足要求;
2)4变成它后面的2,那么需要判断变为新数组[3,2,2,3],是否满足要求;
3)2变成它前面的4,那么需要判断变为新数组[3,4,4,3],是否满足要求;
4)2变成它后面的3,那么需要判断变为新数组[3,4,3,3],是否满足要求。
当然前提是4的位置不能是0或者是倒数第2个位置,如果是0,那么直接将其变成后面的那个数-1;如果是倒数第2个数,直接将其后面的那个数变成它即可。
完成上述4种情况的分析后,就可以写出代码了,此题考虑的就是逻辑的严密性和完整性。
public class checkPossibility
{
public static boolean checkPossibility(int[] nums)
{
int length = nums.length;
if(length == 0 || length == 1)
return true;
int time = 0;
int curr = 0;
for(int i = 0; i <= length - 2; i++)
{
if(nums[i] > nums[i + 1])
{
time += 1;
curr = i;
if (time == 2)
return false;
}
else
continue;
}
if(time == 1)
{
if(curr > 0 && curr < length - 2)
{
int m1 = nums[curr - 1];
int m2 = nums[curr + 1];
int m3 = nums[curr];
int m4 = nums[curr + 2];
if(nums[curr + 1] >= m1)
return true;
if(nums[curr - 1] <= m2)
return true;
if(m3 <= nums[curr + 2])
return true;
if(nums[curr] <= m4)
return true;
return false;
}
}
return true;
}
}