Array building from permutation

From a zero-based permutation nums (0-indexed), we have to build an array(ans) of same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and then return it.

A zero-based permutation nums is an array of distinct integers from 0 to nums.length - 1 (inclusive).

Input Format

First Parameter - number n

Second Parameter - array arr of size n

Output Format

Return the array.

Example 1:

Input: 
    6
    0 2 1 5 3 4
Output: 
    0 1 2 4 5 3
Explanation: The array ans is built as follows: 
ans = [nums[nums[0]], nums[nums[1]], nums[nums[2]], nums[nums[3]], nums[nums[4]], nums[nums[5]]]
= [nums[0], nums[2], nums[1], nums[5], nums[3], nums[4]]
= [0,1,2,4,5,3]

Example 2:

Input: nums =
    6 
    5 0 1 2 3 4
Output: 
    4 5 0 1 2 3 
Explanation: ans = [nums[5], nums[0], nums[1], nums[2], nums[3], nums[4]]
= [4,5,0,1,2,3]

Constraints:

• 1 <= nums.length <= 1000
• 0 <= nums[i] < nums.length
• The elements in nums are distinct.
• Time complexity: O(n)
• Auxillary space complexity: O(n)