class Solution {
public:
void reOrderArray(vector[HTML_REMOVED] &array) {
deque[HTML_REMOVED] de;
for(int i=0;i<array.size();i){
if(array[i]%2==0){
de.push_back(array[i]);
}else{
de.push_front(array[i]);
}
}
int m=0;
while(!de.empty()){
array[m]=de.front();
de.pop_front();
}
}
};