Sort Even and Odd Indices Independently — LeetCode 2164 Python Solution

The problem

You are given a 0-indexed integer array nums. Rearrange the values of nums according to the following rules: Sort the values at odd indices of nums in non-increasing order.

Example

Input

nums = [4,1,2,3]

Output

[2,3,4,1]

Explanation

First, we sort the values present at odd indices (1 and 3) in non-increasing order.

Python solution

class Solution:
    def sortEvenOdd(self, nums: List[int]) -> List[int]:
        a = sorted(nums[::2])
        b = sorted(nums[1::2], reverse=True)
        nums[::2] = a
        nums[1::2] = b
        return nums

Complexity

Pattern: Sorting

Spend O(n log n) once to buy an ordering that makes the rest of the problem trivial. LeetCode 2164. Sort Even and Odd Indices Independently is filed here because LeetCode tags it Sorting, which is the vocabulary this hub collects.

The sorting guide has the Python template for the pattern and the 401 LeetCode problems that use it.

Related problems