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