Time: 72 ms (51.22%), Space: 14 MB (88.30%) - LeetHub

This commit is contained in:
Deven
2023-01-16 23:29:36 -05:00
parent dcfe641a4b
commit de5531380b
@@ -0,0 +1,3 @@
class Solution:
def shuffle(self, nums: List[int], n: int) -> List[int]:
return [ nums[int(i / 2)] if i % 2 == 0 else nums[n + int(i / 2)] for i in range(2 * n) ]