栈的练习1

状态	递交者	时间	内存	语言	代码	递交时间
AC	梦之泪伤	112ms	496 KiB		320 Bytes	2022-8-27 11:22:41
AC	colin1112 (墙凌可)	112ms	588 KiB		550 Bytes	2023-4-20 11:53:12
AC	新壹街校区-杨轩懿 (杨轩懿1)	112ms	6.5 MiB		350 Bytes	2023-11-19 12:37:16
AC	时代一校 - 冯隆浩 (冯隆浩)	112ms	576 KiB		354 Bytes	2022-7-24 11:11:18
AC	Randy Marsh (杨子腾)	112ms	528 KiB		360 Bytes	2022-6-19 11:14:53
AC	汤杰尧 (05c05-tjy1)	113ms	564 KiB		325 Bytes	2023-2-16 17:56:17
AC	张颢瀛	113ms	540 KiB		326 Bytes	2022-7-17 14:27:49
AC	HIMMZXC	113ms	560 KiB		384 Bytes	2022-2-19 14:10:49
AC	He Yiqi (和平精英)	114ms	512 KiB		307 Bytes	2022-8-27 13:38:34
AC	MacrozClick_ (蒋淞霖)	114ms	512 KiB		346 Bytes	2022-6-19 11:21:11
AC	李某人	114ms	512 KiB		355 Bytes	2022-6-19 11:20:06
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	114ms	7 MiB	C++98	302 Bytes	2024-5-25 13:57:36
AC	1396013295	114ms	592 KiB		321 Bytes	2022-1-23 19:29:28
AC	tsc_ (杨悦堃)	114ms	7 MiB		368 Bytes	2023-11-12 10:39:17
AC	梁金同 (liangjintong)	115ms	536 KiB		420 Bytes	2023-2-26 14:26:47
AC	经常消失 (小萝卜)	115ms	512 KiB		630 Bytes	2022-8-27 14:25:53
AC	wangruibo20xh	115ms	576 KiB		408 Bytes	2022-2-12 9:50:54
AC	黄梓桐 (HuangZiTong)	116ms	508 KiB		345 Bytes	2023-2-26 14:05:28
AC	林小博	116ms	528 KiB		351 Bytes	2023-2-2 15:47:08
AC	疯神芭芭脱丝 (李卓修)	116ms	548 KiB		338 Bytes	2022-3-27 17:11:17
AC	你爹 (郭铠嘉)	116ms	512 KiB		354 Bytes	2022-6-19 11:17:06
AC	时代二校+马嘉宸 (majiachen)	117ms	7.6 MiB		657 Bytes	2023-11-18 19:27:13
AC	龚信丞	117ms	6.9 MiB		473 Bytes	2023-6-30 19:13:36
AC	Tender. (05c05-zhou)	117ms	552 KiB		325 Bytes	2022-11-25 10:44:23
AC	千千万万	118ms	7 MiB		447 Bytes	2023-12-24 17:17:28
AC	zhm123	118ms	6.9 MiB		490 Bytes	2023-6-30 19:09:50
AC	张月恒	118ms	900 KiB	C++11(O2)	457 Bytes	2024-11-10 18:04:13
AC	luoluonuoya	118ms	524 KiB		428 Bytes	2022-4-17 17:46:51
AC	HIMMZXC	119ms	512 KiB		384 Bytes	2022-2-19 14:11:10
AC	LUKHE (LukeHu)	119ms	596 KiB		333 Bytes	2022-4-16 16:35:26
AC	Jose (反恐皮蛋)	120ms	6.5 MiB		375 Bytes	2023-11-19 11:51:16
AC	刘政君 (lzj)	121ms	516 KiB		330 Bytes	2022-9-16 20:12:12
AC	Jack	121ms	6.9 MiB		317 Bytes	2023-10-22 14:41:21
AC	王祎辰 (wangyichen)	122ms	6.9 MiB		529 Bytes	2023-6-30 19:14:17
AC	爱琴海校区-黄辰浩 (huangchenhao)	122ms	6.9 MiB		419 Bytes	2023-6-30 14:03:15
AC	xuniaoyin (徐袅音)	122ms	6.9 MiB		294 Bytes	2023-8-10 15:18:14
AC	zyl	123ms	788 KiB		696 Bytes	2024-4-11 20:21:42
AC	22029-lyh	123ms	6.9 MiB		345 Bytes	2023-8-7 17:09:45
AC	陈诺	123ms	872 KiB		412 Bytes	2024-3-17 15:15:45
AC	RanHao	123ms	6.7 MiB		325 Bytes	2023-9-12 17:00:06
AC	贾鑫豪 (Mr Sam)	125ms	6.7 MiB		445 Bytes	2023-9-2 19:09:27
AC	三差学生 (尘埃蓝莓)	125ms	6.9 MiB		409 Bytes	2023-7-7 10:26:25
AC	希蒙 (zhengxingya)	126ms	6.7 MiB		413 Bytes	2023-8-21 17:36:57
AC	坤坤荔枝小黑子 (zhonghaotian22006)	126ms	516 KiB		305 Bytes	2022-11-25 10:36:12
AC	叶雨昊 (yeyuhao22006)	126ms	528 KiB		343 Bytes	2022-12-11 17:30:50
AC	zhm123	126ms	6.8 MiB		490 Bytes	2023-6-25 15:38:39
AC	爱琴海校区-刁钲洋 (刁钲洋)	126ms	6.9 MiB		455 Bytes	2023-6-30 14:03:02
AC	无尽的想象 (谭仕高)	126ms	6.8 MiB		335 Bytes	2023-6-23 12:40:19
AC	cj66	127ms	868 KiB	C++11(O2)	468 Bytes	2024-9-26 11:05:59
AC	huanglu	127ms	1020 KiB		550 Bytes	2024-4-3 18:48:25
AC	22029-lsl	128ms	6.9 MiB		322 Bytes	2023-6-30 11:15:40
AC	zcx	128ms	6.8 MiB		359 Bytes	2023-6-26 15:51:52
AC	唐一航	129ms	1.1 MiB	C++11	302 Bytes	2024-9-13 15:48:25
AC	ttt123	129ms	6.9 MiB		332 Bytes	2023-6-30 10:54:53
AC	偽艺術家 (chenyanchi22006)	130ms	568 KiB		419 Bytes	2022-12-11 17:31:25
AC	周琪渃	131ms	6.8 MiB		426 Bytes	2023-6-30 22:55:14
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	131ms	6.7 MiB		321 Bytes	2023-8-27 16:46:59
AC	任远宁 (renyuanning)	131ms	6.7 MiB		309 Bytes	2023-9-28 19:01:30
AC	wangjun	132ms	7 MiB		400 Bytes	2023-12-23 14:13:49
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)	132ms	6.9 MiB		347 Bytes	2023-6-30 11:14:15
AC	张景豪	134ms	6.9 MiB		494 Bytes	2023-6-30 19:12:09
AC	坤坤荔枝小黑子 (zhonghaotian22006)	135ms	568 KiB		320 Bytes	2022-12-11 16:54:51
AC	时代2校+涂彦迪 (tuyandi)	137ms	6.9 MiB		419 Bytes	2023-11-25 16:51:39
AC	郑岐蔚	137ms	520 KiB		499 Bytes	2023-1-11 11:48:25
AC	zhuqiwei22006	139ms	524 KiB		288 Bytes	2022-12-11 17:29:54
AC	22029-zjs	143ms	6.9 MiB		315 Bytes	2023-6-30 11:20:32
AC	陈风亦 (chenfengyi)	146ms	540 KiB		379 Bytes	2023-1-18 17:08:16
AC	¿¿¿??? (李睿瞳)	146ms	7.3 MiB		349 Bytes	2024-1-22 15:43:22
AC	牟淳雅	147ms	7.3 MiB		322 Bytes	2023-12-31 10:42:00
AC	周琳竣1	149ms	7 MiB		462 Bytes	2023-12-24 17:11:42
AC	可爱的小花狗	152ms	7 MiB		481 Bytes	2023-11-25 16:55:09
AC	时代二校+王吕棪 (wanglvyan)	154ms	7 MiB		451 Bytes	2023-11-25 16:39:46
AC	zyz (曾韵竹)	155ms	7 MiB		426 Bytes	2023-12-24 17:10:25
AC	南坪校区—喻子峰 (yuzifeng23002)	159ms	7 MiB		322 Bytes	2023-11-25 16:43:54
AC	时代2校-程俊燃 (chengjunran)	162ms	6.8 MiB		425 Bytes	2023-11-25 16:50:57
AC	吃小孩的viv_	173ms	6.9 MiB		340 Bytes	2023-12-2 0:07:15
AC	时代二校-陈天成 (鸭缩毛巾)	177ms	7.1 MiB		469 Bytes	2023-11-25 16:40:09
AC	中岛敦 (黄麒瑞)	181ms	7.2 MiB		349 Bytes	2023-11-26 8:37:09
AC	弹射起飞 ? 冲 ! (吴周周)	182ms	7 MiB		494 Bytes	2023-11-25 16:42:23
AC	时代二校-焦雨齐 (Angel)	187ms	7 MiB		491 Bytes	2023-11-25 16:44:36
AC	周靖淞 (zhoujingsong)	215ms	7 MiB		456 Bytes	2023-12-24 16:58:56
AC	梨冻亿 (wiueh)	314ms	4.7 MiB	Python 3	195 Bytes	2022-1-23 20:36:23
AC	Jose (反恐皮蛋)	550ms	956 KiB		347 Bytes	2024-3-30 11:33:43
AC	王义苇 (wangyiwei)	560ms	832 KiB		348 Bytes	2024-4-6 9:26:18
AC	新壹街校区-冉睦阳 (冉睦阳)	572ms	1.1 MiB		462 Bytes	2024-4-14 9:26:50
AC	AI创客	581ms	840 KiB		319 Bytes	2024-3-2 10:06:53
AC	zzzrrrxxx	609ms	1 MiB		244 Bytes	2024-3-17 18:56:22
AC	ReFly (NKZKY)	616ms	964 KiB		432 Bytes	2024-2-1 17:17:46
AC	新壹街校区-陈琬舒 (空空大师)	616ms	832 KiB		319 Bytes	2024-4-14 10:52:27
AC	新壹街—熊轩杭 (xiongxuanhang)	617ms	840 KiB		318 Bytes	2024-4-13 16:45:14
AC	pig (hezhihui)	619ms	904 KiB		266 Bytes	2024-3-21 16:29:39
AC	Accepted (周芷乐)	647ms	884 KiB	C++14	340 Bytes	2024-10-5 11:22:04
AC	这是非常▦▦▦的 (段秉辰)	700ms	856 KiB	C++17	345 Bytes	2024-11-23 16:41:05