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 valuenums[i]in target array. - Repeat the previous step until there are no elements to read in
numsandindex.
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 target0 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 target1 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 <= 100nums.length == index.length0 <= nums[i] <= 1000 <= index[i] <= i
题意
按照顺序,将nums[i]插入到index[i]下标处,返回新生成的数组。
思路
照做即可。
代码实现
class Solution {public int[] createTargetArray(int[] nums, int[] index) {int[] ans = new int[nums.length];List<Integer> list = new ArrayList<>();for (int i = 0; i < nums.length; i++) {list.add(index[i], nums[i]);}for (int i = 0; i < nums.length; i++) {ans[i] = list. get(i);}return ans;}}
