# leetcode\_1389

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

## Solutions

1. **straight forward**

```cpp
class Solution {
public:
    vector<int> createTargetArray(vector<int>& nums, vector<int>& index) {
        vector<int> res; res.reserve(nums.size());

        // for (int i = 0; i < nums.size(); i++)
        //     res.insert(res.begin() + index[i], nums[i]);

        for (int i = 0; i < nums.size(); i++) {
            res.push_back(0);
            for (int j = i; j > index[i]; j--)
                res[j] = res[j - 1];
            res[index[i]] = nums[i];
        }

        return res;
    }
};
```