class Solution {
public:
vector<int> sortArrayByParity(vector<int>& A) {
int l = A.size();
int low = 0,high =l-1;
while(low<high)
{
while(low<high&&A[low]%2==0)
{
low++;
}
while(low<high&&A[high]%2!=0)
{
high --;
}
int tmp = A[high];
A[high] = A[low];
A[low] = tmp;
}
return A;
}
};
348

被折叠的 条评论
为什么被折叠?



