We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Transform Array by Parity

Difficulty: Easy

Problem Description

You are given an integer array nums. Transform nums by performing the following operations in the exact order specified:

  1. Replace each even number with 0.
  2. Replace each odd number with 1.
  3. Sort the modified array in non-decreasing order.

Return the resulting array after performing these operations.

Key Insights

  • The transformation of the array is straightforward: it involves replacing even numbers with 0 and odd numbers with 1.
  • Sorting the final transformed array will always yield a result of all 0's followed by all 1's, given that 0 < 1.
  • The operations can be performed in a single pass for the transformation, followed by a sort operation.

Space and Time Complexity

Time Complexity: O(n log n), where n is the length of the array (due to the sorting step). Space Complexity: O(n), for storing the transformed array.

Solution

To solve this problem, we will:

  1. Iterate through the input array and create a new array where each even number is replaced by 0 and each odd number is replaced by 1.
  2. Sort the transformed array to ensure the output is in non-decreasing order. We will use a simple array to hold the transformed values and use a built-in sorting function to sort the array.

Code Solutions

def transformArray(nums):
    # Step 1: Transform the array based on parity
    transformed = [0 if num % 2 == 0 else 1 for num in nums]
    
    # Step 2: Sort the transformed array
    transformed.sort()
    
    return transformed
← Back to All Questions