题目:输入一个数组,实现函数是的所有的奇数在数组在前半段,所有的偶数在后半段。
要点:二分数组,类似于二分查询。
二分查询链接:https://blog.csdn.net/Victor_psl/article/details/107371870
#include<iostream>
#include<vector>
using namespace std;
void Print(vector<int>& vec)
{
int len = vec.size();
int i = 0;//左下标
int j = len - 1;//右下标
int tmp = vec[i];
while (i < j)
{
if (vec[i] % 2 == 0)//取余等于0说明偶数
{
while (vec[j] % 2 == 0) --j;//偶数的话,--j,
tmp = vec[i]; //否则是奇数,置换
vec[i] = vec[j];
vec[j] = tmp;
--j;//置换完了要--
++i;//要++
}
else//说明是奇数
{
++i;//直接++i,向后遍历
}
}
//return vec;
}
int main()
{
int ar[] = { 3,6,1,7,34,78,24,33,41,57 };
int len = sizeof(ar) / sizeof(ar[0]);
vector<int>vec(ar, ar + len);vector<int>::iterator it = vec.begin();
while (it != vec.end())
{
cout << *it << " ";
++it;
}
cout << endl;
Print(vec);
it = vec.begin();
while (it != vec.end())
{
cout << *it << " ";
++it;
}
cout << endl;
return 0;
}
结果:
拓展:
//看下面的代码,增强了程序的可拓展性
//如果说把负数放在非负数前面呢,把可以被3整除的数放在不能被3整除的数呢
//二分算法
void Print(vector<int>&vec,bool fun(int))
{
int len = vec.size();
int l = 0;//
int r = len - 1;
int tmp = 0;
while (l < r)
{
while (l < r && !fun(vec[l]))
++l;
while (l < r && fun(vec[r]))
--r;
if (l < r)
{
tmp = vec[l];
vec[l] = vec[r];
vec[r] = tmp;
}
}
}
//这里只要增加个函数就行了,前面的二分算法就可以复用了
bool IsNegativeNums(int num)
{
if (num < 0)
return 0;
else
return 1;
}void PrintResult(vector<int>&vec)
{
Print(vec, IsNegativeNums);
}
int main()
{
int ar[] = { 2,-1,-5,3,-6,8,56,-100};
int len = sizeof(ar) / sizeof(ar[0]);
vector<int>vec(ar, ar + len);vector<int>::iterator it = vec.begin();
while (it != vec.end())
{
cout << *it << " ";
++it;
}
cout << endl;
PrintResult(vec);
it = vec.begin();
while (it != vec.end())
{
cout << *it << " ";
++it;
}
cout << endl;
return 0;
}
结果: