Mid/SeniorArray

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 as non-decreasing if nums[i] <= nums[i + 1] holds for every i (0-based) such that 0 <= i <= n - 2.

Example 1
Inputnums = [4,2,3]
Outputtrue
You could modify the first 4 to 1 to get a non-decreasing array.
Example 2
Inputnums = [4,2,1]
Outputfalse
You cannot get a non-decreasing array by modifying at most one element.

Constraints

  • n == nums.length
  • 1 <= n <= 10^4
  • -10^5 <= nums[i] <= 10^5

Asked at 6 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate