C++list操作

#include <iostream>
#include <string>
#include<list>
using namespace std;
template <typename T>
bool SortPredicate_Descending(const int& lsh, const int& rsh)
{
 return(lsh > rsh);
}
void DisplayVector(const T& vecInput)
{
 for (auto iElement = vecInput.cbegin(); iElement != vecInput.cend();
 ++iElement)
 {
  cout << *iElement << " ";
  cout << endl;
 }
}
int main()
{
 //list <int> listIntegers1;
 //listIntegers1.insert(listIntegers1.begin(), 2);
 //listIntegers1.insert(listIntegers1.begin(), 1);
 //listIntegers1.insert(listIntegers1.end(), 3);
 //cout << "the contents of list 1 after inserting elements:" << endl;
 //DisplayVector(listIntegers1);
 //list <int> listIntegers2;
 //listIntegers2.insert(listIntegers2.begin(), 4, 0);
 //cout << "the contents of list 2 after inserting";
 //cout << listIntegers2.size() << "elements of a value" << endl;
 //DisplayVector(listIntegers2);
 //list <int> listIntegers3;
 //listIntegers3.insert(listIntegers3.begin(), listIntegers1.begin(), listIntegers1.end());
 //cout << "the contents of list 3 after inserting the contents";
 //cout << "list 1 at the beginning:" << endl;
 //DisplayVector(listIntegers3);
 //listIntegers3.insert(listIntegers3.end(), listIntegers2.begin(), listIntegers2.end());
 //cout << "the contents of list 3 after inserting";
 //DisplayVector(listIntegers3);
 //list <int> listIntegers;
 //listIntegers.push_back(4);
 //listIntegers.push_back(3);
 //listIntegers.push_back(5);
 //listIntegers.push_back(2);
 //auto iValue2 = listIntegers.insert(listIntegers.begin(), 2);
 //cout << "Initial contents of the list:" << endl;
 //DisplayVector(listIntegers);
 //listIntegers.erase(listIntegers.begin(), iValue2); //删除指定范围的元素
 //cout << "Contents after erasing a range of elements:" << endl;
 //DisplayVector(listIntegers);
 //cout << "After ereasing element" << *iValue2 << "':" << endl;
 //listIntegers.erase(iValue2);
 //DisplayVector(listIntegers);
 //listIntegers.erase(listIntegers.begin(), listIntegers.end());
 //cout << "Number of elements after erasing range:";
 //cout << listIntegers.size() << endl;
 list <int> listIntegers;
 listIntegers.push_back(4);
 listIntegers.push_back(3);
 listIntegers.push_back(2);
 listIntegers.push_back(1);
 listIntegers.push_back(0);
 listIntegers.push_back(5);
 cout << "Intial contents of the list:" << endl;
 DisplayVector(listIntegers);
 listIntegers.reverse();
 cout << "Content of the list after using reverse():" << endl;
 DisplayVector(listIntegers);
 listIntegers.sort();
 cout << "order of element after sort():" << endl;
 DisplayVector(listIntegers);
 system("pause");
 return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值