"""
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:
    def buildArray(self, nums: List[int]) -> List[int]:
        out = []
        for i in range(0, len(nums)):
            out.append(nums[nums[i]])
        return out
75eddfa5f516f794ed651f5f5ccca11d783b0227
<mask token>

<mask token>


class Solution:
    <mask token>

<mask token>


class Solution:

    def buildArray(self, nums: List[int]) ->List[int]:
        out = []
        for i in range(0, len(nums)):
            out.append(nums[nums[i]])
        return out

"""
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:
    def buildArray(self, nums: List[int]) -> List[int]:
        out = []
        for i in range(0, len(nums)):
            out.append(nums[nums[i]])
        return out