출처 : https://leetcode.com/problems/build-array-from-permutation/
Given a zero-based permutation nums
(0-indexed), build an array ans
of the same length where ans[i] = nums[nums[i]]
for each 0 <= i < nums.length
and return it.
A zero-based permutation nums
is an array of distinct integers from 0
to nums.length - 1
(inclusive).
class Solution {
public int[] buildArray(int[] nums) {
int[] res = new int[nums.length];
int index = 0;
for (int n = 0; n < nums.length; n++) {
res[index++] = nums[nums[n]];
}
return res;
}
}