AlgoDesign

Alternating array

1class Solution:
2    def alternatingArray(self, nums):
3        for i in range(len(nums)):
4            nums[i:i + 2] = sorted(nums[i:i + 2], reverse=(i % 2 == 0))
5        
6        return nums
7
8# time: O(n)
9# space: O(1)