Skip to content

Latest commit

 

History

History
27 lines (18 loc) · 599 Bytes

README.md

File metadata and controls

27 lines (18 loc) · 599 Bytes

208.Non-decreasing Array

Description

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).

Example1

Input: [4,2,3]
Output: True
Explanation: You could modify the first 4 to 1 to get a non-decreasing array.

Example2

Input: [4,2,1]
Output: False
Explanation: You can't get a non-decreasing array by modify at most one element.

From

LeetCode