922. Sort Array By Parity II*

922. Sort Array By Parity II*

https://leetcode.com/problems/sort-array-by-parity-ii/

题目描述

Given an array A of non-negative integers, half of the integers in A are odd, and half of the integers are even.

Sort the array so that whenever A[i] is odd, i is odd; and whenever A[i] is even, i is even.

You may return any answer array that satisfies this condition.

Example 1:

Input: [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.

Note:

• 2 <= A.length <= 20000
• A.length % 2 == 0
• 0 <= A[i] <= 1000

C++ 实现 1

class Solution {
public:
    vector<int> sortArrayByParityII(vector<int>& A) {
        int i = 0, j = 1;
        while (i < A.size() && j < A.size()) {
            if (A[i] % 2 == 0) i += 2;
            else if (A[j] % 2 == 1) j += 2;
            else {
                std::swap(A[i], A[j]);
                i += 2;
                j += 2;
            }
            
        }
        return A;
    }
};

C++ 实现 2

来自 LeetCode submission.

class Solution {
public:
    vector<int> sortArrayByParityII(vector<int>& A) {
        int i = 0;
        int j = 1;

        while (i < A.size() && j < A.size()) {
            while (i < A.size() && !(A[i] & 1))
                i += 2;
            while (j < A.size() && A[j] & 1)
                j += 2;
            if (i < A.size() && j < A.size())
                swap(A[i], A[j]);
        }
        return A;
    }
};

C++ 实现 3

我的另一种做法, 没有通过 LeetCode 的测试用例, 但是我目前认为是没有写错的. 以后再看看哪里出了问题. Leetcode 报的错误是关于地址访问相关的. 我自己在本地测试是没有任何问题的.

class Solution {
public:
    vector<int> sortArrayByParityII(vector<int>& A) {
        int k = -2;
        for (int i = 0; i < A.size(); ++ i) {
            if (A[i] % 2 == 0) {
                std::swap(A[k + 2], A[i]);
                k += 2;
            }
        }
        return A;
    }
};