correct problem # to 1243

fishercoder1534 · fishercoder1534 · commit 169b851854cc · 2019-12-03T06:18:36.000-08:00
diff --git a/README.md b/README.md
@@ -12,7 +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||
+|1243|[Array Transformation](https://leetcode.com/problems/array-transformation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1243.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/_1243.java b/src/main/java/com/fishercoder/solutions/_1243.java
@@ -1,8 +1,6 @@
 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;
 
@@ -37,7 +35,7 @@
  * 1 <= arr.length <= 100
  * 1 <= arr[i] <= 100
  * */
-public class _1234 {
+public class _1243 {
     public static class Solution1 {
         public List<Integer> transformArray(int[] arr) {
             int[] copy;
diff --git a/src/test/java/com/fishercoder/_1243Test.java b/src/test/java/com/fishercoder/_1243Test.java
@@ -1,20 +1,20 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions._1234;
+import com.fishercoder.solutions._1243;
 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;
+public class _1243Test {
+    private static _1243.Solution1 solution1;
     private static int[] arr;
 
     @BeforeClass
     public static void setup() {
-        solution1 = new _1234.Solution1();
+        solution1 = new _1243.Solution1();
     }
 
     @Test
