leetcode 3069. Distribute Elements Into Two Arrays I

https://leetcode.com/problems/distribute-elements-into-two-arrays-i/description/

 

class Solution:
    def resultArray(self, nums: List[int]) -> List[int]:
        arr1 = [nums[0]]
        arr2 = [nums[1]]
        for i in range(2, len(nums)):
            if arr1[-1] > arr2[-1]:
                arr1.append(nums[i])
            elif arr1[-1] < arr2[-1]:
                arr2.append(nums[i])
        
        return arr1 + arr2