Create Longest Strictly Increasing or Strictly Decreasing Subarray.java

varunu28 · web-flow · commit 540318b7d929 · 2025-02-03T09:25:47.000-08:00
diff --git a/Easy/Longest Strictly Increasing or Strictly Decreasing Subarray.java b/Easy/Longest Strictly Increasing or Strictly Decreasing Subarray.java
@@ -0,0 +1,22 @@
+class Solution {
+    public int longestMonotonicSubarray(int[] nums) {
+        int max = 1;
+        int idx = 0;
+        int n = nums.length;
+        while (idx < n) {
+            if (idx == n - 1 || nums[idx + 1] == nums[idx]) {
+                idx++;
+                continue;
+            }
+            boolean increase = nums[idx + 1] > nums[idx];
+            int start = idx;
+            while (idx + 1 < n && (
+                (increase && nums[idx + 1] > nums[idx]) || 
+                (!increase && nums[idx + 1] < nums[idx]))) {
+                idx++;
+            }
+            max = Math.max(max, idx - start + 1);
+        }
+        return max;
+    }
+}
