我会数数啦4！！

状态	递交者	时间	内存	语言	代码	递交时间
AC	chenruoxi	-	6.9 MiB		145 Bytes	2023-11-19 16:56:23
AC	wangjun	2ms	6.5 MiB		132 Bytes	2023-11-19 11:21:50
AC	1396013295	2ms	384 KiB		175 Bytes	2022-1-22 18:13:35
AC	赵沛喆	2ms	256 KiB		177 Bytes	2022-4-1 22:57:05
AC	LUKHE (LukeHu)	3ms	256 KiB		214 Bytes	2022-1-25 18:46:58
AC	amr (董子溪)	3ms	7.1 MiB		173 Bytes	2024-1-17 18:51:38
AC	胡宸华 (huchenhua)	3ms	256 KiB		161 Bytes	2022-11-12 23:03:51
AC	Tender. (05c05-zhou)	5ms	420 KiB		235 Bytes	2022-12-1 19:56:55
AC	杜俊宏	5ms	420 KiB		205 Bytes	2022-4-27 18:49:19
AC	maomao	5ms	384 KiB		215 Bytes	2022-5-25 20:11:19
AC	xiangsiyu	5ms	392 KiB		161 Bytes	2022-7-11 10:09:19
AC	爱情海校区—沙天一 (沙天一)	5ms	384 KiB		155 Bytes	2023-2-25 11:13:14
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)	5ms	384 KiB		170 Bytes	2023-5-16 19:30:53
AC	谢延灏 (xeiyanhao---a handsome boy)	5ms	424 KiB		156 Bytes	2022-4-8 18:39:27
AC	ymh	5ms	384 KiB		132 Bytes	2022-4-28 17:32:39
AC	huyinuo	5ms	384 KiB		152 Bytes	2022-3-3 18:30:57
AC	疯神芭芭脱丝 (李卓修)	5ms	392 KiB		201 Bytes	2022-4-5 16:11:27
AC	shenyushun2	5ms	392 KiB		129 Bytes	2022-12-2 18:37:55
AC	偽艺術家 (chenyanchi22006)	5ms	384 KiB		167 Bytes	2022-6-23 22:51:54
AC	时代一校 - 冯隆浩 (冯隆浩)	5ms	384 KiB		142 Bytes	2022-9-18 17:33:39
AC	呵 (mohaoran)	5ms	384 KiB		145 Bytes	2022-6-17 22:09:25
AC	蒲梓勋 (puzixun)	5ms	384 KiB		241 Bytes	2022-6-18 21:15:01
AC	soha (武夷岩)	5ms	384 KiB		488 Bytes	2022-9-17 17:03:29
AC	坤坤荔枝小黑子 (zhonghaotian22006)	5ms	384 KiB		225 Bytes	2022-7-1 16:04:19
AC	黄俊皓	5ms	464 KiB		215 Bytes	2022-5-10 18:34:06
AC	dmh (丁墨涵)	5ms	384 KiB		134 Bytes	2022-1-24 16:19:46
AC	凌肯 (lingken22006)	5ms	424 KiB		235 Bytes	2022-7-31 21:58:40
AC	彭崇鑫	5ms	392 KiB		138 Bytes	2022-9-18 20:29:35
AC	肖添宇	5ms	384 KiB		269 Bytes	2022-2-20 14:47:00
AC	22016-ggs	5ms	392 KiB		163 Bytes	2022-8-16 15:14:27
AC	赵泳鑫 (zhaoyongxin)	5ms	432 KiB		214 Bytes	2022-7-12 11:24:04
AC	程舒然	5ms	6.6 MiB	C++11	138 Bytes	2024-7-17 11:37:06
AC	hyh	5ms	384 KiB		150 Bytes	2023-2-25 11:23:33
AC	luoluonuoya	5ms	384 KiB		226 Bytes	2022-1-26 16:57:35
AC	ycy	5ms	408 KiB		269 Bytes	2023-4-30 15:20:24
AC	zhangyh (张育菡)	5ms	440 KiB		175 Bytes	2022-6-10 22:31:53
AC	陈年保宁醋 (dengboren)	5ms	428 KiB		144 Bytes	2022-3-26 10:13:46
AC	李嘉瑞	5ms	384 KiB		148 Bytes	2022-5-7 21:28:11
AC	任瑞的学生 (jiangyadong)	5ms	408 KiB		173 Bytes	2022-6-19 13:08:39
AC	ycy	5ms	384 KiB		159 Bytes	2022-6-16 16:59:31
AC	soha (武夷岩)	5ms	384 KiB		488 Bytes	2022-9-17 17:04:53
AC	无尽的想象 (谭仕高)	5ms	416 KiB		135 Bytes	2022-7-28 16:25:57
AC	何欣洋	5ms	384 KiB		184 Bytes	2023-2-25 11:29:31
AC	chaikexu	5ms	384 KiB		132 Bytes	2022-6-16 20:37:44
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	5ms	384 KiB		163 Bytes	2022-9-3 18:41:06
AC	爱琴海校区jzn (jzn)	5ms	392 KiB		236 Bytes	2023-2-25 11:14:54
AC	王晨志 (wangchenzhi)	5ms	384 KiB		168 Bytes	2022-5-29 15:47:19
AC	汪致卉 (wangzh)	5ms	432 KiB		171 Bytes	2022-4-17 0:18:45
AC	_PXY_	5ms	400 KiB		167 Bytes	2022-1-27 11:54:07
AC	谢博文	5ms	448 KiB		204 Bytes	2022-2-19 9:23:49
AC	姚宏逸	5ms	384 KiB		160 Bytes	2022-5-29 11:41:17
AC	zlx (xiao)	5ms	384 KiB		172 Bytes	2022-5-25 20:06:32
AC	soha (武夷岩)	5ms	384 KiB		488 Bytes	2022-9-17 17:04:56
AC	郑岐蔚	5ms	384 KiB		135 Bytes	2022-10-29 19:00:16
AC	黄立信	5ms	6.9 MiB		157 Bytes	2023-10-15 13:32:33
AC	张峻尘 (zjc)	5ms	392 KiB		135 Bytes	2022-3-12 14:45:56
AC	陈于硕(我™的) (chenyu)	5ms	392 KiB		168 Bytes	2023-2-25 11:11:38
AC	陈忝锐	5ms	384 KiB		171 Bytes	2022-2-10 18:00:20
AC	https://www.minecraft.net/zh-hans (王振西)	5ms	384 KiB		143 Bytes	2023-2-1 20:24:56
AC	CK (李弘毅)	5ms	384 KiB		472 Bytes	2022-9-17 17:01:34
AC	吴俊成 (wujuncheng)	5ms	436 KiB		177 Bytes	2022-7-10 11:48:54
AC	傅博涛	5ms	384 KiB		120 Bytes	2022-2-27 13:27:58
AC	况奕辛 (KYX_yyds)	5ms	512 KiB		212 Bytes	2022-3-8 21:03:58
AC	SYC0226	5ms	432 KiB		151 Bytes	2022-3-20 13:08:45
AC	刘政君 (lzj)	5ms	440 KiB		219 Bytes	2022-7-29 15:24:19
AC	lafuzbc	5ms	512 KiB		134 Bytes	2022-8-27 13:49:32
AC	中岛敦 (黄麒瑞)	5ms	6.8 MiB		200 Bytes	2023-10-3 11:19:39
AC	yixingyou	5ms	384 KiB		127 Bytes	2022-9-17 17:04:47
AC	王韵淮	5ms	384 KiB		152 Bytes	2022-5-18 20:23:38
AC	火爆肥肠（杨弘毅） (火爆肥肠)	5ms	400 KiB		178 Bytes	2022-2-24 21:50:53
AC	时代1校-杨宇轩 (杨宇轩)	5ms	6.9 MiB		134 Bytes	2023-8-21 13:31:56
AC	tad (OP AI)	5ms	6.7 MiB	C++11	148 Bytes	2024-6-29 14:58:15
AC	Yuan (Zongzi1)	5ms	6.6 MiB	C++17(O2)	146 Bytes	2024-7-18 9:20:53
AC	ywh	5ms	384 KiB		185 Bytes	2022-1-24 19:34:27
AC	zxccv	5ms	440 KiB		185 Bytes	2022-4-14 19:52:44
AC	郑之策	5ms	384 KiB		145 Bytes	2022-2-10 11:05:40
AC	Randy Marsh (杨子腾)	5ms	384 KiB		159 Bytes	2022-1-23 11:35:31
AC	秦圣恩	5ms	6.9 MiB	C++98	160 Bytes	2024-5-24 17:33:51
AC	tsc_ (杨悦堃)	5ms	444 KiB		135 Bytes	2023-4-9 12:11:15
AC	qwerty	5ms	392 KiB		194 Bytes	2022-3-12 11:20:05
AC	唐臣谦 (tangchenqian1)	5ms	436 KiB		132 Bytes	2022-11-22 22:17:41
AC	李山水	5ms	384 KiB		302 Bytes	2022-4-4 15:26:16
AC	刘泽21	5ms	6.8 MiB		140 Bytes	2023-9-29 15:22:04
AC	胡瀚文	5ms	392 KiB		136 Bytes	2022-7-18 11:16:08
AC	zhm123	5ms	384 KiB		145 Bytes	2023-3-30 15:11:58
AC	Erin	5ms	7.2 MiB	C++98	162 Bytes	2024-5-5 9:54:53
AC	德克萨斯做的到吗 (liyangbao)	5ms	444 KiB		189 Bytes	2022-11-19 22:35:58
AC	源著校区-宋昊成 (马冬梅)	5ms	448 KiB		164 Bytes	2023-2-25 18:24:16
AC	Jack	5ms	444 KiB		171 Bytes	2022-8-17 19:14:57
AC	杜启苇 (duqiwei)	5ms	444 KiB		156 Bytes	2022-7-23 14:15:25
AC	时代二校-陈天成 (鸭缩毛巾)	5ms	420 KiB		155 Bytes	2023-4-8 15:55:02
AC	yyds (杨骐嘉)	5ms	6.8 MiB		166 Bytes	2023-10-27 18:16:24
AC	张梓辰 (DiaoDesi屌德斯)	5ms	436 KiB		161 Bytes	2022-9-14 19:45:42
AC	xiangsiyu	5ms	384 KiB		161 Bytes	2022-7-11 10:20:11
AC	wzzjnb2012	5ms	512 KiB		335 Bytes	2022-10-3 7:38:17
AC	文硕 (文硕1)	5ms	384 KiB		214 Bytes	2022-7-12 11:37:10
AC	(张洛诚)	5ms	444 KiB		169 Bytes	2023-4-21 22:01:08
AC	quzhibo	5ms	384 KiB		155 Bytes	2022-9-17 17:08:36
AC	你爹 (郭铠嘉)	5ms	384 KiB		168 Bytes	2022-2-9 18:42:08
AC	杨睎尧	5ms	404 KiB		141 Bytes	2022-4-5 10:37:20