list删除一个元素

最新推荐文章于 2024-09-26 07:38:54 发布

pirate_sir

最新推荐文章于 2024-09-26 07:38:54 发布

阅读量1.3k

点赞数

分类专栏：随笔

本文链接：https://blog.csdn.net/pirate_sir/article/details/87878301

版权

随笔专栏收录该内容

9 篇文章 0 订阅

订阅专栏

#include "stdafx.h"
#include <list>
#include <iostream>

using namespace std;
list<int*> testList;

void delNode(int * node)
{
list<int*>::iterator it = testList.begin();
list<int*>::iterator itEnd = testList.end();
for (; it != itEnd; )
{
  if (*it == node)
  {
   list<int *>::iterator tmpIT = it++;    //erase可能会导致迭代器失效，故做此处理。
   testList.erase(tmpIT);
  }else {
   it++;
  }
}
}

void delNodeFunc2(int * node)
{
list<int * > ::iterator findNode = find(testList.begin(), testList.end(), node);
if (findNode != testList.end()) {
testList.erase(findNode);
}
}

void printList()
{
list<int *>::iterator it = testList.begin();
for (; it!=testList.end(); it++)
{
cout << *(*it) << endl;
}
}

int main()
{
int a = 100;
int b = 200;
int c = 300;
testList.push_back(&a);
testList.push_back(&b);
testList.push_back(&c);

cout << "before testList.size = " << testList.size() << endl;
printList();

delNode(&b);

delNodeFunc2(&a);

cout <<"after testList.size = " <<testList.size() << endl;
printList();

return 0;
}