Scribd Logo
Upload

Welcome to Scribd!

  • List Compression

    Uploaded by

    Rahul yadav
    8 views1 page
    This document contains 3 solutions for a buildArray problem. The first solution uses a for loop to iterate through the indices of the input nums list, and appends the element at nums[i] to the output list ans. The second solution iterates through nums directly instead of using indices, but otherwise has the same logic. The third solution provides a list comprehension that returns a new list with nums[num] for each num in nums, providing the most concise single line solution.

    Original Description:

    Original Title

    Untitled

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains 3 solutions for a buildArray problem. The first solution uses a for loop to iterate through the indices of the input nums list, and appends the element at nums[i] to the output list ans. The second solution iterates through nums directly instead of using indices, but otherwise has the same logic. The third solution provides a list comprehension that returns a new list with nums[num] for each num in nums, providing the most concise single line solution.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    8 views1 page

    List Compression

    Uploaded by

    Rahul yadav
    This document contains 3 solutions for a buildArray problem. The first solution uses a for loop to iterate through the indices of the input nums list, and appends the element at nums[i] to the output list ans. The second solution iterates through nums directly instead of using indices, but otherwise has the same logic. The third solution provides a list comprehension that returns a new list with nums[num] for each num in nums, providing the most concise single line solution.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    List compression

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

    class Solution:
    def buildArray(self, nums: List[int]) -> List[int]:
    ans = []
    for i in nums:
    ans.append(nums[i])
    return ans

    class Solution:
    def buildArray(self, nums: List[int]) -> List[int]:
    return [nums[num] for num in nums]

    You might also like