C++ 代码
class Solution {
public:
void reOrderArray(vector<int> &array) {
if(array.empty()){return;}
auto q=array.end()-1;
auto p=array.begin();
while(p<=q){
while(*p%2!=0){p++;}
while(*q%2==0){q--;}
if(p<q){swap(*p,*q);}
}
}
};