Skip to main content

< Back to Data Structures and Algorithms

LeetCode 1920 · Arrays

Build Array from Permutation

A new array where each place i holds nums[nums[i]].

Step through it

Examples
Edge cases
nums
  1. 00
  2. 21
  3. 12
  4. 53
  5. 34
  6. 45

Step 0 of 10

Output

Running… play or step to the end.

The code

/**
 * 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.
 *
 * @param {number[]} nums
 * @return {number[]} ans
 */
 const buildArray = nums => {
    // Stores the permutated array values.
    const ans = []
    
    // O(n) loop over every item within the array.
    for(let i=0; i < nums.length; i++) {
        // Shift the value from nums[i] to nums[nums[i]] and push it into the new array.
        ans.push(nums[nums[i]])
    }
    
    // Iteration done. Return the permutated array.
    return ans
}

View it on GitHub (opens in a new tab)