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).

LeetCode Problem - 1920

class Solution {
    // Method to build an array where each element is replaced with the value at its corresponding index in the original array
    public int[] buildArray(int[] nums) {
        // Initialize an array to store the result
        int[] ans = new int[nums.length];

        // Iterate through the input array
        for(int i = 0; i < nums.length; i++) {
            // Replace the current element with the value at the index specified by the current element
            ans[i] = nums[nums[i]];
        }

        // Return the resulting array
        return ans;
    }
}