non-decreasing-array

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array <code>nums</code> with <code>n</code> 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 <code>nums[i] &lt;= nums[i + 1]</code> holds for every <code>i</code> (0-based) such that (<code>0 &lt;= i &lt;= n - 2</code>).

&nbsp;
Example 1:

<pre>
Input: nums = [4,2,3]
Output: true
Explanation: You could modify the first 4 to 1 to get a non-decreasing array.
</pre>

Example 2:

<pre>
Input: nums = [4,2,1]
Output: false
Explanation: You cannot get a non-decreasing array by modifying at most one element.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == nums.length</code></li>
	<li><code>1 &lt;= n &lt;= 104</code></li>
	<li><code>-105 &lt;= nums[i] &lt;= 105</code></li>
</ul>

checkPossibility

Non-decreasing Array

Make Array Non-decreasing or Non-increasing

make-array-non-decreasing-or-non-increasing

数组变为有序的最小操作次数

Find Good Days to Rob the Bank

find-good-days-to-rob-the-bank

适合野炊的日子

Count Non-Decreasing Subarrays After K Operations

count-non-decreasing-subarrays-after-k-operations

统计 K 次操作以内得到非递减子数组的数目

Array

给你一个长度为&nbsp;<code>n</code>&nbsp;的整数数组<meta charset="UTF-8" />&nbsp;<code>nums</code>&nbsp;，请你判断在 最多 改变&nbsp;<code>1</code> 个元素的情况下，该数组能否变成一个非递减数列。

我们是这样定义一个非递减数列的：&nbsp;对于数组中任意的&nbsp;<code>i</code> <code>(0 &lt;= i &lt;= n-2)</code>，总满足 <code>nums[i] &lt;= nums[i + 1]</code>。

&nbsp;

示例 1:

<pre>
输入: nums = [4,2,3]
输出: true
解释: 你可以通过把第一个 4 变成 1 来使得它成为一个非递减数列。
</pre>

示例 2:

<pre>
输入: nums = [4,2,1]
输出: false
解释: 你不能在只改变一个元素的情况下将其变为非递减数列。
</pre>

&nbsp;

提示：
<meta charset="UTF-8" />

<ul>
	<li><code>n == nums.length</code></li>
	<li><code>1 &lt;= n &lt;= 104</code></li>
	<li><code>-105&nbsp;&lt;= nums[i] &lt;= 105</code></li>
</ul>