Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1470 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1470 # by problem number
lcpy gen -s shuffle_the_array # by problem name
nums consisting of 2n elements in the form [x<sub>1</sub>,x<sub>2</sub>,...,x<sub>n</sub>,y<sub>1</sub>,y<sub>2</sub>,...,y<sub>n</sub>].
<p>Return the array in the form <code>[x<sub>1</sub>,y<sub>1</sub>,x<sub>2</sub>,y<sub>2</sub>,…,x<sub>n</sub>,y<sub>n</sub>]</code>.</p>
Input: nums = [2,5,1,3,4,7], n = 3
Output: [2,3,5,4,1,7]
Input: nums = [1,2,3,4,4,3,2,1], n = 4
Output: [1,4,2,3,3,2,4,1]
Input: nums = [1,1,2,2], n = 2
Output: [1,2,1,2]
class Solution:
# Time: O(n)
# Space: O(n)
def shuffle(self, nums: list[int], n: int) -> list[int]:
result: list[int] = [0] * (2 * n)
for i in range(n):
result[2 * i] = nums[i]
result[2 * i + 1] = nums[i + n]
return result
| Time | Space |
|---|---|
| O(n) | O(n) |