#include <cassert>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
//假设有一个容器里面存的数据是无序.
// 假如是1 5 3 5 6 7 100
//函数传入这个容器和一个位置值 比如是3
//函数将这个容器的内存根据传入的位置进行调整,经过调整后
// 变成 6 7 100 5 1 5 3
//什么意思呢,就是在位置3之后的放到前头,位置3之前的放到后面
//changeOrder({1,2,3},1) ->2 3 1
//changeOrder({1,2,3},2) ->3 2 1
//changeOrder({1,2,3},3) ->3 1 2
//假设我们不考虑pos无效的情况 pos>=0 && pos<objects.size()
void changeOrder(std::vector<int>& objects, int pos)
{
assert(pos>=0);
assert(pos <= objects.size());
/*
int len = objects.size();
for(int i=0;i<pos;i++)
{
objects.push_back(objects[i]);
}
for (int i = 0;i< objects.size()- pos;i++)
{
objects[i] = objects[i + pos];
}
//删除
for (std::vector<int>::iterator iter = objects.begin() + len;iter != objects.end();)
{
iter = objects.erase(iter);//删除后返回下一个的位置
}
*/
std::rotate(objects.begin(), objects.begin() + pos+1,objects.end());
std::rotate(objects.begin()+ (objects.size() -pos-1),objects.begin()+ objects.size()-1,
objects.end());
}
std::vector<int> changeOrderCopy(std::vector<int>& objects, int pos)
{
assert(pos >= 0);
assert(pos <= objects.size());
std::vector<int> v(objects.begin()+pos+1,objects.end());
v.push_back(objects[pos]);
v.insert(v.end(),objects.begin(),objects.begin()+pos);
return v;
}
int main()
{
std::vector<int> v1 = { 1 ,3 ,5 ,6 ,7 ,100,9,10,11 };
std::vector<int> v2 = changeOrderCopy(v1, 4);
changeOrder(v1, 4);
for (std::vector<int>::iterator iter = v1.begin() ;iter != v1.end();++iter)
{
std::cout << (*iter) << ",";
}
std::cout << "\n";
for (std::vector<int>::iterator iter = v2.begin();iter != v2.end();++iter)
{
std::cout << (*iter) << ",";
}
std::cout << "\n";
system("pause");
return 0;
}