void CodeComplite::reOrderArray(vector<int> &array)
{/*
//冒泡法,时间换空间
if (0 == array.size())
{
return;
}
int temp = 0;
int i = 0,j=0;
for (i = 0; i < array.size(); i++)
{
for (j = array.size()-1; j>0; j--)
{
if (array.at(j) % 2 == 1 && 0 == array.at(j - 1) % 2)
{
swap(array.at(j), array.at(j - 1));
}
}
}
*/
//方案二
stack<int>s1;
int i = 0;
for (i = 0; i < array.size(); i++)
{
if (1 == array.at(i) % 2)
{
s1.push(array.at(i));
}
}
for (i = 0; i < array.size(); i++)
{
if (0 == array.at(i) % 2)
{
s1.push(array.at(i));
}
}
i =array.size()-1;
while (!s1.empty())
{
array.at(i) = s1.top();
s1.pop();
i--;
}
}