1470. Shuffle the Array #

Problem #

Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn].

Return the array in the form [x1,y1,x2,y2,...,xn,yn].

Example 1:

Input: nums = [2,5,1,3,4,7], n = 3
Output: [2,3,5,4,1,7] 
Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7].

Example 2:

Input: nums = [1,2,3,4,4,3,2,1], n = 4
Output: [1,4,2,3,3,2,4,1]

Example 3:

Input: nums = [1,1,2,2], n = 2
Output: [1,2,1,2]

Constraints:

• 1 <= n <= 500
• nums.length == 2n
• 1 <= nums[i] <= 10^3

Problem Statement #

You are given an array nums with 2n elements, arranged in the format [x1,x2,…,xn,y1,y2,…,yn]. Please rearrange the array in the format [x1,y1,x2,y2,…,xn,yn] and return the rearranged array.

Solution Idea #

• Given an array of length 2n, insert the last n elements into the gaps between the first n elements. Output the final completed array.
• Easy problem; just insert into the gaps according to the problem statement.

Code #

package leetcode

func shuffle(nums []int, n int) []int {
	result := make([]int, 0)
	for i := 0; i < n; i++ {
		result = append(result, nums[i])
		result = append(result, nums[n+i])
	}
	return result
}