c_cpp 905.按奇偶校验排序数组

Posted 2021-05-14

//使用额外空间进行寄存
//28 ms
class Solution {
public:
    vector<int> sortArrayByParity(vector<int>& A) {
        vector<int> array;
        for(int i = 0;i < A.size();++i){
            if(A[i] % 2 == 0 || A[i] == 0){
                array.push_back(A[i]);
                A[i] = -1;
            }
        }
        for(int i = 0;i < A.size();++i){
            if(A[i] > 0)
                array.push_back(A[i]);
        }
        return array;
    }
};

//原地修改，复杂度为O(n)
//28 ms
class Solution {
public:
    vector<int> sortArrayByParity(vector<int>& A) {
        for (int i = 0, j = 0; j < A.size(); j++)
            if (A[j] % 2 == 0) swap(A[i++], A[j]);
        return A;
    }
};