1389. Create Target Array in the Given Order

Posted wentiliangkaihua

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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
class Solution {
    public int[] createTargetArray(int[] nums, int[] index) {
        List<Integer> list = new ArrayList();
        int[] arr = new int[nums.length];
        for(int i = 0; i < nums.length; i++){
            list.add(index[i], nums[i]);
        }
        for(int i = 0; i < nums.length; i++){
            arr[i] = list.get(i);
        }
        return arr;
    }
}

ArrayList.add(int index, E element)

以上是关于1389. Create Target Array in the Given Order的主要内容,如果未能解决你的问题,请参考以下文章

算法1389. 按既定顺序创建目标数组(多语言实现)

LeetCode 1389. 按既定顺序创建目标数组

1389 乘积平均数

leetcode1389

codevs 1389 乘积平均数

add_library cannot create target “gmock“ because another target with thesame name already exists