【STL】list的常用方法

9 篇文章 0 订阅

List的常用方法展示

  • 【1】怎么赋值
  • 【2】insert
  • 【3】front、 back、 pop_back、 pop_front
  • 【4】遍历、反序遍历
  • 【5】排序sort
  • 【6】swap
  • 【7】unique
  • 【8】splice
  • 【9】merge
  • 【10】reverse
  • 【11】empty
  • 【12】size
  • 【13】clear
  • 【14】push_back、push_front
  • 【15】remove

程序实例

#include <iostream>
#include <list>
#include <algorithm>
#include <iterator>
using namespace std;
int main()
{
    int a[] = {1,6,4,4,4,4,7,5};
    list<int>iLi(a,a+sizeof(a)/sizeof(int));
    list不支持[]运算符
    //for(int i = 0; i < iLi.size();i++)
    //{
        //cout<<iLi[i]<<" ";//error
    //}
    ///ok迭代器可以
    for(list<int>::iterator it = iLi.begin();it != iLi.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    /测试insert
    list<int>iLi1;
    //iLi1.insert(iLi1.begin(),100);//ok
    //iLi1.insert(iLi1.begin(),2,100);//ok
    //iLi1.insert(iLi1.end(),20);//ok
    iLi1.insert(iLi1.begin(),iLi.begin(),iLi.end());//ok
    copy(iLi1.begin(),iLi1.end(),ostream_iterator<int>(cout," "));
    cout<<endl;
    ///测试erase
    //iLi1.erase(iLi1.begin());//ok
    //iLi1.erase(iLi1.begin(),iLi1.end());//ok
    //iLi1.erase(iLi1.begin(),iLi1.begin()+2);//error  编译出错
    //copy(iLi1.begin(),iLi1.end(),ostream_iterator<int>(cout," "));
    //cout<<endl;
    //遍历list
    for(list<int>::iterator it = iLi1.begin();it != iLi1.end();it++)///ok
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    //反向遍历
    for(list<int>::reverse_iterator rit = iLi1.rbegin();rit != iLi1.rend();rit++)
    {
        cout<<*rit<<" ";
    }
    cout<<endl;
    使用front  back
    while(!iLi1.empty())
    {
        cout<<iLi1.front()<<" ";
        iLi1.pop_front();
    }
    cout<<endl;
    iLi1 = iLi;//使用iLi给iLi1赋值
    while(!iLi1.empty())
    {
        cout<<iLi1.back()<<" ";
        iLi1.pop_back();
    }
    cout<<endl;
    //测试sort
    iLi1 = iLi;
    iLi1.sort();
    for(list<int>::iterator it = iLi1.begin();it != iLi1.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    测试swap
    iLi1.swap(iLi);
    cout<<"iLi1:"<<endl;
    for(list<int>::iterator it = iLi1.begin();it != iLi1.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    cout<<"iLi:"<<endl;
    for(list<int>::iterator it = iLi.begin();it != iLi.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    ///
    cout<<"测试unique"<<endl;
    iLi.unique();
    for(list<int>::iterator it = iLi.begin();it != iLi.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    
    cout<<"测试reverse"<<endl;
    iLi.reverse();
    for(list<int>::iterator it = iLi.begin();it != iLi.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    
    cout<<"测试splice"<<endl;
    //iLi1.splice(iLi1.end(),iLi);//ok
    //iLi1.splice(iLi1.begin(),iLi);//ok
    //iLi1.splice(iLi1.end(),iLi,iLi.begin(),iLi.end());//ok
    //iLi1.splice(iLi1.end(),iLi,iLi.begin());/只能把iLi.begin()这个位置的元素移走,放到iLi1的iLi1.end()之前
    list<int>::iterator it = iLi.begin();
    it++;
    iLi1.splice(iLi1.end(),iLi,it);/只能把it位置的元素移走放到iLi1的iLi1.end()之前
    cout<<"iLi"<<endl;
    for(list<int>::iterator it = iLi.begin();it != iLi.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    cout<<"iLi1"<<endl;
    for(list<int>::iterator it = iLi1.begin();it != iLi1.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    ///
    cout<<"测试merge"<<endl;
    iLi1.sort();
    iLi.sort();
    iLi1.merge(iLi);
    cout<<"iLi1"<<endl;
    for(list<int>::iterator it = iLi1.begin();it != iLi1.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    cout<<"iLi"<<endl;
    for(list<int>::iterator it = iLi.begin();it != iLi.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    cout<<"测试size"<<endl;
    cout<<iLi1.size()<<endl;
    cout<<"测试push_back、push_front"<<endl;
    iLi.push_back(100);
    iLi.push_front(200);
    for(list<int>::iterator it = iLi.begin();it != iLi.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    cout<<"测试clear"<<endl;
    iLi.clear();
    cout<<(iLi.empty()?"空":"不空")<<endl;
    cout<<"测试remove"<<endl;
    iLi1.remove(4);
    for(list<int>::iterator it  = iLi1.begin();it != iLi1.end();it++)
    {
        cout<<*it<<" ";
    }
    cout<<endl;
    system("pause");
    return 0;
}

结果

这里写图片描述

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值