Given an array of integers nums, half of the integers in nums are odd, and the other half are even.
Sort the array so that whenever nums[i] is odd, i is odd, and whenever nums[i] is even, i is even.
Return any answer array that satisfies this condition.
Example 1:
Input: nums = [4,2,5,7] Output: [4,5,2,7] Explanation: [4,7,2,5], [2,5,4,7], [2,7,4,5] would also have been accepted.
Example 2:
Input: nums = [2,3] Output: [2,3]
Constraints:
2 <= nums.length <= 2 * 104nums.length is even.nums are even.0 <= nums[i] <= 1000
Follow Up: Could you solve it in-place?
class Solution {
public:
vector<int> sortArrayByParityII(vector<int>& nums) {
int odd=0, even=1;
while(1){
while(!(nums[odd]%2)){
odd+=2;
if(odd>=nums.size())
return nums;
}
while(nums[even]%2){
even+=2;
if(even>=nums.size())
return nums;
}
swap(nums[odd], nums[even]);
}
return nums;
}
};