stl学习之list

最新推荐文章于 2024-10-20 18:34:06 发布

Lawrence yy

最新推荐文章于 2024-10-20 18:34:06 发布

阅读量115

点赞数

分类专栏： stl 文章标签： c++

本文链接：https://blog.csdn.net/Laurence1234/article/details/110469153

版权

stl 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

#ifndef LIST_H
#define LIST_H
#include <list>

class listStruct
{
public:
    listStruct();

    void myRemove();//无需迭代器删除元素,最快,但是会删除所有值相同的
    
    void listIterErase();
    void listIterEraseA();
    void listIterEraseB();

    void myListEraseAndPush();
    void myListEraseAndPushA();

private:
    std::list<int> myList = {1,2,3,4,5};
};

#endif // LIST_H

#include "listStruct.h"
#include "algorithm"
#include <iostream>
listStruct::listStruct()
{}

void listStruct::myRemove()
{
    myList.remove(2);
}
//right
void listStruct::listIterErase()
{
    for(auto it = myList.begin(); it != myList.end();)
    {
        if(*it == 3)
        {
            it = myList.erase(it);//更新迭代器
        }

        else
        {
             ++it;
        }
    }
}

//wrong
void listStruct::listIterEraseA()
{
    for(auto it = myList.begin(); it != myList.end(); it++)
    {
        if(*it == 3)
        {
            myList.erase(it);//it成为野生，失效
        }
    }
}

//right
void listStruct::listIterEraseB()
{
    for(auto it = myList.begin(); it != myList.end(); it++)
    {
        if(*it == 3)
        {
            myList.erase(it);
            break;
        }
    }
}

//list删除后在尾部插入一样的
void listStruct::myListEraseAndPush()
{
    for(auto it = myList.begin(); it != myList.end(); it++)
    {
        if(*it == 3)
        {
            myList.erase(it);
            myList.push_back(6);
        }
    }
}

//list删除后在原来位置插入一样的
void listStruct::myListEraseAndPushA()
{
    for(auto it = myList.begin(); it != myList.end(); it++)
    {
        if(*it == 3)
        {
            auto nextIt = myList.erase(it);
            myList.insert(nextIt, 6);
        }
    }
}