1929. Concatenation of Array

1929. Concatenation of Array

 

https://leetcode.com/problems/concatenation-of-array/description/

 

class Solution:
    def getConcatenation(self, nums: List[int]) -> List[int]:
        ans = [n for n in nums] + [n for n in nums]
        return ans

 

class Solution:
    def getConcatenation(self, nums: List[int]) -> List[int]:
        return nums + nums

 

https://youtu.be/68isPRHgcFQ

 

class Solution:
    def getConcatenation(self, nums: List[int]) -> List[int]:
        n = len(nums)
        ans = [0] * (2 * n)
        for i, num in enumerate(nums):
            ans[i] = ans[i + n] = num
        return ans

 

Time & Space Complexity

• Time complexity: O(n)
• Space complexity: O(n) for the output array.