665. Non-decreasing Array
Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most one element.
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).
Example 1:
Input: nums = [4,2,3] Output: true Explanation: You could modify the first 4 to 1 to get a non-decreasing array.
Example 2:
Input: nums = [4,2,1] Output: false Explanation: You cannot get a non-decreasing array by modifying at most one element.
Constraints:
n == nums.length1 <= n <= 104-105 <= nums[i] <= 105
GoogleTopics
Loading editor…
1class Solution:
2 def checkPossibility(self, nums: List[int]) -> bool:
3
Starter codePython 3Spaces: 4
Loading editor…
1class Solution:
2 def checkPossibility(self, nums: List[int]) -> bool:
3
Starter codePython 3Spaces: 4
Examples
Input
[4,2,3]
Input
[4,2,1]
Your code is saved on this device.Solution