Medium
Minimum Prefix Removal to Make Array Strictly Increasing — C++
Full explanation · Time O(n) · Space O(1)
// Time: O(n)
// Space: O(1)
// array
class Solution {
public:
int minimumPrefixLength(vector<int>& nums) {
for (int i = size(nums) - 2; i >= 0; --i) {
if (!(nums[i] < nums[i + 1])) {
return i + 1;
}
}
return 0;
}
};