2. list.h<\/h2>\n
#pragma once
\n#include<iostream>
\n#include<list>
\n#include<vector>
\n#include"reverse_iterator.h"
\nusing namespace std;<\/p>\n
namespace li
\n{};<\/p>\n
2.1 \u94fe\u8868\u8282\u70b9：list_node<\/h3>\n
template<class T>
\nstruct list_node
\n{
\nT _data;
\nlist_node<T>* _next;
\nlist_node<T>* _prev;<\/p>\n
\/\/ \u8282\u70b9\u6784\u9020\u51fd\u6570
\nlist_node(const T& val = T())
\n:_data(val)
\n, _next(nullptr)
\n, _prev(nullptr)
\n{}
\n};<\/p>\n
\u89e3\u6790 \u6709\u54e8\u5175\u4f4d\u7684\u53cc\u5411\u94fe\u8868\u8282\u70b9，\u6bcf\u4e2a\u8282\u70b9\u4fdd\u5b58\u6570\u636e\u3001\u524d\u9a71\u3001\u540e\u7ee7\u6307\u9488<\/span>\u3002 \u6784\u9020\u51fd\u6570\u7ed9\u9ed8\u8ba4\u53c2\u6570T()，\u5934\u7ed3\u70b9\u5c31\u662f\u8c03\u7528\u8fd9\u4e2a\u6784\u9020，\u5934\u7ed3\u70b9\u4e0d\u5b58\u50a8\u6709\u6548\u6570\u636e，\u4ec5\u5360\u4f4d，\u7edf\u4e00\u5934\u5c3e\u64cd\u4f5c\u903b\u8f91<\/span>\u3002<\/p>\n template<class T, class Ref, class Ptr> \/\/ \u8fed\u4ee3\u5668\u6784\u9020\u51fd\u6570 \u89e3\u6790：\u8fed\u4ee3\u5668\u672c\u8d28\u5c31\u662f\u5c01\u88c5\u8282\u70b9\u6307\u9488\u3002 \u6a21\u677f\u53c2\u6570\u8bf4\u660e：<\/p>\n \/\/ \u89e3\u5f15\u7528\u91cd\u8f7d *it \u89e3\u6790：\u8fd4\u56de\u5f15\u7528，\u666e\u901a\u8fed\u4ee3\u5668\u53ef\u8bfb\u53ef\u5199，const \u8fed\u4ee3\u5668\u53ea\u8bfb\u3002<\/p>\n \/\/ ->\u91cd\u8f7d it-> \u89e3\u6790：\u8fd4\u56de\u6570\u636e\u6307\u9488，\u652f\u6301it->member\u8bbf\u95ee\u3002<\/p>\n \/\/ \u524d\u7f6e++ ++it \u89e3\u6790：\u8fed\u4ee3\u5668\u79fb\u52a8\u5230\u4e0b\u4e00\u4e2a\u8282\u70b9，\u8fd4\u56de\u81ea\u8eab\u5f15\u7528，\u652f\u6301\u8fde\u7eed++ ++it\u3002<\/p>\n \/\/ \u540e\u7f6e++ it++ \u89e3\u6790：int \u53ea\u662f\u5360\u4f4d\u53c2\u6570，\u7528\u6765\u533a\u5206\u524d\u7f6e \/ \u540e\u7f6e\u3002\u5148\u4fdd\u5b58\u65e7\u8fed\u4ee3\u5668，\u8282\u70b9\u540e\u79fb，\u8fd4\u56de\u65e7\u72b6\u6001\u3002<\/p>\n \/\/ \u524d\u7f6e– –it \u89e3\u6790：\u8fed\u4ee3\u5668\u5411\u524d\u79fb\u52a8\u5230\u4e0a\u4e00\u4e2a\u8282\u70b9\u3002<\/p>\n \/\/ \u540e\u7f6e– it– \/\/ != \u5224\u65ad \/\/ == \u5224\u65ad \u5224\u65ad\u7684\u662f，\u4e24\u4e2a\u5730\u5740\u662f\u5426\u76f8\u7b49<\/span><\/p>\n template<class T> \/\/ \u53cd\u5411\u8fed\u4ee3\u5668\u7c7b\u578b void empty_init() \u00a0\u4f5c\u7528：\u521b\u5efa\u5934\u7ed3\u70b9，\u6784\u5efa\u7a7a\u53cc\u5411\u5faa\u73af\u94fe\u8868，size \u7f6e 0\u3002<\/span><\/p>\n list() \u89e3\u6790：\u8c03\u7528\u521d\u59cb\u5316\u51fd\u6570，\u521b\u5efa\u7a7a\u94fe\u8868\u3002<\/p>\n ~list() \u89e3\u6790：\u5148\u91ca\u653e\u5168\u90e8\u6709\u6548\u8282\u70b9，\u518d\u91ca\u653e\u5934\u7ed3\u70b9，\u9632\u6b62\u5185\u5b58\u6cc4\u6f0f<\/span>\u3002<\/p>\n list(const list<T>& l) \u89e3\u6790：\u73b0\u4ee3\u5199\u6cd5，\u5148\u521d\u59cb\u5316\u7a7a\u94fe\u8868，\u904d\u5386\u539f list \u9010\u4e2a\u5c3e\u63d2<\/span>\u3002<\/p>\n list(initializer_list<T> l) \u89e3\u6790：\u652f\u6301li::list<int> lt{1,2,3,4}\u8fd9\u79cd\u82b1\u62ec\u53f7\u521d\u59cb\u5316\u3002<\/p>\n void swap(list<T>& lt) \u89e3\u6790：O (1) \u65f6\u95f4\u590d\u6742\u5ea6，\u4ec5\u4ec5\u4ea4\u6362\u5934\u7ed3\u70b9\u6307\u9488\u548c size，\u4e0d\u62f7\u8d1d\u8282\u70b9<\/span>\u3002<\/p>\n list& operator=(list lt) \u89e3\u6790：\u53c2\u6570\u4f20\u503c，\u81ea\u52a8\u8c03\u7528\u62f7\u8d1d\u6784\u9020\u751f\u6210\u4e34\u65f6\u5bf9\u8c61；swap \u4ea4\u6362\u8d44\u6e90；\u51fd\u6570\u7ed3\u675f\u4e34\u65f6\u5bf9\u8c61\u9500\u6bc1，\u5e26\u8d70\u65e7\u5185\u5b58<\/span>\u3002\u5929\u7136\u5904\u7406\u81ea\u8d4b\u503c\u3002<\/p>\n void clear() \u274c\u9519\u8bef\u5199\u6cd5：<\/p>\n erase(it); erase \u4e4b\u540e pos \u8fed\u4ee3\u5668\u76f4\u63a5\u5931\u6548，++it \u662f\u672a\u5b9a\u4e49\u884c\u4e3a\u3002<\/p>\n \u2705\u6b63\u786e：it = erase(it) erase \u8fd4\u56de\u4e0b\u4e00\u4e2a\u6709\u6548\u8fed\u4ee3\u5668\u3002<\/p>\n reverse_iterator rbegin() const_reverse_iterator rbegin()const \u89e3\u6790：\u53cd\u5411\u8fed\u4ee3\u5668\u9002\u914d\u5668，rbegin \u5305\u88c5\u6b63\u5411 end，rend \u5305\u88c5\u6b63\u5411 begin\u3002<\/p>\n iterator begin() const_iterator begin()const \u89e3\u6790：<\/p>\n void push_back(const T& x) \u89e3\u6790：\u590d\u7528 insert，\u5728 end \u524d\u9762\u63d2\u5165\u8282\u70b9，\u5c31\u662f\u5c3e\u63d2\u3002<\/p>\n void push_front(const T& x) void pop_back() \u89e3\u6790：–end()\u62ff\u5230\u6700\u540e\u4e00\u4e2a\u6709\u6548\u8282\u70b9\u8fed\u4ee3\u5668，\u76f4\u63a5 erase \u5220\u9664\u3002<\/p>\n void pop_front() iterator insert(iterator pos, T val) newnode->_next = pcur; ++_size; \u89e3\u6790：STL \u89c4\u5b9a insert \u662f\u5728 pos \u8fed\u4ee3\u5668\u524d\u9762\u63d2\u5165\u8282\u70b9\u3002 \u56db\u6b65\u6307\u9488\u94fe\u63a5，insert\u4e0d\u4f1a\u8ba9\u4efb\u4f55\u8fed\u4ee3\u5668\u5931\u6548\u3002\u8fd4\u56de\u65b0\u8282\u70b9\u8fed\u4ee3\u5668\u3002<\/span><\/p>\n iterator erase(iterator pos) prev->_next = next; delete cur; \u89e3\u6790：\u5220\u9664 pos \u6307\u5411\u8282\u70b9，pos \u8fed\u4ee3\u5668\u5931\u6548，\u5176\u4ed6\u8fed\u4ee3\u5668\u4fdd\u6301\u6709\u6548\u3002\u8fd4\u56de\u4e0b\u4e00\u4e2a\u8282\u70b9\u8fed\u4ee3\u5668\u3002<\/p>\n size_t size()const \u8bbe\u8ba1\u601d\u8def：<\/p>\n #pragma once \/\/ \u6784\u9020\u51fd\u6570 \/\/ \u89e3\u5f15\u7528 \u89e3\u6790：\u5e95\u5c42\u6b63\u5411\u8fed\u4ee3\u5668\u662f\u5c3e\u540e\u8fed\u4ee3\u5668，\u4e0d\u80fd\u76f4\u63a5\u89e3\u5f15\u7528，\u62f7\u8d1d\u4e34\u65f6\u8fed\u4ee3\u5668\u5411\u524d\u632a\u4e00\u4f4d\u53d6\u503c<\/span>\u3002<\/p>\n \/\/ ->\u91cd\u8f7d \/\/ \u53cd\u5411\u8fed\u4ee3\u5668 ++ \u89e3\u6790：\u53cd\u5411\u8fed\u4ee3\u5668 ++ \u7b49\u4ef7\u5e95\u5c42\u6b63\u5411\u8fed\u4ee3\u5668 –\u3002<\/p>\n \/\/ \u53cd\u5411\u8fed\u4ee3\u5668 — \u89e3\u6790：\u53cd\u5411\u8fed\u4ee3\u5668 — \u7b49\u4ef7\u5e95\u5c42\u6b63\u5411\u8fed\u4ee3\u5668 ++\u3002<\/p>\n bool operator!=(const Self& s) \u6838\u5fc3\u539f\u7406：\u53cd\u5411\u8fed\u4ee3\u5668\u4e0d\u7ef4\u62a4\u8282\u70b9\u6307\u9488，\u4ec5\u4ec5\u5305\u88c5\u6b63\u5411\u8fed\u4ee3\u5668<\/span>\u3002 \u2757\u9762\u8bd5\u8003\u70b9：\u4e3a\u4ec0\u4e48\u62f7\u8d1d tmp，\u4e0d\u80fd\u76f4\u63a5–_it？ \u5982\u679c\u76f4\u63a5\u4fee\u6539_it，\u4f1a\u7834\u574f\u53cd\u5411\u8fed\u4ee3\u5668\u5e95\u5c42\u4fdd\u5b58\u7684\u8fed\u4ee3\u5668\u72b6\u6001，\u904d\u5386\u903b\u8f91\u9519\u4e71\u3002\u53ea\u80fd\u4e34\u65f6\u62f7\u8d1d\u4e00\u4efd\u518d\u81ea\u51cf\u3002<\/span><\/p>\n #include"list.h" \/\/\u53cd\u5411\u904d\u5386 lt.push_back(6); \u4f18\u70b9：<\/p>\n \u7f3a\u70b9：<\/p>\n \u6210\u5458\u53d8\u91cf：Node* _head; \u54e8\u5175\u5934\u7ed3\u70b9<\/p>\n 1. \u6574\u4f53\u67b6\u6784\u9884\u89c8STL std::list\u5e95\u5c42\u662f\u5e26\u5934\u7ed3\u70b9\u53cc\u5411\u5faa\u73af\u94fe\u8868\u3002 \u96be\u70b9\u4e0d\u5728\u4e8e\u94fe\u8868\u589e\u5220\u8282\u70b9，\u800c\u5728\u8fed\u4ee3\u5668\u5c01\u88c5：\u539f\u751f\u6307\u9488Node*\u4e0d\u7b26\u5408\u8fed\u4ee3\u5668\u89c4\u8303，\u9700\u8981\u5c01\u88c5\u8fed\u4ee3\u5668\u7c7b\u3002\u4e3a\u4e86\u907f\u514d\u666e\u901a\u8fed\u4ee3\u5668\u3001const \u8fed\u4ee3\u5668\u5199\u4e24\u4efd\u51e0\u4e4e\u5b8c\u5168\u4e00\u6837\u7684\u4ee3\u7801，\u6211\u4eec\u5229\u7528\u6a21\u677f\u53c2\u6570Ref\u3001Ptr\u5b9e\u73b0\u4ee3\u7801\u590d\u7528\u3002\u53cd\u5411\u8fed\u4ee3\u5668\u91c7\u7528\u9002\u914d\u5668\u6a21\u5f0f：\u4e0d\u91cd\u65b0\u5b9e\u73b0\u4e00\u5957\u53cd\u5411\u904d\u5386\u903b\u8f91，\u5305\u88c5\u6b63\u5411\u8fed\u4ee3\u5668，\u590d\u7528\u5df2\u6709\u6240\u6709\u8fed\u4ee3\u5668\u8fd0\u7b97\u7b26\u3002\u7ec4\u4ef6\u6e05\u5355&<\/p>\n","protected":false},"author":2,"featured_media":113925,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[11653,55,3027,2640],"topic":[],"class_list":["post-113926","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-server","tag-11653","tag-c","tag-list","tag-2640"],"yoast_head":"\n2.2 \u6b63\u5411\u8fed\u4ee3\u5668 _list_iterator<\/h3>\n
\nstruct _list_iterator
\n{
\ntypedef list_node<T> Node;
\ntypedef _list_iterator<T, Ref, Ptr> Self;
\nNode* _node;<\/p>\n
\n_list_iterator(Node* node)
\n:_node(node)
\n{}<\/p>\n\n
\nRef operator*()
\n{
\nreturn _node->_data;
\n}<\/p>\n
\nPtr operator->()
\n{
\nreturn &_node->_data;
\n}<\/p>\n
\nSelf& operator++()
\n{
\n_node = _node->_next;
\nreturn *this;
\n}<\/p>\n
\nSelf operator++(int)
\n{
\nSelf tmp(*this);
\n_node = _node->_next;
\nreturn tmp;
\n}<\/p>\n
\nSelf& operator–()
\n{
\n_node = _node->_prev;
\nreturn *this;
\n}<\/p>\n
\nSelf operator–(int)
\n{
\nSelf tmp(*this);
\n_node = _node->_prev;
\nreturn tmp;
\n}<\/p>\n
\nbool operator!=(const Self& it)const
\n{
\nreturn _node != it._node;
\n}<\/p>\n
\nbool operator==(const Self& it)const
\n{
\nreturn _node == it._node;
\n}
\n};<\/p>\n2.3 list \u5bb9\u5668\u7c7b，\u9010\u4e2a\u51fd\u6570\u62c6\u89e3<\/h3>\n
\nclass list
\n{
\ntypedef list_node<T> Node;
\npublic:
\n\/\/ \u7c7b\u578b\u91cd\u5b9a\u4e49：\u5b9e\u4f8b\u5316\u4e24\u79cd\u6b63\u5411\u8fed\u4ee3\u5668
\ntypedef _list_iterator<T, T&, T*> iterator;
\ntypedef _list_iterator<T, const T&, const T*> const_iterator;<\/p>\n
\ntypedef reverseiterator<iterator, T&, T*> reverse_iterator;
\ntypedef reverseiterator<const_iterator, const T&, const T*> const_reverse_iterator;<\/p>\nempty_init \u521d\u59cb\u5316\u51fd\u6570<\/h4>\n
\n{
\n_head = new Node;
\n_head->_next = _head;
\n_head->_prev = _head;
\n_size = 0;
\n}<\/p>\n\u9ed8\u8ba4\u6784\u9020<\/h4>\n
\n{
\nempty_init();
\n}<\/p>\n\u6790\u6784\u51fd\u6570<\/h4>\n
\n{
\nclear();
\ndelete _head;
\n_head = nullptr;
\n}<\/p>\n\u62f7\u8d1d\u6784\u9020\u51fd\u6570<\/h4>\n
\n{
\nempty_init();
\nfor (const auto& e : l)
\n{
\npush_back(e);
\n}
\n}<\/p>\ninitializer_list \u6784\u9020<\/h4>\n
\n{
\nempty_init();
\nfor (const auto& e : l)
\n{
\npush_back(e);
\n}
\n}<\/p>\nswap \u4ea4\u6362\u51fd\u6570<\/h4>\n
\n{
\nstd::swap(_head, lt._head);
\nstd::swap(_size, lt._size);
\n}<\/p>\n\u8d4b\u503c\u91cd\u8f7d（\u73b0\u4ee3\u5199\u6cd5）<\/h4>\n
\n{
\nswap(lt);
\nreturn *this;
\n}<\/p>\nclear \u6e05\u7a7a\u6240\u6709\u6709\u6548\u8282\u70b9<\/h4>\n
\n{
\niterator it = begin();
\nwhile (it != end())
\n{
\nit = erase(it);
\n}
\n}<\/p>\n
\n++it;<\/p>\nrbegin \/rend \u53cd\u5411\u8fed\u4ee3\u5668\u63a5\u53e3<\/h4>\n
\n{
\nreturn reverse_iterator(end());
\n}
\nreverse_iterator rend()
\n{
\nreturn reverse_iterator(begin());
\n}<\/p>\n
\n{
\nreturn const_reverse_iterator(end());
\n}
\nconst_reverse_iterator rend()const
\n{
\nreturn const_reverse_iterator(begin());
\n}<\/p>\nbegin \/end \u6b63\u5411\u8fed\u4ee3\u5668\u63a5\u53e3<\/h4>\n
\n{
\nreturn iterator(_head->_next);
\n}
\niterator end()
\n{
\nreturn iterator(_head);
\n}<\/p>\n
\n{
\nreturn const_iterator(_head->_next);
\n}
\nconst_iterator end()const
\n{
\nreturn const_iterator(_head);
\n}<\/p>\n\n
push_back \u5c3e\u63d2<\/h4>\n
\n{
\ninsert(end(), x);
\n}<\/p>\npush_front \u5934\u63d2<\/h4>\n
\n{
\ninsert(begin(), x);
\n}<\/p>\npop_back \u5c3e\u5220<\/h4>\n
\n{
\nerase(–end());
\n}<\/p>\npop_front \u5934\u5220<\/h4>\n
\n{
\nerase(begin());
\n}<\/p>\ninsert \u63d2\u5165\u51fd\u6570<\/h4>\n
\n{
\nNode* newnode = new Node(val);
\nNode* pcur = pos._node;
\nNode* prev = pcur->_prev;<\/p>\n
\npcur->_prev = newnode;
\nnewnode->_prev = prev;
\nprev->_next = newnode;<\/p>\n
\nreturn iterator(newnode);
\n}<\/p>\nerase \u5220\u9664\u51fd\u6570<\/h4>\n
\n{
\nNode* cur = pos._node;
\nNode* prev = cur->_prev;
\nNode* next = cur->_next;<\/p>\n
\nnext->_prev = prev;<\/p>\n
\n–_size;
\nreturn iterator(next);
\n}<\/p>\nsize \u83b7\u53d6\u5143\u7d20\u4e2a\u6570<\/h4>\n
\n{
\nreturn _size;
\n}
\nprivate:
\nNode* _head;
\nsize_t _size = 0;
\n};
\n} \/\/namespace li<\/p>\n3. reverse_iterator.h \u53cd\u5411\u8fed\u4ee3\u5668\u9002\u914d\u5668，\u9010\u51fd\u6570\u62c6\u5206<\/h2>\n
![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/10\/20261007144912-6ac65be852c83.png\")
<\/p>\n
\ntemplate<class Iterator, class Ref, class Ptr>
\nstruct reverseiterator
\n{
\ntypedef reverseiterator<Iterator, Ref, Ptr> Self;
\nIterator _it;<\/p>\n
\nreverseiterator(Iterator it)
\n:_it(it)
\n{}<\/p>\n
\nRef operator*()
\n{
\nIterator tmp = _it;
\n–tmp;
\nreturn *tmp;
\n}<\/p>\n
\nPtr operator->()
\n{
\nreturn &(operator*());
\n}<\/p>\n
\nSelf& operator++()
\n{
\n–_it;
\nreturn *this;
\n}<\/p>\n
\nSelf& operator–()
\n{
\n++_it;
\nreturn *this;
\n}<\/p>\n
\n{
\nreturn _it != s._it;
\n}
\nbool operator==(const Self& s)
\n{
\nreturn _it == s._it;
\n}
\n};<\/p>\n
\n4. main.cpp \u6d4b\u8bd5\u4ee3\u7801<\/h2>\n
\nint main()
\n{
\nli::list<int> lt{ 1,2,3,4,5 };
\n\/\/\u6b63\u5411\u904d\u5386
\nli::list<int>::iterator it = lt.begin();
\nwhile (it != lt.end())
\n{
\ncout << *it << " ";
\n++it;
\n}
\ncout << endl;<\/p>\n
\nli::list<int>::reverse_iterator rit = lt.rbegin();
\nwhile (rit != lt.rend())
\n{
\ncout << *rit << " ";
\n++rit;
\n}
\ncout << endl;<\/p>\n
\nlt.push_front(0);
\nlt.pop_back();
\nlt.pop_front();
\nfor (auto x : lt)
\n{
\ncout << x << " ";
\n}
\nreturn 0;
\n}<\/p>\n5\u3001list \u4f18\u7f3a\u70b9\u603b\u7ed3<\/h2>\n
\u6ce8\u610f<\/h2>\n
\n
\n
\u603b\u7ed3<\/h2>\n
\n