Create 3105. Longest Strictly Increasing or Strictly Decreasing Subarray (#705)

Author: Chayandas07

3105. Longest Strictly Increasing or Strictly Decreasing Subarray

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int longestMonotonicSubarray(vector<int>& nums) {
+        int res = 1, low = 1, high = 1;
+        for (int i = 1; i < nums.size(); i++){
+            if (nums[i] > nums[i - 1]){
+                high++;
+                low = 1;
+            }
+            else if (nums[i] < nums[i - 1]){
+                low++;
+                high = 1;
+            }
+            else{
+                low = 1;
+                high = 1;
+            }
+            res = max({res, low, high});
+        }
+        return res;
+    }
+};