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).
Follow-up: Can you solve it without using an extra space (i.e., O(1) memory)?
Example 1
Input
nums = [0,2,1,5,3,4]Output
[0,1,2,4,5,3]The array
ans is built as [nums[0], nums[2], nums[1], nums[5], nums[3], nums[4]], which equals [0, 1, 2, 4, 5, 3].Example 2
Input
nums = [5,0,1,2,3,4]Output
[4,5,0,1,2,3]The array
ans is built as [nums[5], nums[0], nums[1], nums[2], nums[3], nums[4]], which equals [4, 5, 0, 1, 2, 3].Constraints
- 1 <= nums.length <= 1000
- 0 <= nums[i] < nums.length
- The elements in
numsare distinct.