C++ List的用法(整理)

 1 #include <iostream> 
 2 #include <list> 
 3 #include <numeric> 
 4 #include <algorithm> 
 5 using namespace std; 
 6 
 7 //创建一个list容器的实例LISTINT 
 8 typedef list<int> LISTINT; 
 9 //创建一个list容器的实例LISTCHAR 
10 typedef list<int> LISTCHAR; 
11 
12 void main() 
13 { 
14     //用list容器处理整型数据  
15     //用LISTINT创建一个名为listOne的list对象 
16     LISTINT listOne; 
17     //声明i为迭代器 
18     LISTINT::iterator i; 
19     
20     //从前面向listOne容器中添加数据 
21     listOne.push_front (2); 
22     listOne.push_front (1); 
23     
24     //从后面向listOne容器中添加数据 
25     listOne.push_back (3); 
26     listOne.push_back (4); 
27     
28     //从前向后显示listOne中的数据 
29     cout<<"listOne.begin()--- listOne.end():"<<endl; 
30     for (i = listOne.begin(); i != listOne.end(); ++i) 
31         cout << *i << " "; 
32     cout << endl; 
33     
34     //从后向后显示listOne中的数据 
35     LISTINT::reverse_iterator ir; 
36     cout<<"listOne.rbegin()---listOne.rend():"<<endl; 
37     for (ir =listOne.rbegin(); ir!=listOne.rend();ir++) { 
38         cout << *ir << " "; 
39     } 
40     cout << endl; 
41     
42     //使用STL的accumulate(累加)算法 
43     int result = accumulate(listOne.begin(), listOne.end(),0); 
44     cout<<"Sum="<<result<<endl; 
45     cout<<"------------------"<<endl; 
46     
47     //-------------------------- 
48     //用list容器处理字符型数据 
49     //-------------------------- 
50     
51     //用LISTCHAR创建一个名为listOne的list对象 
52     LISTCHAR listTwo; 
53     //声明i为迭代器 
54     LISTCHAR::iterator j; 
55     
56     //从前面向listTwo容器中添加数据 
57     listTwo.push_front (‘A‘); 
58     listTwo.push_front (‘B‘); 
59     
60     //从后面向listTwo容器中添加数据 
61     listTwo.push_back (‘x‘); 
62     listTwo.push_back (‘y‘); 
63     
64     //从前向后显示listTwo中的数据 
65     cout<<"listTwo.begin()---listTwo.end():"<<endl; 
66     for (j = listTwo.begin(); j != listTwo.end(); ++j) 
67         cout << char(*j) << " "; 
68     cout << endl; 
69     
70     //使用STL的max_element算法求listTwo中的最大元素并显示 
71     j=max_element(listTwo.begin(),listTwo.end()); 
72     cout << "The maximum element in listTwo is: "<<char(*j)<<endl; 
73 } 

 1 #include <iostream> 
 2 #include <list> 
 3 
 4 using namespace std; 
 5 typedef list<int> INTLIST; 
 6 
 7 //从前向后显示list队列的全部元素 
 8 void put_list(INTLIST list, char *name) 
 9 { 
10     INTLIST::iterator plist; 
11     
12     cout << "The contents of " << name << " : "; 
13     for(plist = list.begin(); plist != list.end(); plist++) 
14         cout << *plist << " "; 
15     cout<<endl; 
16 } 
17 
18 //测试list容器的功能 
19 void main(void) 
20 { 
21     //list1对象初始为空 
22     INTLIST list1; 
23     //list2对象最初有10个值为6的元素 
24     INTLIST list2(10,6); 
25     //list3对象最初有3个值为6的元素 
26     INTLIST list3(list2.begin(),--list2.end()); 
27     
28     //声明一个名为i的双向迭代器 
29     INTLIST::iterator i; 
30     
31     //从前向后显示各list对象的元素 
32     put_list(list1,"list1"); 
33     put_list(list2,"list2"); 
34     put_list(list3,"list3"); 
35     
36     //从list1序列后面添加两个元素 
37     list1.push_back(2); 
38     list1.push_back(4); 
39     cout<<"list1.push_back(2) and list1.push_back(4):"<<endl; 
40     put_list(list1,"list1"); 
41     
42     //从list1序列前面添加两个元素 
43     list1.push_front(5); 
44     list1.push_front(7); 
45     cout<<"list1.push_front(5) and list1.push_front(7):"<<endl; 
46     put_list(list1,"list1"); 
47     
48     //在list1序列中间插入数据 
49     list1.insert(++list1.begin(),3,9); 
50     cout<<"list1.insert(list1.begin()+1,3,9):"<<endl; 
51     put_list(list1,"list1"); 
52     
53     //测试引用类函数 
54     cout<<"list1.front()="<<list1.front()<<endl; 
55     cout<<"list1.back()="<<list1.back()<<endl; 
56     
57     //从list1序列的前后各移去一个元素 
58     list1.pop_front(); 
59     list1.pop_back(); 
60     cout<<"list1.pop_front() and list1.pop_back():"<<endl; 
61     put_list(list1,"list1"); 
62     
63     //清除list1中的第2个元素 
64     list1.erase(++list1.begin()); 
65     cout<<"list1.erase(++list1.begin()):"<<endl; 
66     put_list(list1,"list1"); 
67     
68     //对list2赋值并显示 
69     list2.assign(8,1); 
70     cout<<"list2.assign(8,1):"<<endl; 
71     put_list(list2,"list2"); 
72     
73     //显示序列的状态信息 
74     cout<<"list1.max_size(): "<<list1.max_size()<<endl; 
75     cout<<"list1.size(): "<<list1.size()<<endl; 
76     cout<<"list1.empty(): "<<list1.empty()<<endl; 
77     
78     //list序列容器的运算 
79     put_list(list1,"list1"); 
80     put_list(list3,"list3"); 
81     cout<<"list1>list3: "<<(list1>list3)<<endl; 
82     cout<<"list1<list3: "<<(list1<list3)<<endl; 
83     
84     //对list1容器排序 
85     list1.sort(); 
86     put_list(list1,"list1"); 
87     
88     //结合处理 
89     list1.splice(++list1.begin(), list3); 
90     put_list(list1,"list1"); 
91     put_list(list3,"list3"); 
92 }