add 1389

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1389|[Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1389.java) | |Easy|Array|
 |1388|[Pizza With 3n Slices](https://leetcode.com/problems/pizza-with-3n-slices/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1388.java) | |Hard|DP|
 |1387|[Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1387.java) | |Medium|Sort, Graph|
 |1386|[Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1386.java) | |Medium|Array, Greedy|

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

@@ -0,0 +1,63 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * 1389. Create Target Array in the Given Order
+ *
+ * Given two arrays of integers nums and index. Your task is to create target array under the following rules:
+ * Initially target array is empty.
+ * From left to right read nums[i] and index[i], insert at index index[i] the value nums[i] in target array.
+ * Repeat the previous step until there are no elements to read in nums and index.
+ * Return the target array.
+ *
+ * It is guaranteed that the insertion operations will be valid.
+ *
+ * Example 1:
+ * Input: nums = [0,1,2,3,4], index = [0,1,2,2,1]
+ * Output: [0,4,1,3,2]
+ * Explanation:
+ * nums       index     target
+ * 0            0        [0]
+ * 1            1        [0,1]
+ * 2            2        [0,1,2]
+ * 3            2        [0,1,3,2]
+ * 4            1        [0,4,1,3,2]
+ *
+ * Example 2:
+ * Input: nums = [1,2,3,4,0], index = [0,1,2,3,0]
+ * Output: [0,1,2,3,4]
+ * Explanation:
+ * nums       index     target
+ * 1            0        [1]
+ * 2            1        [1,2]
+ * 3            2        [1,2,3]
+ * 4            3        [1,2,3,4]
+ * 0            0        [0,1,2,3,4]
+ *
+ * Example 3:
+ * Input: nums = [1], index = [0]
+ * Output: [1]
+ *
+ * Constraints:
+ * 1 <= nums.length, index.length <= 100
+ * nums.length == index.length
+ * 0 <= nums[i] <= 100
+ * 0 <= index[i] <= i
+ * */
+public class _1389 {
+    public static class Solution1 {
+        public int[] createTargetArray(int[] nums, int[] index) {
+            List<Integer> list = new ArrayList<>();
+            for (int i = 0; i < nums.length; i++) {
+                list.add(index[i], nums[i]);
+            }
+            int[] target = new int[list.size()];
+            for (int i = 0; i < target.length; i++) {
+                target[i] = list.get(i);
+            }
+            return target;
+        }
+    }
+}

src/test/java/com/fishercoder/_1389Test.java

@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1389;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1389Test {
+    private static _1389.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1389.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{0, 4, 1, 3, 2}, solution1.createTargetArray(new int[]{0, 1, 2, 3, 4}, new int[]{0, 1, 2, 2, 1}));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(new int[]{1, 2, 3, 4, 0}, solution1.createTargetArray(new int[]{0, 1, 2, 3, 0}, new int[]{0, 1, 2, 3, 4}));
+    }
+
+    @Test
+    public void test3() {
+        assertArrayEquals(new int[]{1}, solution1.createTargetArray(new int[]{0}, new int[]{1}));
+    }
+
+}