| English | 简体中文 |
Given an array
n integers, your task is to check if it could become non-decreasing by modifying at most
We define an array is non-decreasing if
nums[i] <= nums
[i + 1] holds for every
i (0-based) such that
(0 <= i <= n - 2).
Input: nums = [4,2,3] Output: true Explanation: You could modify the first
1to get a non-decreasing array.
Input: nums = [4,2,1] Output: false Explanation: You can't get a non-decreasing array by modify at most one element.
1 <= n <= 10 ^ 4
- 10 ^ 5 <= nums[i] <= 10 ^ 5