> For the complete documentation index, see [llms.txt](https://hao-fu-1.gitbook.io/oj/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://hao-fu-1.gitbook.io/oj/array_and_numbers/1389.-create-target-array-in-the-given-order.md).

# 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`

给index和nums两个数组，要求根据index\[i]把nums\[i]放置在新数组的index\[i]位置。每次插入后把后面的元素后移一位。

```python
class Solution:
    def createTargetArray(self, nums: List[int], index: List[int]) -> List[int]:
        res = []
        for num, i in zip(nums, index):
            res.insert(i, num)
        return res
```