LeetCode 905 Sort Array By Parity 按奇偶排序陣列
阿新 • • 發佈:2019-02-09
解法一:
class Solution {
public:
vector<int> sortArrayByParity(vector<int>& A) {
vector<int> ret;
for(auto a:A)
{
if(a%2==0)
ret.push_back(a);
}
for(auto a:A)
{
if(a%2!=0)
ret.push_back(a);
}
return ret;
}
};
解法二:
class Solution {
public:
vector<int> sortArrayByParity(vector<int>& A) {
int j=A.size()-1;
int i=0,tmp;
for(;i<j;)
{
if(A[i]%2==0)
{
++i;
}
else
{
tmp=A[j];
A[j]=A[i];
A[i]=tmp;
--j;
}
}
return A;
}
};