list是一个双向列表容器，完成了标准C++数据结构中链表的所有功能;
list与vector和deque类似，只不过其中的对象提供了对元素的随机访问。
STL以双向链表的方式实现list,访问需要从链表的某个端点开始;
list对象插入和删除一个元素所需时间与该元素在链表中的位置无关。
list不提供随机存取(No!),其优势是任何位置插入和删除都非常迅速;
在list中移动一段元素比在vector和deque中要快得多，在需要时可改变自身大小。
C++ Code
|
1
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 |
/* stllist.cpp
list是一个双向列表容器，完成了标准C++数据结构中链表的所有功能; list与vector和deque类似，只不过其中的对象提供了对元素的随机访问。 STL以双向链表的方式实现list,访问需要从链表的某个端点开始; list对象插入和删除一个元素所需时间与该元素在链表中的位置无关。 list不提供随机存取(No!),其优势是任何位置插入和删除都非常迅速; 在list中移动一段元素比在vector和deque中要快得多，在需要时可改变自身大小。 */ #include <iostream> #include <list> #include <string> using namespace std; typedef list<string> LISTSTRING; typedef list<string>::iterator LISTSTRING_ITER; typedef list<int>::iterator LISTINT_ITER; template<class T> class is_odd { public: bool operator()(T &val) { return (val % 2) == 1; } }; int main(void) { //list赋值 //push_front(); //push_back(); //pop_front(); //pop_back(); list<int> myList; myList.push_back(10); myList.push_front(8); //list大小度量函数 list<int> c1; list<int>::size_type i; c1.push_back(23); i = c1.size(); cout << "The c1 size is " << i << endl; c1.push_back(24); i = c1.size(); cout << "The c1 size is " << i << endl; c1.push_back(25); c1.push_back(26); c1.resize(5, 50); i = c1.size(); cout << "The c1 size is " << i << endl; i = c1.max_size(); cout << "The c1 max size is " << i << endl; //list返回函数 //begin front rbegin 下同 //end back rend int nTmpFront = myList.front(); int nTmpBack = myList.back(); cout << nTmpFront << endl; cout << nTmpBack << endl; //... //判断是否为空 if (myList.empty()) { cout << "list is empty!" << endl; } //list元素访问 //无at 也无operator[] LISTSTRING strList; strList.push_back("AA"); strList.push_back("BB"); strList.push_back("CC"); strList.push_back("DD"); LISTSTRING_ITER pListIter; for (pListIter = strList.begin(); pListIter != strList.end(); pListIter++) { cout << *pListIter << endl; } //list重置技术 LISTSTRING strList1; strList1.push_back("AAaa"); strList1.push_back("BBbb"); strList1.push_back("CCcc"); strList1.push_back("DDdd"); strList.assign(strList1.begin(), strList1.end()); for (pListIter = strList.begin(); pListIter != strList.end(); pListIter++) { cout << *pListIter << endl; } //list容器内容交换 LISTSTRING strListPre; strListPre.push_back("AA"); strListPre.push_back("BB"); strListPre.push_back("CC"); strListPre.push_back("DD"); cout << "strListPre :" << endl; for (pListIter = strListPre.begin(); pListIter != strListPre.end(); pListIter++) { cout << *pListIter << endl; } LISTSTRING strListPost; strListPost.push_back("aa"); strListPost.push_back("bb"); strListPost.push_back("cc"); strListPost.push_back("dd"); cout << "strListPost :" << endl; for (pListIter = strListPost.begin(); pListIter != strListPost.end(); pListIter++) { cout << *pListIter << endl; } strListPre.swap(strListPost); cout << "strListPre :" << endl; for (pListIter = strListPre.begin(); pListIter != strListPre.end(); pListIter++) { cout << *pListIter << endl; } cout << "strListPost :" << endl; for (pListIter = strListPost.begin(); pListIter != strListPost.end(); pListIter++) { cout << *pListIter << endl; } //list插入和删除技术 LISTSTRING listString; listString.push_back("Michael Jordan"); listString.push_back("Kobe Bryant"); listString.push_back("Lebron James"); listString.push_back("James Harden"); for (pListIter = listString.begin(); pListIter != listString.end(); pListIter++) { cout << *pListIter << endl; } pListIter = listString.begin(); listString.insert(pListIter, "Jerry West"); pListIter++; pListIter++; listString.insert(pListIter, "Tim Duncan"); pListIter = listString.end(); listString.insert(pListIter, "Stephen Curry"); for (pListIter = listString.begin(); pListIter != listString.end(); pListIter++) { cout << *pListIter << endl; } //erase操作 pListIter = listString.begin(); listString.erase(pListIter); cout << "after erase :" << endl; for (pListIter = listString.begin(); pListIter != listString.end(); pListIter++) { cout << *pListIter << endl; } //clear操作 //erase(list::begin(), list::end()) list<int> listInt; listInt.push_back(97); listInt.push_back(98); listInt.push_back(99); cout << "size of listInt is " << listInt.size() << endl; listInt.clear(); cout << "size of listInt is " << listInt.size() << endl; //list模板类函数 // == > >= < <=等等 操作省略 //list特殊函数 //与vector和deque相比，除了具有以上相同的函数外，还具有一些特殊函数 //merge remove remove_if sort splice list<int> listMerge; listMerge.push_back(2); listMerge.push_back(4); list<int> listMerge1; listMerge1.push_back(5); listMerge1.push_back(3); listMerge.merge(listMerge1); listMerge.sort(); for (LISTINT_ITER pListIntIter = listMerge.begin(); pListIntIter != listMerge.end(); pListIntIter++) { cout << *pListIntIter << endl; } listInt.push_back(52); listInt.push_back(53); listInt.push_back(54); listInt.remove(53); for (LISTINT_ITER pListIntIter = listInt.begin(); pListIntIter != listInt.end(); pListIntIter++) { cout << *pListIntIter << endl; } cout << endl; list<int> cl1; LISTINT_ITER pInt1, pInt2; cl1.push_back(1); cl1.push_back(2); cl1.push_back(3); cl1.push_back(4); cl1.push_back(5); cl1.push_back(6); for (LISTINT_ITER pListIntIter = cl1.begin(); pListIntIter != cl1.end(); pListIntIter++) { cout << *pListIntIter << endl; } cout << endl; list<int> cl2 = cl1; cl2.remove_if(is_odd<int>()); for (LISTINT_ITER pListIntIter = cl2.begin(); pListIntIter != cl2.end(); pListIntIter++) { cout << *pListIntIter << endl; } cout << endl; //比merge更好用的splice cl1.splice(cl1.end(), cl2); for (LISTINT_ITER pListIntIter = cl1.begin(); pListIntIter != cl1.end(); pListIntIter++) { cout << *pListIntIter << endl; } cout << endl; //保证任意连个连续存储值不同 list<int> listUnique; listUnique.push_back(2); listUnique.push_back(2); listUnique.push_back(3); listUnique.push_back(3); listUnique.push_back(5); list<int> listUniqueTmp = listUnique; for (LISTINT_ITER pListIntIter = listUnique.begin(); pListIntIter != listUnique.end(); pListIntIter++) { cout << *pListIntIter << endl; } cout << endl; //任意两个具有相同值的连续对象的后者删除 listUnique.unique(); for (LISTINT_ITER pListIntIter = listUnique.begin(); pListIntIter != listUnique.end(); pListIntIter++) { cout << *pListIntIter << endl; } cout << endl; //把和第一个元素不同的值删除 not_equal_to<int> mypred; listUniqueTmp.unique(mypred); for (LISTINT_ITER pListIntIter = listUniqueTmp.begin(); pListIntIter != listUniqueTmp.end(); pListIntIter++) { cout << *pListIntIter << endl; } cout << endl; cin.get(); return 0; } |