STL算法 ---------- 交换

1. swap_ranges(b, e, b2)

2.注意：下列两种方法也是交换算法

         (1) 容器的swap() 成员函数

         (2) 赋值操作

#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>

using namespace std;

int main( int argc, char** argv )
{

	vector<int> vec1;
	vector<int> vec2;

	vec1.push_back(1);
	vec1.push_back(2);
	vec1.push_back(3);

	vec2.push_back(10);
	vec2.push_back(20);
	vec2.push_back(30);
	
	//vec1 = vec2;
	vec1.swap(vec2);
	for(int i=0; i<vec1.size(); ++i)
	{
		cout<<vec1.at(i)<<' ';
	}cout<<endl;

	vector<int> vec;
	deque<int> deq;

	for(int i=1; i<=9; ++i)
	{
		vec.push_back(i);
	}
	for(int i=11; i<=23; ++i)
	{
		deq.insert(deq.end(), i);
	}

	for(vector<int>::iterator itr=vec.begin(); itr!=vec.end(); ++itr)
	{
		cout<<*itr<<' ';
	}cout<<endl;

	for(deque<int>::iterator itr=deq.begin(); itr!=deq.end(); ++itr)
	{
		cout<<*itr<<' ';
	}cout<<endl;
	
	deque<int>::iterator pos;
	pos = swap_ranges(vec.begin(), vec.end(), deq.begin());
	if( pos != deq.end() )
	{
		cout<<"first not exchange:"<<*pos<<endl;
	}
	for(vector<int>::iterator itr=vec.begin(); itr!=vec.end(); ++itr)
	{
		cout<<*itr<<' ';
	}cout<<endl;
	for(deque<int>::iterator itr=deq.begin(); itr!=deq.end(); ++itr)
	{
		cout<<*itr<<' ';
	}cout<<endl;

	swap_ranges(deq.begin(), deq.begin()+3, deq.rbegin());
	for(vector<int>::iterator itr=vec.begin(); itr!=vec.end(); ++itr)
	{
		cout<<*itr<<' ';
	}cout<<endl;
	for(deque<int>::iterator itr=deq.begin(); itr!=deq.end(); ++itr)
	{
		cout<<*itr<<' ';
	}cout<<endl;

	return 0;
}