3069. Distribute Elements Into Two Arrays I

class Solution {
    public int[] resultArray(int[] nums) {
        List<Integer> arr1 = new ArrayList<>();
        List<Integer> arr2 = new ArrayList<>();

        arr1.add(nums[0]);
        arr2.add(nums[1]);

        for (int i = 2; i < nums.length; i++) {
            if (arr1.get(arr1.size() - 1) > arr2.get(arr2.size() - 1)) {
                arr1.add(nums[i]);
            } else {
                arr2.add(nums[i]);
            }
        }

        int[] result = new int[nums.length];
        int idx = 0;
        for (int v : arr1) result[idx++] = v;
        for (int v : arr2) result[idx++] = v;

        return result;
    }
}

class Solution:
    def resultArray(self, nums):
        arr1 = [nums[0]]
        arr2 = [nums[1]]

        for i in range(2, len(nums)):
            if arr1[-1] > arr2[-1]:
                arr1.append(nums[i])
            else:
                arr2.append(nums[i])

        return arr1 + arr2

class Solution {
public:
    vector<int> resultArray(vector<int>& nums) {
        vector<int> arr1;
        vector<int> arr2;

        arr1.push_back(nums[0]);
        arr2.push_back(nums[1]);

        for (int i = 2; i < nums.size(); i++) {
            if (arr1.back() > arr2.back()) {
                arr1.push_back(nums[i]);
            } else {
                arr2.push_back(nums[i]);
            }
        }

        vector<int> result;

        for (int x : arr1) {
            result.push_back(x);
        }

        for (int x : arr2) {
            result.push_back(x);
        }

        return result;
    }
};

class Solution {
    resultArray(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];
    }
}