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.class Solution { public boolean checkPossibility(int[] nums) { int modifyCount = 0; for(int i = 1; i < nums.length; i++) { if(nums[i - 1] > nums[i]) { modifyCount++; if(modifyCount>1) return false; if(i - 2 >= 0 && nums[i - 2] > nums[i]) { nums[i] = nums[i - 1]; } else { nums[i - 1] = nums[i]; } } } return true; } }
近期评论