线性表 - 带头结点的循环单链表 - c++编程基础

late T List ::operator[](const int n) const { if (n < 0 || n >= _size) return 0; int num = n; Node * pt = head->next; while(num--) pt = pt->next; return pt->data; }

main.cpp

#include #include "List.h" using namespace std; int main() { List link; link.push_back(31); link.push_front(23); link.push_back(12); link.push_back(32); link.push_back(76); link.push_back(93); link.push_back(34); link.show(); link.reverse(); link.del(12); link.show(); link.sort(); link.show(); link.reverse(); link.show(); cout <

线性表 - 带头结点的循环单链表(二)