class Solution {
public:
vector<int> sortArrayByParity(vector<int>& A) {
int ii = 0;
int jj = A.size()-1;
// find jishu from ii->
while(ii<jj){ // 1, 2
while(ii<A.size()&&A[ii]%2==0){
ii++;
}
while(jj>=0&&A[jj]%2==1){
jj--;
}
if (ii>=jj){break;}
int temp = A[jj];
A[jj] = A[ii];
A[ii] = temp;
ii++;jj--;
}
return A;
}
};
905. Sort Array By Parity
最新推荐文章于 2024-10-08 10:36:00 发布