STL中list的erase方法 (Removes elements at specified positions.)

iterator erase(iterator where);
iterator erase(iterator first, iterator last);

Remarks

The first member function removes the element of the
controlled sequence pointed to by where. You use it
to remove a single element.

The second member function removes the elements of the controlled 
sequence in the range [first,last). You use it to remove zero or more 
contiguous elements.

Both member functions return an iterator that designates the first 
element remaining beyond any elements removed, or list::end   
(STL/CLR)() if no such element exists.

When erasing elements, the number of element copies is linear in the
number of elements between the end of the erasure and the nearer 
end of the sequence. (When erasing one or more elements at either end 
of the sequence, no element copies occur.

Exmaple

// erase all elements but end

cliext::list<wchar_t>::iterator it = c1.end(); 
		System::Console::WriteLine("erase(begin(), end()-1) = {0}", 
        *c1.erase(c1.begin(), --it)); 
    System::Console::WriteLine("size() = {0}", c1.size()); 
    return (0); 
    }

自己写的方法

// if container is pointer, and you want to release memory, erase all but end

 cliext::list<wchar_t>::iterator it = c1.begin();
 		System::Console::WriteLine("erase(begin(), end()-1) = {0}");
			while (cl.empty == false)
				delete it;
				it = nullptr;
				it = cl.erase(it);
		System::Console::WriteLine("size() = {0}", c1.size()); 
    return (0); 
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值