1
class Solution {
2
public:
3
bool canBeIncreasing(vector<int> &nums) {
4
int count = 0;
5
for (int i = 1; i < nums.size(); ++i) {
6
if (nums[i] <= nums[i - 1]) {
7
if (count == 1) return false;
8
count++;
9
if (i > 1 && nums[i] <= nums[i - 2]) nums[i] = nums[i - 1];
10
}
11
}
12
return true;
13
}
14
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0