add 1470

fishercoder1534 · fishercoder1534 · commit bd7b9bba07a4 · 2020-06-07T10:11:44.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java) | |Easy|Array|
 |1466|[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) | |Medium|Tree, DFS|
 |1464|[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1464.java) | |Easy|Array|
 |1460|[Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1460.java) | |Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1470.java b/src/main/java/com/fishercoder/solutions/_1470.java
@@ -0,0 +1,14 @@
+package com.fishercoder.solutions;
+
+public class _1470 {
+    public static class Solution1 {
+        public int[] shuffle(int[] nums, int n) {
+            int[] result = new int[nums.length];
+            for (int i = 0, j = 0; i < n && j < 2 * n; i++, j++) {
+                result[j] = nums[i];
+                result[++j] = nums[i + n];
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1470Test.java b/src/test/java/com/fishercoder/_1470Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1470;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1470Test {
+    private static _1470.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1470.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{2, 5, 1, 3, 4, 7};
+        assertArrayEquals(new int[]{2, 3, 5, 4, 1, 7}, solution1.shuffle(nums, 3));
+    }
+
+}
