• Home
• com.github.javadev
• leetcode-in-java21
• 1.26
• source code
• Solution.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1401_1500.s1470_shuffle_the_array.Solution Maven / Gradle / Ivy

package g1401_1500.s1470_shuffle_the_array;

// #Easy #Array #2022_03_29_Time_1_ms_(51.62%)_Space_45.5_MB_(66.97%)

/**
 * 1470 - Shuffle the Array\.
 *
 * Easy
 *
 * 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`
**/
public class Solution {
    public int[] shuffle(int[] nums, int n) {
        int[] result = new int[nums.length];
        int i = 0;
        int j = 0;
        while (i < n && j < 2 * n) {
            result[j] = nums[i];
            result[++j] = nums[i + n];
            i++;
            j++;
        }
        return result;
    }
}