class Solution { public: void reOrderArray(vector<int> &array) { int len = array.size(), tmp; for(int i = 0; i < len; ++i){ if(array[i]%2) continue; for(int j = i + 1; j < len; ++j){ if(array[j]%2){ tmp = array[i]; array[i] = array[j]; for(int k = j; k > i + 1; --k){ array[k] = array[k - 1]; } array[i + 1] = tmp; if(j == len - 1) return; break; } } } } };