C++

1/*
2 * Runtime: 8 ms, faster than 89.28% of C++ online submissions for Shuffle the Array.
3 * Memory Usage: 10.3 MB, less than 100.00% of C++ online submissions for Shuffle the Array.
4*/
5
6class Solution {
7public:
8    vector<int> shuffle(vector<int>& nums, int n) {
9        vector<int> result;
10        
11        for (int i=0; i<n; ++i)
12        {
13            result.push_back(nums[i]);
14            result.push_back(nums[n+i]);
15        }
16        
17        return result;
18    }
19};

JavaScript

1/**
2 * Runtime: 92 ms, faster than 35.85% of JavaScript online submissions for Shuffle the Array.
3 * Memory Usage: 40.7 MB, less than 5.02% of JavaScript online submissions for Shuffle the Array.
4 */
5var shuffle = function(nums, n) {
6    let result = [];
7    
8    for(let i=0; i<n; ++i) {
9        result.push(nums[i]);
10        result.push(nums[n+i]);
11    }
12    
13    return result;
14};

Ruby

1# Runtime: 48 ms, faster than 89.60% of Ruby online submissions for Shuffle the Array.
2# Memory Usage: 210.7 MB, less than 61.85% 
3
4def shuffle(nums, n)
5    result = []
6    
7    1.upto(n) do |i|
8        result << nums[i-1];
9        result << nums[n+(i-1)]
10    end
11    result
12end