add 3038

fishercoder1534 · fishercoder1534 · commit a2c32b38f748 · 2024-02-17T19:21:17.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_3038.java b/src/main/java/com/fishercoder/solutions/_3038.java
@@ -0,0 +1,22 @@
+package com.fishercoder.solutions;
+
+public class _3038 {
+    public static class Solution1 {
+        public int maxOperations(int[] nums) {
+            int maxOps = 0;
+            if (nums == null || nums.length < 2) {
+                return maxOps;
+            }
+            maxOps++;
+            int sum = nums[0] + nums[1];
+            for (int i = 2; i < nums.length - 1; i += 2) {
+                if (nums[i] + nums[i + 1] == sum) {
+                    maxOps++;
+                } else {
+                    break;
+                }
+            }
+            return maxOps;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_3038Test.java b/src/test/java/com/fishercoder/_3038Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._3038;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _3038Test {
+    private static _3038.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3038.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{2, 2, 3, 2, 4, 2, 3, 3, 1, 3};
+        assertEquals(1, solution1.maxOperations(nums));
+    }
+
+}
