374. Distribute Elements Into Two Arrays I
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.
Examples
Input: [2,1,3]
Output: [2,3,1]
Explanation: Seed arr1=[2], arr2=[1]. For nums[2]=3, tail of arr1 (2) > tail of arr2 (1), so append to arr1 → arr1=[2,3]. Concatenating gives [2,3,1].
Constraints
- 3 <= n <= 50
- 1 <= nums[i] <= 100
- All elements in nums are distinct.
Run checks all cases above. Submit evaluates all test cases.