Package g0601_0700.s0665_non_decreasing_array

Class Solution

java.lang.Object

g0601_0700.s0665_non_decreasing_array.Solution

public class Solution
extends Object

665 - Non-decreasing Array.<p>Medium</p> <p>Given an array <code>nums</code> with <code>n</code> integers, your task is to check if it could become non-decreasing by modifying <strong>at most one element</strong>.</p> <p>We define an array is non-decreasing if <code>nums[i] <= nums[i + 1]</code> holds for every <code>i</code> ( <strong>0-based</strong> ) such that (<code>0 <= i <= n - 2</code>).</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [4,2,3]</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> You could modify the first <code>4</code> to <code>1</code> to get a non-decreasing array.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [4,2,1]</p> <p><strong>Output:</strong> false</p> <p><strong>Explanation:</strong> You can&rsquo;t get a non-decreasing array by modify at most one element.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == nums.length</code></li> <li><code>1 <= n <= 10⁴</code></li> <li><code>-10⁵ <= nums[i] <= 10⁵</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	checkPossibility(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

checkPossibility

public boolean checkPossibility(int[] nums)