_1909.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1909 {
publicstaticclassSolution1 {
/*
 * credit: https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/discuss/1298827/Java-Short
 */
publicbooleancanBeIncreasing(int[] nums) {
booleanremoved = false;
for (inti = 1; i < nums.length; i++) {
if (nums[i] <= nums[i - 1]) {
if (removed) {
returnfalse;
 } else {
removed = true;
 }
if (i > 1 && nums[i] <= nums[i - 2]) {
nums[i] = nums[i - 1];
 }
 }
 }
returntrue;
 }
 }
}