倒序输出

状态	递交者	时间	内存	语言	代码	递交时间
AC	yanghaodi	15ms	512 KiB		147 Bytes	2022-9-13 19:15:11
AC	曹埊睿 (caodirui)	15ms	6.7 MiB		468 Bytes	2023-9-16 19:31:10
AC	zjl	15ms	440 KiB		151 Bytes	2023-3-12 14:44:40
AC	胡宸华 (huchenhua)	16ms	6.9 MiB		144 Bytes	2023-7-18 14:06:57
AC	李卓燃 (李卓燃1)	16ms	452 KiB		130 Bytes	2023-3-17 17:19:33
AC	胡熙景	16ms	384 KiB		142 Bytes	2022-9-9 20:25:03
AC	刘子睿 (liuzirui)	16ms	512 KiB		137 Bytes	2023-3-10 18:32:55
AC	霍弈丞小号	16ms	384 KiB		154 Bytes	2022-8-26 10:49:48
AC	xuniaoyin (徐袅音)	16ms	432 KiB		119 Bytes	2023-3-26 14:18:44
AC	(张洛诚)	16ms	384 KiB		166 Bytes	2022-9-9 18:42:22
AC	胡熙景	16ms	384 KiB		142 Bytes	2022-9-9 18:59:28
AC	食不食油饼（点主页康康） (Nemo)	16ms	392 KiB		143 Bytes	2022-9-9 19:47:23
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)	16ms	6.8 MiB		163 Bytes	2023-6-11 10:29:35
AC	huyinuo	16ms	444 KiB		161 Bytes	2022-10-10 11:05:33
AC	食不食油饼（点主页康康） (Nemo)	16ms	384 KiB		143 Bytes	2022-9-9 19:47:22
AC	食不食油饼（点主页康康） (Nemo)	16ms	512 KiB		143 Bytes	2022-9-9 19:47:23
AC	yanghaodi	16ms	512 KiB		147 Bytes	2022-9-13 19:15:04
AC	yanghaodi	16ms	384 KiB		147 Bytes	2022-9-13 19:14:28
AC	Randy Marsh (杨子腾)	16ms	512 KiB		147 Bytes	2023-1-11 13:51:27
AC	食不食油饼（点主页康康） (Nemo)	16ms	384 KiB		143 Bytes	2022-9-9 19:47:22
AC	yanghaodi	16ms	384 KiB		147 Bytes	2022-9-13 19:14:29
AC	wangshuo	16ms	384 KiB		148 Bytes	2022-9-16 19:03:35
AC	yanghaodi	16ms	512 KiB		147 Bytes	2022-9-13 19:14:32
AC	肖钦文 (xiaoqinwen)	16ms	392 KiB		142 Bytes	2022-8-26 10:53:33
AC	yanghaodi	16ms	384 KiB		147 Bytes	2022-9-13 19:14:27
AC	黄梓桐 (HuangZiTong)	17ms	440 KiB		160 Bytes	2022-10-7 16:33:25
AC	食不食油饼（点主页康康） (Nemo)	17ms	392 KiB		143 Bytes	2022-9-9 19:47:24
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	424 KiB		169 Bytes	2022-10-12 18:26:24
AC	章愉霖	18ms	6.9 MiB		159 Bytes	2023-7-26 10:14:40
AC	yanghaodi	19ms	400 KiB		147 Bytes	2022-9-13 19:14:36
AC	yanghaodi	19ms	392 KiB		147 Bytes	2022-9-13 19:14:30
AC	徐正旺 (xzw)	20ms	444 KiB		136 Bytes	2022-12-7 16:10:25
AC	wuqilin	21ms	512 KiB		133 Bytes	2022-9-7 18:52:13
AC	伍芷函	22ms	512 KiB		173 Bytes	2022-8-26 10:58:13
AC	xsm梁家畅	64ms	532 KiB	C++98(O2)	150 Bytes	2025-1-22 10:29:00
AC	Yuan (Zongzi1)	66ms	532 KiB	C++17(O2)	191 Bytes	2025-2-13 19:04:24
AC	Him神	70ms	536 KiB		142 Bytes	2024-3-4 15:28:07
AC	https://www.crazygames.com/game/merge-construct (陈诺)	70ms	764 KiB		141 Bytes	2024-2-5 12:17:00
AC	XSM施白羽	73ms	764 KiB	C++98(O2)	166 Bytes	2025-3-29 11:32:39
AC	xsm张庭硕	73ms	768 KiB	C++11	137 Bytes	2025-1-22 13:04:37
AC	xsm谢吉童	75ms	760 KiB	C++98(O2)	172 Bytes	2025-3-9 17:45:21
AC	zyl	76ms	768 KiB		139 Bytes	2024-1-25 14:52:32
AC	温煦	76ms	776 KiB	C++98	220 Bytes	2025-2-16 16:16:53
AC	张芮茜	77ms	544 KiB	C++11	147 Bytes	2025-3-27 20:43:54
AC	猫不理包子	189ms	8.9 MiB	Python 3	54 Bytes	2023-8-3 10:49:03
AC	杨坤霖 (steven)	202ms	3.9 MiB	Python 3	73 Bytes	2022-11-19 14:12:19
AC	时代二校-焦雨齐 (Angel)	204ms	4 MiB	Python 3	41 Bytes	2023-1-8 12:24:26
AC	杨坤霖 (steven)	217ms	4 MiB	Python 3	73 Bytes	2022-11-19 14:12:18
AC	我推忘归人 (贺俊楠)	223ms	4 MiB	Python 3	123 Bytes	2023-1-4 11:29:33