Parity Partition Sort

You are given an integer array nums.

Rearrange its values so that:

• the odd values are sorted in ascending order, occupying exactly the positions where odd values originally stood;
• the even values are sorted in descending order, occupying exactly the positions where even values originally stood.

The parity pattern of the array (which positions hold odd values and which hold even values) must not change.

Return the resulting array.

Examples

Example 1

Input: nums = [9, 4, 3, 8, 7, 2, 5]
Output: [3, 8, 5, 4, 7, 2, 9]
Explanation: The odd values 9, 3, 7, 5 (at positions 0, 2, 4, 6) become
3, 5, 7, 9 in ascending order. The even values 4, 8, 2 (at positions 1, 3, 5)
become 8, 4, 2 in descending order.

Example 2

Input: nums = [6, 6, 0]
Output: [6, 6, 0]
Explanation: There are no odd values; the even values sorted descending keep
the same layout.