Skip to content

Commit db753dc

Browse files
authored
Update Readme.md
1 parent 90dc078 commit db753dc

1 file changed

Lines changed: 3 additions & 0 deletions

File tree

  • Dynamic_Programming/1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing

Dynamic_Programming/1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing/Readme.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -20,3 +20,6 @@
2020
如果当前元素大于maxUsed,那么maxUsed就可以在原先的maxUsed基础上更新。另外,我们也可以删除当前的元素,那么maxUsed就继承maxNon。这两个方案我们取较小的那个,目的是为了便于后续第增序列的延长。
2121

2222
最终maxNon或者maxUsed任意一个为非无穷大的话,说明有解。
23+
24+
#### 解法3:
25+
利用nlogn解法,求原数组里的longest increasing subsequence,看看长度是否大于等于 nums.size()-1.

0 commit comments

Comments
 (0)