mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
43 lines
1.6 KiB
HTML
43 lines
1.6 KiB
HTML
<p>Given a <strong>0-indexed</strong> integer array <code>nums</code>, return <code>true</code> <em>if it can be made <strong>strictly increasing</strong> after removing <strong>exactly one</strong> element, or </em><code>false</code><em> otherwise. If the array is already strictly increasing, return </em><code>true</code>.</p>
|
|
|
|
<p>The array <code>nums</code> is <strong>strictly increasing</strong> if <code>nums[i - 1] < nums[i]</code> for each index <code>(1 <= i < nums.length).</code></p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,2,<u>10</u>,5,7]
|
|
<strong>Output:</strong> true
|
|
<strong>Explanation:</strong> By removing 10 at index 2 from nums, it becomes [1,2,5,7].
|
|
[1,2,5,7] is strictly increasing, so return true.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [2,3,1,2]
|
|
<strong>Output:</strong> false
|
|
<strong>Explanation:</strong>
|
|
[3,1,2] is the result of removing the element at index 0.
|
|
[2,1,2] is the result of removing the element at index 1.
|
|
[2,3,2] is the result of removing the element at index 2.
|
|
[2,3,1] is the result of removing the element at index 3.
|
|
No resulting array is strictly increasing, so return false.</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,1,1]
|
|
<strong>Output:</strong> false
|
|
<strong>Explanation:</strong> The result of removing any element is [1,1].
|
|
[1,1] is not strictly increasing, so return false.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= nums.length <= 1000</code></li>
|
|
<li><code>1 <= nums[i] <= 1000</code></li>
|
|
</ul>
|