1
class Solution {
2
  public boolean canBeIncreasing(int[] nums) {
3
    int count = 0;
4
    int p = 0;
5
    for (int i = 0; i < nums.length - 1; i++) {
6
      if (nums[i] > nums[i + 1] || nums[i] == nums[i + 1]) {
7
        count++;
8
        p = i;
9
      }
10
    }
11
    if (count > 1) return false;
12
    else if (count == 1) {
13
      if (p == 0 || p == nums.length - 2) return true;
14
      if (nums[p + 1] > nums[p - 1] || nums[p + 2] > nums[p]) return true;
15
      else return false;
16
    }
17
    return true;
18
  }
19
}