class Solution(object):def shuffle(self, nums, n):""":type nums: List[int]:type n: int:rtype: List[int]"""result = []for i in range(n):result.append(nums[i])result.append(nums[i + n])return result

Closest Common Ancestors 点击打开题目链接 Time Limit: 2000MS Memory Limit: 10000KTotal Submissions: 15120 Accepted: 4817 Description Write a program that takes as input a rooted tree and a list

**题目：**给你一个数组 nums ，数组中有 2n 个元素，按 [x1,x2,…,xn,y1,y2,…,yn] 的格式排列。请你将数组按 [x1,y1,x2,y2,…,xn,yn] 格式重新排列，返回重排后的数组。 示例 1： 输入：nums = [2,5,1,3,4,7], n = 3 输出：[2,3,5,4,1,7] 解释：由于 x1=2, x2=5, x3=1, y1=3, y2=4,