Hello World

状态	递交者	时间	内存	语言	代码	递交时间
AC	嘿嘿	3ms	6.7 MiB		84 Bytes	2023-11-18 14:40:50
AC	郝婉彤	3ms	6.9 MiB		100 Bytes	2023-11-18 17:18:39
AC	天神	3ms	6.6 MiB		99 Bytes	2023-11-19 15:06:24
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)	3ms	6.9 MiB		72 Bytes	2023-11-12 8:57:36
AC	监王 (XMW22024YJZ)	3ms	6.9 MiB		103 Bytes	2023-11-19 15:03:41
AC	RanHao	3ms	6.9 MiB		191 Bytes	2023-11-11 10:04:34
AC	孩纸	3ms	6.5 MiB		99 Bytes	2023-11-19 14:57:58
AC	马安馨	4ms	7 MiB		95 Bytes	2024-1-7 13:55:36
AC	liangyuntian	4ms	7 MiB		86 Bytes	2023-11-25 17:16:34
AC	王斯仪	4ms	7 MiB		94 Bytes	2023-12-9 18:09:27
AC	南坪-程墨竹 (TSK)	4ms	7.2 MiB		101 Bytes	2023-12-24 15:10:59
AC	代老师01号	4ms	6.7 MiB		120 Bytes	2023-11-24 19:23:59
AC	胡颖彤	4ms	6.9 MiB		99 Bytes	2023-12-31 15:06:37
AC	zhuyumin23017	4ms	7.1 MiB		95 Bytes	2023-12-23 20:41:10
AC	高彬月	4ms	7 MiB		92 Bytes	2023-12-3 13:58:40
AC	沈煜恒 (一位老六)	4ms	6.9 MiB		104 Bytes	2023-12-14 18:09:33
AC	小鲨鱼	4ms	6.9 MiB		108 Bytes	2023-11-24 19:26:24
AC	段秉辰	4ms	7 MiB		119 Bytes	2024-1-18 15:04:32
AC	正常的雪糕	4ms	7 MiB		100 Bytes	2023-12-29 22:18:17
AC	老六在此	4ms	7.1 MiB		102 Bytes	2024-1-12 17:03:54
AC	只因 (yubohang23002)	4ms	7.2 MiB		98 Bytes	2023-12-15 21:57:35
AC	梁程翔	4ms	7 MiB		114 Bytes	2024-1-18 15:04:37
AC	范子煜	4ms	7.1 MiB		95 Bytes	2024-1-17 16:01:15
AC	新壹街.曾祥睿 (zxr)	4ms	6.9 MiB		105 Bytes	2023-11-23 20:44:43
AC	杜雨泽	4ms	7 MiB		112 Bytes	2024-1-18 15:04:40
AC	小翔的粉丝	4ms	6.8 MiB		94 Bytes	2023-12-10 17:53:24
AC	OJ00001 (陈帅)	4ms	7.1 MiB		116 Bytes	2024-1-18 15:05:53
AC	Guest	4ms	7 MiB		83 Bytes	2024-1-10 11:40:38
AC	hyh	4ms	7 MiB		91 Bytes	2024-1-6 22:14:56
AC	南坪-代一升 (代一升)	4ms	6.9 MiB		93 Bytes	2023-11-11 10:21:39
AC	新壹街-张博涵 (张博涵)	4ms	7 MiB		103 Bytes	2023-12-30 9:28:52
AC	wangzihang3	4ms	6.9 MiB		104 Bytes	2024-1-6 14:27:21
AC	一朵桃桃 (雪球)	4ms	7 MiB		81 Bytes	2023-12-23 16:04:10
AC	陈俊彤	4ms	7 MiB		100 Bytes	2023-12-2 18:32:24
AC	新壹街校区--税崇峻 (税崇峻)	4ms	6.9 MiB		225 Bytes	2023-12-12 22:01:26
AC	龚铭俊 (哈哈哈)	4ms	6.9 MiB		97 Bytes	2023-11-26 10:28:44
AC	jdy	4ms	7.2 MiB		132 Bytes	2023-11-30 18:54:14
AC	许祖睿刷题号C++	4ms	532 KiB	C++17	91 Bytes	2025-1-17 16:00:09
AC	胡唯轶	4ms	6.9 MiB		96 Bytes	2023-12-8 17:52:30
AC	Guest	4ms	7 MiB		88 Bytes	2023-12-17 17:01:17
AC	彭子彦	4ms	6.9 MiB		107 Bytes	2023-12-2 13:47:56
AC	雷霆万钧 (袁崇栖)	4ms	6.8 MiB		93 Bytes	2023-11-25 11:55:06
AC	安一谦	4ms	6.7 MiB		93 Bytes	2023-11-24 19:24:16
AC	什蒂尔布 (吴东航)	4ms	6.9 MiB		94 Bytes	2023-11-27 17:31:48
AC	雷诺伊尔 (崔金鹏)	4ms	7.3 MiB		79 Bytes	2024-1-2 21:08:08
AC	龚铭俊 (哈哈哈)	4ms	7.1 MiB		243 Bytes	2023-11-26 10:35:09
AC	6 (chenjiacheng)	4ms	7 MiB		102 Bytes	2023-12-24 9:03:20
AC	超级管理员 (root)	4ms	7 MiB		95 Bytes	2022-6-3 11:41:36
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	4ms	7.1 MiB		93 Bytes	2024-1-11 21:09:38
AC	万叶	4ms	7 MiB		97 Bytes	2023-12-16 11:14:02
AC	胡颖彤	4ms	7 MiB		91 Bytes	2024-1-7 13:59:47
AC	葛广言	4ms	6.9 MiB		109 Bytes	2023-12-1 12:53:49
AC	黄铂涵	4ms	7 MiB		98 Bytes	2024-1-14 9:10:03
AC	whj	4ms	7 MiB		93 Bytes	2023-12-31 9:47:18
AC	XMW22024LXN	4ms	6.5 MiB		78 Bytes	2023-11-19 14:57:10
AC	Guest	4ms	6.9 MiB		105 Bytes	2023-11-28 20:00:47
AC	郑隽霖	4ms	7.2 MiB		94 Bytes	2024-1-15 21:02:46
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	4ms	7.1 MiB		93 Bytes	2024-1-11 21:09:31
AC	e^iπ+1=0	4ms	7.2 MiB		96 Bytes	2024-1-17 16:27:16
AC	刘老师 (图书管理员)	4ms	7 MiB		145 Bytes	2023-12-31 16:37:03
AC	孙嘉蔚	4ms	7 MiB		105 Bytes	2023-11-18 17:27:56
AC	xsm熊俞霖	4ms	532 KiB	C++98(O2)	104 Bytes	2025-2-11 23:41:41
AC	新壹街—熊轩杭 (xiongxuanhang)	4ms	7 MiB		104 Bytes	2023-12-9 18:23:26
AC	施博元	4ms	532 KiB		92 Bytes	2024-3-29 17:25:46
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	5ms	7.1 MiB		93 Bytes	2024-1-6 11:19:07
AC	ReFly (NKZKY)	5ms	7.2 MiB		92 Bytes	2023-11-26 9:06:19
AC	6 (龙浩恩)	5ms	6.9 MiB		144 Bytes	2023-10-21 10:10:44
AC	蒲昊	5ms	532 KiB	C++17	95 Bytes	2025-1-11 17:26:31
AC	10255	5ms	6.9 MiB		177 Bytes	2023-12-23 17:01:57
AC	法老	5ms	532 KiB		99 Bytes	2024-4-13 16:59:41
AC	bvvd	5ms	532 KiB		102 Bytes	2024-4-10 15:11:38
AC	郭修然	5ms	532 KiB	C++17	91 Bytes	2025-1-10 20:51:43
AC	WYZ	5ms	532 KiB	C++98(O2)	101 Bytes	2025-3-4 19:59:27
AC	罗浩轩	5ms	532 KiB	C++98(O2)	90 Bytes	2025-3-9 11:02:53
AC	邹智吉	5ms	532 KiB		92 Bytes	2024-2-25 17:12:01
AC	xsm谢吉童	5ms	320 KiB	C++98(O2)	94 Bytes	2025-1-15 20:28:35
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	6ms	532 KiB		93 Bytes	2024-3-1 22:08:36
AC	xsm戎乙宁	6ms	532 KiB	C++98(O2)	86 Bytes	2025-2-16 19:43:58
AC	孙昊轩	6ms	532 KiB	C++98(O2)	92 Bytes	2025-3-9 11:01:05
AC	xsm李沐一	6ms	532 KiB	C++98(O2)	97 Bytes	2025-2-21 16:38:12
AC	邹智吉	6ms	536 KiB		92 Bytes	2024-2-25 17:12:10
AC	xsm张寓杰	6ms	532 KiB	C++98(O2)	100 Bytes	2025-1-13 16:47:56
AC	xsm刘思锐	6ms	532 KiB	C++98(O2)	112 Bytes	2025-2-15 15:54:40
AC	唐翰	6ms	7 MiB		99 Bytes	2024-1-7 13:32:43
AC	xsm周子甯	6ms	532 KiB	C++98(O2)	92 Bytes	2025-2-21 16:17:58
AC	xsm胡明扬	6ms	532 KiB	C++98(O2)	103 Bytes	2025-3-30 11:56:44
AC	fsnowxjdf雪默fvmv23335(刘宸睿) (刘宸睿)	6ms	532 KiB		102 Bytes	2024-2-25 15:46:13
AC	ChongqingGroup (Donce)	6ms	6.9 MiB		87 Bytes	2023-12-3 13:56:14
AC	陈锦成23025	6ms	284 KiB		97 Bytes	2024-4-4 15:10:25
AC	曾际铭	6ms	532 KiB		93 Bytes	2024-3-24 19:16:09
AC	田宝贤	6ms	532 KiB		104 Bytes	2024-2-25 15:39:46
AC	gyc	7ms	424 KiB		91 Bytes	2024-3-2 16:56:29
AC	龚泉	7ms	532 KiB		92 Bytes	2024-2-25 17:16:03
AC	向浚郗	7ms	532 KiB		95 Bytes	2024-3-29 19:59:03
AC	zy8.27	7ms	532 KiB		111 Bytes	2024-3-30 14:19:12
AC	朱老师 (zyp)	7ms	532 KiB		192 Bytes	2024-2-24 15:14:33
AC	向浚郗	7ms	284 KiB		95 Bytes	2024-3-29 19:46:08
AC	马安馨	7ms	532 KiB		216 Bytes	2024-2-25 14:36:02
AC	思密达	7ms	532 KiB		86 Bytes	2024-3-23 11:33:02
AC	綰綰(HHYT)	7ms	516 KiB		74 Bytes	2024-4-11 21:26:34