add 1646

Author: fishercoder1534

README.md

@@ -11,6 +11,7 @@ _If you like this project, please leave me a star._ ★
 |1657|[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1657.java) ||Medium|Greedy|
 |1656|[Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1656.java) ||Easy|Array, Design|
 |1652|[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1652.java) ||Easy|Array|
+|1646|[Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1646.java) ||Easy|Array|
 |1640|[Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1640.java) ||Easy|Array, Sort|
 |1637|[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/)|[Javascript](./javascript/_1637.js)| | Medium | Sort |
 |1636|[Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1636.java) ||Easy|Array, Sort|

src/main/java/com/fishercoder/solutions/_1646.java

@@ -0,0 +1,24 @@
+package com.fishercoder.solutions;
+
+public class _1646 {
+    public static class Solution1 {
+        public int getMaximumGenerated(int n) {
+            if (n == 0) {
+                return 0;
+            }
+            int[] nums = new int[n + 1];
+            nums[0] = 0;
+            nums[1] = 1;
+            int max = 1;
+            for (int i = 1; i <= n / 2; i++) {
+                nums[(i * 2)] = nums[i];
+                max = Math.max(max, nums[i]);
+                if ((i * 2) + 1 <= n) {
+                    nums[(i * 2) + 1] = nums[i] + nums[i + 1];
+                    max = Math.max(max, nums[(i * 2) + 1]);
+                }
+            }
+            return max;
+        }
+    }
+}

src/test/java/com/fishercoder/_1646Test.java

@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1646;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1646Test {
+    private static _1646.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1646.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.getMaximumGenerated(3));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(1, solution1.getMaximumGenerated(2));
+    }
+
+}