#ifndef PRINT_H
#define PRINT_H
template<typename T>
void print(T b,T e)
{
while(b!=e)
cout<<*b++<<' ';
cout<<endl;
}
#endif
#include<iostream>
using namespace std
#include<list>
#include"print.h"
#include<cassert>
int main()
{
int a[]={3,8,8,8,5,5,1,8,8,7},b[6]={9,3,5,2,7,6}
list<int> li(a,a+10),lili(b,b+6)
print(li.begin(),li.end())
cout<<"********相邻的重复元素只保留一个*********"<<endl
li.unique()
print(li.begin(),li.end())
cout<<"*********颠倒链表元素顺序*************"<<endl
li.reverse()
print(li.begin(),li.end())
cout<<"*********把lili转移到li之前********"<<endl
li.splice(li.begin(),lili)
print(li.begin(),li.end())
assert(lili.empty())
li.remove(5)
print(li.begin(),li.end())
cout<<"*********排序********"<<endl
li.sort()
print(li.begin(),li.end())
lili.push_back(0)
lili.push_back(5)
print(li.begin(),li.end())
cout<<"*********归并********"<<endl
li.merge(lili)
print(li.begin(),li.end())
}
![这里写图片描述](https://img-blog.csdn.net/20160327192356069)