101
0/320
Loading content...
You are given an integer array nums. Your task is to rearrange the elements of the array such that all even integers appear before all odd integers.
The relative order among the even numbers themselves does not matter, and similarly, the relative order among the odd numbers does not matter. You may return any valid arrangement where every even number precedes every odd number.
This is a classic array partitioning problem that tests your understanding of in-place element manipulation and efficient traversal techniques. The challenge lies in achieving this rearrangement efficiently, ideally in a single pass through the array.
nums = [3,1,2,4][2,4,3,1]After rearrangement, 2 and 4 (the even numbers) appear at the beginning, followed by 3 and 1 (the odd numbers). Other valid outputs include [4,2,3,1], [2,4,1,3], and [4,2,1,3].
nums = [0][0]The array contains only one element which is 0 (an even number). No rearrangement is needed.
nums = [1,2,3,4,5,6][2,4,6,1,3,5]The even numbers 2, 4, and 6 are moved to the front, while the odd numbers 1, 3, and 5 are moved to the back. Any permutation where all evens come before all odds is acceptable.
Constraints