Practice Build Array from Permutation

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1920

LeetCode Problem

Build Array from Permutation

Array Simulation

Problem Statement

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). Example 1: Example 2: Constraints: Follow-up: Can you solve it without using an extra space (i.e., O(1) memory)?

Source: Build Array from Permutation on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

nums = [0,2,1,5,3,4]

Output

[0,1,2,4,5,3]

# Example 2

Input

nums = [5,0,1,2,3,4]

Output

[4,5,0,1,2,3]

Constraints

1 <= nums.length <= 1000

0 <= nums[i] < nums.length

The elements in nums are distinct.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free