方法一：
class Solution {
public:void reOrderArray(vector<int> &array) {//边界条件if(array.empty()) return;int b[array.size()];int t=0;for(int i=0;i<array.size();i++){if(array[i]%2!=0) b[t++]=array[i];}for(int i=0;i<array.size();i++){if(array[i]%2==0) b[t++]=array[i];}for(int i=0;i<array.size();i++){array[i]=b[i];}}
};
方法二：
class Solution {
public://数组添加时要用.push_back()void reOrderArray(vector<int> &array) {//边界条件if(array.empty()) return;vector<int> b;int t=0;for(int i=0;i<array.size();i++){if(array[i]%2==1) b.push_back(array[i]);}for(int i=0;i<array.size();i++){if(array[i]%2==0) b.push_back(array[i]);}//array=b;for(int i=0;i<array.size();i++)array[i]=b[i];}
};