3069-distribute-elements-into-two-arrays-i.js

/**
 * 3069. Distribute Elements Into Two Arrays I
 * https://leetcode.com/problems/distribute-elements-into-two-arrays-i/
 * Difficulty: Easy
 *
 * You are given a 1-indexed array of distinct integers nums of length n.
 *
 * You need to distribute all the elements of nums between two arrays arr1 and arr2 using n
 * operations. In the first operation, append nums[1] to arr1. In the second operation,
 * append nums[2] to arr2. Afterwards, in the ith operation:
 * - If the last element of arr1 is greater than the last element of arr2, append nums[i] to arr1.
 *   Otherwise, append nums[i] to arr2.
 *
 * The array result is formed by concatenating the arrays arr1 and arr2. For example, if
 * arr1 == [1,2,3] and arr2 == [4,5,6], then result = [1,2,3,4,5,6].
 *
 * Return the array result.
 */

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var resultArray = function(nums) {
  const arr1 = [nums[0]];
  const arr2 = [nums[1]];

  for (let i = 2; i < nums.length; i++) {
    if (arr1[arr1.length - 1] > arr2[arr2.length - 1]) {
      arr1.push(nums[i]);
    } else {
      arr2.push(nums[i]);
    }
  }

  return [...arr1, ...arr2];
};