LeetCode 2970. 统计移除递增子数组的数目 I
原题链接
简单
作者:
autumn_0
,
2024-07-12 00:08:03
,
所有人可见
,
阅读 3
class Solution {
public:
int incremovableSubarrayCount(vector<int>& nums) {
int n = nums.size();
int res = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (isIncreasing(nums, i, j)) {
res++;
}
}
}
return res;
}
bool isIncreasing(vector<int>& nums, int l, int r) {
for (int i = 1; i < nums.size(); i++) {
if (i >= l && i <= r + 1) {
continue;
}
if (nums[i] <= nums[i - 1]) {
return false;
}
}
if (l - 1 >= 0 && r + 1 < nums.size() && nums[r + 1] <= nums[l - 1]) {
return false;
}
return true;
}
};