add 1909

fishercoder1534 · fishercoder1534 · commit 4d7e3a4d4cc7 · 2021-06-26T17:19:15.000-07:00
diff --git a/README.md b/README.md
@@ -9,6 +9,7 @@ _If you like this project, please leave me a star._ &#9733;
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
 |1910|[Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) ||Medium|String|
+|1909|[Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1909.java) ||Easy|Array|
 |1904|[The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) ||Medium|String, Greedy|
 |1903|[Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1903.java) ||Easy|Greedy|
 |1897|[Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1897.java) ||Easy|String, Greedy|
diff --git a/src/main/java/com/fishercoder/solutions/_1909.java b/src/main/java/com/fishercoder/solutions/_1909.java
@@ -0,0 +1,25 @@
+package com.fishercoder.solutions;
+
+public class _1909 {
+    public static class Solution1 {
+        /**
+         * credit: https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/discuss/1298827/Java-Short
+         */
+        public boolean canBeIncreasing(int[] nums) {
+            boolean removed = false;
+            for (int i = 1; i < nums.length; i++) {
+                if (nums[i] <= nums[i - 1]) {
+                    if (removed) {
+                        return false;
+                    } else {
+                        removed = true;
+                    }
+                    if (i > 1 && nums[i] <= nums[i - 2]) {
+                        nums[i] = nums[i - 1];
+                    }
+                }
+            }
+            return true;
+        }
+    }
+}
