最长递增子序列的变形：选或不选/枚举选哪个（Python/Java/C++/Go）
Metadata
- Author: 力扣 LeetCode
- Full Title: 最长递增子序列的变形：选或不选/枚举选哪个（Python/Java/C++/Go）
- Category: articles
- URL: https://leetcode.cn/problems/make-array-strictly-increasing/solution/zui-chang-di-zeng-zi-xu-lie-de-bian-xing-jhgg/
Highlights
- for (int i = 1; i < b.length; ++i) if (b[m] != b[i]) b[++m] = b[i]; // 原地去重 (View Highlight)