LeetCode922. Sort Array By Parity II

最新推荐文章于 2025-09-01 21:38:30 发布

叶卡捷琳堡

最新推荐文章于 2025-09-01 21:38:30 发布

阅读量596

点赞数 9

CC 4.0 BY-SA版权

文章标签：算法数据结构排序算法 leetcode c++

本文链接：https://blog.csdn.net/weixin_46841376/article/details/134943104

文章描述了一个编程问题，要求对给定的整数数组进行排序，使得奇数在奇数位置，偶数在偶数位置。提供了一个名为Solution的类和方法，使用while循环和swap操作实现原地排序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

文章目录

- 一、题目
- 二、题解

一、题目

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 * 104
nums.length is even.
Half of the integers in 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 n = nums.size();
        int oddIndex = 1;
        for(int i = 0;i < n;i+=2){
            //存在偶数位上的奇数
            if(nums[i] % 2 == 1){
                //查找奇数位上的偶数
                while(nums[oddIndex] % 2 != 0) oddIndex += 2;
                swap(nums[i],nums[oddIndex]);
            }
        }
        return nums;
    }
};