for循环逐行输出列表内容

状态	递交者	时间	内存	语言	代码	递交时间
AC	手搓STL stack 双向无环链表 _ 向量 2种实现方式: template <typename Map_Type> class Stack_l /* Stack _ List / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }Data; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }; public: unsigned int size(void) { return Data.List_Size; } Map_Type& top(void) { return Data.endp -> Node_Data; } void data(void) { return &Data; } bool empty(void) { return !((bool)Data.headp); } Stack_l<Map_Type>& push(Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type& push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type* push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(const Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = (Map_Type)push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& pop(void) { if (Data.headp) { if (Data.List_Size == 1u) { delete Data.headp; Data.List_Size = 0; Data.headp = 0; Data.endp = 0; } else { Data.endp = Data.endp -> lastp; delete Data.endp -> nextp; Data.endp -> nextp = 0; --Data.List_Size; } } return this; } Stack_l<Map_Type>& clear(void) { while (Data.List_Size) { pop(); } return this; } Stack_l<Map_Type>(void) { /* NULL / } Stack_l<Map_Type>(unsigned int data_size, Map_Type map_data) { Data.List_Size = data_size; while (data_size--) { Node nodep = new Node(); nodep -> Node_Data = map_data; if (Data.headp) { nodep -> lastp = Data.endp; Data.endp -> nextp = nodep; Data.endp = nodep; } else { Data.headp = nodep; Data.endp = nodep; } } } Stack_l<Map_Type>(Stack_l<Map_Type>& map_data) { if (!map_data.empty()) { List_Data listp = (List_Data)map_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; } } Stack_l<Map_Type>& operator=(Stack_l<Map_Type>& copy_data) { if (copy_data.empty()) return this; List_Data listp = (List_Data)copy_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; return this; } bool operator==(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() != Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return true; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return false; } return true; } bool operator!=(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() == Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return false; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return true; } return true; } ~Stack_l<Map_Type>(void) { clear(); } }; /* Stack _ List / template <typename Map_Type> class Stack_v / Stack _ Vector / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }Data; public: unsigned int size(void) { return Data.lastp - Data.headp; } Map_Type& top(void) { return (Data.lastp - 1); } void* data(void) { return &Data; } bool full(void) { if (!Data.headp) return true; return Data.endp + 1 == Data.lastp; } bool empty(void) { if (!Data.headp) return true; return Data.headp == Data.lastp; } Stack_v<Map_Type>& push(Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type& push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type* push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(const Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = (Map_Type)push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& pop(void) { if (empty()) { if (Data.lastp - Data.headp > 1) Data.resize((Data.lastp - Data.headp) >> 1); else return this; } else --Data.lastp; return this; } Stack_v<Map_Type>(void) { /* NULL / } Stack_v<Map_Type>(unsigned int data_size, Map_Type map_data) { while (data_size) { push(&map_data); --data_size; } } Stack_v<Map_Type>(Stack_v<Map_Type>& map_data) { Vector_Data datap = (Vector_Data)map_data.data(); for (unsigned int i = 0, k = map_data.size(); i != k; ++i) push(datap -> headp + i); } Stack_v<Map_Type>& operator=(Stack_v<Map_Type>& copy_data) { if (copy_data.empty()) clear(); else { Vector_Data datap = (Vector_Data)copy_data.data(); for (unsigned int i = 0, k = copy_data.size(); i != k; ++i) push(datap -> headp + i); } return this; } bool operator==(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return false; else if (empty() && cmp_data.empty()) return true; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap ->headp + i)) return false; } return true; } bool operator!=(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return true; else if (empty() && cmp_data.empty()) return false; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap -> headp + i)) return true; } return false; } Stack_v<Map_Type>& clear(void) { delete[] Data.headp; Data.headp = 0; Data.lastp = 0; Data.endp = 0; return this; } ~Stack_v<Map_Type>(void) { delete[] Data.headp; } }; / Stack _ Vector */ int main(void) { return 0; } (22029-xys)	-	7 MiB		63 Bytes	2024-1-7 10:45:56
AC	赵沛喆	1ms	256 KiB		91 Bytes	2022-8-2 16:00:12
AC	樊竣熠 (lft1114)	1ms	384 KiB		147 Bytes	2022-8-8 14:56:15
AC	赵泳鑫 (zhaoyongxin)	1ms	384 KiB		168 Bytes	2022-7-12 11:49:54
AC	刘老师 (图书管理员)	1ms	384 KiB		115 Bytes	2022-4-29 23:53:26
AC	huyinuo	1ms	384 KiB		172 Bytes	2022-6-12 16:11:44
AC	草\|\|草 (陈星佑)	1ms	384 KiB		292 Bytes	2022-6-12 11:15:31
AC	周琪渃	1ms	384 KiB		177 Bytes	2023-2-2 15:49:22
AC	草\|\|草 (陈星佑)	1ms	384 KiB		292 Bytes	2022-6-10 18:22:50
AC	赵泳鑫 (zhaoyongxin)	1ms	384 KiB		168 Bytes	2022-7-17 19:20:39
AC	金沙-文豪 (wenhao)	1ms	6.9 MiB	C++98(O2)	215 Bytes	2024-8-16 16:40:04
AC	姚宏逸	1ms	384 KiB		155 Bytes	2022-5-1 20:23:06
AC	杜俊宏	1ms	384 KiB		250 Bytes	2022-6-16 18:39:14
AC	孙烽轶 (sfy)	1ms	6.8 MiB	C++98	124 Bytes	2024-8-11 20:34:49
AC	colin1112 (墙凌可)	1ms	384 KiB		101 Bytes	2023-3-23 17:14:19
AC	11111	1ms	384 KiB		100 Bytes	2022-6-5 13:19:49
AC	Error404sans (焦阳浩云)	1ms	7.2 MiB		147 Bytes	2023-7-16 19:59:06
AC	疯神芭芭脱丝 (李卓修)	1ms	384 KiB		160 Bytes	2022-6-6 6:52:38
AC	爱琴海校区-刁钲洋 (刁钲洋)	1ms	384 KiB		132 Bytes	2022-9-19 20:24:18
AC	草\|\|草 (陈星佑)	1ms	384 KiB		292 Bytes	2022-6-10 18:23:03
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	1ms	384 KiB		172 Bytes	2023-1-8 11:59:43
AC	TBB (杜昊燃)	1ms	384 KiB		154 Bytes	2023-2-14 16:31:35
AC	纪承熙 (jcx001)	1ms	6.7 MiB		182 Bytes	2023-7-17 10:40:13
AC	周米骐 (zsb)	1ms	7 MiB		153 Bytes	2023-7-18 11:57:02
AC	xiangsiyu	1ms	384 KiB		161 Bytes	2022-6-26 9:34:00
AC	文硕 (文硕1)	1ms	384 KiB		168 Bytes	2022-7-12 14:01:22
AC	李树崑 (lishukun)	1ms	384 KiB		206 Bytes	2022-8-21 11:39:14
AC	王韵淮	1ms	384 KiB		110 Bytes	2022-5-31 21:50:53
AC	1396013295	1ms	384 KiB		138 Bytes	2022-5-8 9:11:06
AC	李山水	1ms	384 KiB		185 Bytes	2022-5-25 19:54:53
AC	11451254188 (22029-mjh)	1ms	384 KiB		158 Bytes	2022-12-18 10:47:50
AC	(张洛诚)	1ms	384 KiB		135 Bytes	2023-4-29 7:59:36
AC	关博源	1ms	384 KiB		176 Bytes	2023-3-8 18:29:27
AC	草\|\|草 (陈星佑)	1ms	384 KiB		292 Bytes	2022-6-10 18:22:50
AC	周琪渃	1ms	376 KiB		169 Bytes	2023-2-2 15:48:58
AC	陈骏逸 (chenjunyi)	1ms	7.1 MiB		176 Bytes	2023-7-9 9:23:48
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	384 KiB		176 Bytes	2022-6-25 9:53:38
AC	11451254188 (22029-mjh)	1ms	384 KiB		169 Bytes	2023-2-9 21:01:44
AC	我推的乱破 (贺俊楠)	1ms	384 KiB		175 Bytes	2023-3-26 15:07:04
AC	草\|\|草 (陈星佑)	1ms	384 KiB		292 Bytes	2022-6-12 11:15:16
AC	草\|\|草 (陈星佑)	1ms	384 KiB		292 Bytes	2022-6-12 11:15:10
AC	Randy Marsh (杨子腾)	1ms	384 KiB		173 Bytes	2022-5-15 10:03:37
AC	黄梓桐 (HuangZiTong)	1ms	392 KiB		155 Bytes	2022-6-19 21:32:22
AC	草\|\|草 (陈星佑)	1ms	384 KiB		292 Bytes	2022-6-10 18:22:48
AC	ywh	1ms	384 KiB		136 Bytes	2022-7-11 18:27:58
AC	草\|\|草 (陈星佑)	1ms	384 KiB		292 Bytes	2022-6-10 18:23:03
AC	姚宏逸	1ms	384 KiB		155 Bytes	2022-5-1 20:23:06
AC	wuqilin	1ms	384 KiB		160 Bytes	2023-2-1 18:53:23
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	1ms	6.7 MiB		160 Bytes	2023-7-7 20:26:24
AC	林小博	2ms	384 KiB		165 Bytes	2022-10-26 18:34:30
AC	周琪渃	2ms	412 KiB		175 Bytes	2023-2-2 15:48:42
AC	邹曜丞 (13983097018)	2ms	6.9 MiB		155 Bytes	2023-7-23 18:02:04
AC	majinhui	7ms	2.8 MiB	Python 2	60 Bytes	2022-7-11 21:36:09
AC	刘老师 (图书管理员)	7ms	2.8 MiB	Python 2	23 Bytes	2022-4-29 23:54:47
AC	刘老师 (图书管理员)	7ms	2.8 MiB	Python 2	23 Bytes	2022-4-29 23:54:38
AC	新壹街校区-冉睦阳 (冉睦阳)	7ms	532 KiB	C++98	155 Bytes	2024-11-8 20:34:40
AC	My name is Man (钟卓劭)	7ms	532 KiB		148 Bytes	2024-3-23 21:45:08
AC	xujialin	7ms	2.9 MiB	Python 2	48 Bytes	2022-6-1 21:43:58
AC	王晨志 (wangchenzhi)	7ms	2.8 MiB	Python 2	58 Bytes	2022-7-17 3:48:53
AC	A小涂	7ms	320 KiB		178 Bytes	2024-3-9 8:47:30
AC	刘老师 (图书管理员)	7ms	2.9 MiB	Python 2	50 Bytes	2022-4-29 23:56:56
AC	叶哲宇 (yzy)	7ms	560 KiB		175 Bytes	2024-3-19 22:38:24
AC	刘老师 (图书管理员)	8ms	2.9 MiB	Python 2	23 Bytes	2022-4-29 23:55:01
AC	张瑞博	10ms	9.3 MiB	Python 3	50 Bytes	2024-5-31 20:26:53
AC	猫不理包子	19ms	8.8 MiB	Python 3	48 Bytes	2023-7-30 11:26:30