add 1234

fishercoder1534 · fishercoder1534 · commit 5f605679353a · 2019-12-02T21:27:00.000-08:00
diff --git a/README.md b/README.md
@@ -12,6 +12,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1260|[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1260.java) |  |  | [:tv:](https://www.youtube.com/watch?v=9hBcARSiU0s)|Easy||
 |1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | O(m*n + k) | O(m*n) | |Easy||
 |1237|[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1237.java) | | | |Easy||
+|1234|[Array Transformation](https://leetcode.com/problems/array-transformation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1234.java) |  |  | |Easy||
 |1217|[Play with Chips](https://leetcode.com/problems/play-with-chips/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) |  |  | |Easy||
 |1213|[Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1213.java) |  |  | [:tv:](https://www.youtube.com/watch?v=zceoOrHSHNQ)|Easy||
 |1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) | O(n) | O(1) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1234.java b/src/main/java/com/fishercoder/solutions/_1234.java
@@ -0,0 +1,59 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.List;
+import java.util.stream.Collectors;
+
+/**
+ * 1243. Array Transformation
+ *
+ * Given an initial array arr, every day you produce a new array using the array of the previous day.
+ *
+ * On the i-th day, you do the following operations on the array of day i-1 to produce the array of day i:
+ *
+ * If an element is smaller than both its left neighbor and its right neighbor, then this element is incremented.
+ * If an element is bigger than both its left neighbor and its right neighbor, then this element is decremented.
+ * The first and last elements never change.
+ * After some days, the array does not change. Return that final array.
+ *
+ * Example 1:
+ * Input: arr = [6,2,3,4]
+ * Output: [6,3,3,4]
+ * Explanation:
+ * On the first day, the array is changed from [6,2,3,4] to [6,3,3,4].
+ * No more operations can be done to this array.
+ *
+ * Example 2:
+ * Input: arr = [1,6,3,4,3,5]
+ * Output: [1,4,4,4,4,5]
+ * Explanation:
+ * On the first day, the array is changed from [1,6,3,4,3,5] to [1,5,4,3,4,5].
+ * On the second day, the array is changed from [1,5,4,3,4,5] to [1,4,4,4,4,5].
+ * No more operations can be done to this array.
+ *
+ * Constraints:
+ * 1 <= arr.length <= 100
+ * 1 <= arr[i] <= 100
+ * */
+public class _1234 {
+    public static class Solution1 {
+        public List<Integer> transformArray(int[] arr) {
+            int[] copy;
+            do {
+                copy = Arrays.copyOf(arr, arr.length);
+                for (int i = 1; i < arr.length - 1; i++) {
+                    if (copy[i] < copy[i - 1] && copy[i] < copy[i + 1]) {
+                        arr[i]++;
+                    } else if (copy[i] > copy[i - 1] && copy[i] > copy[i + 1]) {
+                        arr[i]--;
+                    }
+                }
+            } while (!Arrays.equals(copy, arr));
+            return Arrays.stream(arr)
+                    .boxed()
+                    .collect(Collectors.toList());
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1234Test.java b/src/test/java/com/fishercoder/_1234Test.java
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1234;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static junit.framework.TestCase.assertTrue;
+
+public class _1234Test {
+    private static _1234.Solution1 solution1;
+    private static int[] arr;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1234.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        arr = new int[]{6, 2, 3, 4};
+        assertTrue(solution1.transformArray(arr).equals(Arrays.asList(6, 3, 3, 4)));
+    }
+
+    @Test
+    public void test2() {
+        arr = new int[]{1, 6, 3, 4, 3, 5};
+        assertTrue(solution1.transformArray(arr).equals(Arrays.asList(1, 4, 4, 4, 4, 5)));
+    }
+
+}
