Create Target Array in the Given Order (1389)

13 Apr 2020 in Algoirthm

leetcode 1389번 문제 (java)

문제 내용

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

  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]
  

• 범위

  1 <= nums.length, index.length <= 100
  nums.length == index.length
  0 <= nums[i] <= 100
  0 <= index[i] <= i
  

내가 찬 코드

class Solution {
    public int[] smallerNumbersThanCurrent(int[] nums) {
        
    List<Integer> answer = new ArrayList<>();
    int[] k = new int[nums.length];
    for (int i = 0; i < nums.length; i++) {
      answer.add(index[i], nums[i]);
    }

    for(int i = 0 ; i < answer.size();i++){
      k[i] = answer.get(i);
    }
    
    return k;
    }
}