「例题1-2」三位数反转

状态	递交者	时间	内存	语言	代码	递交时间
AC	国林泽 (guolinze)	7ms	384 KiB		248 Bytes	2022-2-20 21:16:25
AC	huqingyu	7ms	384 KiB		202 Bytes	2022-4-23 15:28:43
AC	(张洛诚)	7ms	384 KiB		180 Bytes	2023-4-7 23:13:03
AC	芒苒忧 (廖迦南)	7ms	384 KiB		187 Bytes	2022-1-25 14:26:35
AC	凌肯 (lingken22006)	7ms	392 KiB		220 Bytes	2022-7-31 18:45:29
AC	凌肯 (lingken22006)	7ms	384 KiB		220 Bytes	2022-7-31 18:45:29
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)	7ms	392 KiB		208 Bytes	2023-4-23 19:26:31
AC	陈家熠	7ms	6.9 MiB	C++11	318 Bytes	2024-5-21 17:08:51
AC	ZERO_VOID	7ms	384 KiB		170 Bytes	2022-4-9 9:37:26
AC	李某人	7ms	384 KiB		197 Bytes	2022-1-26 11:10:34
AC	Z.饮月君 (张皓南)	7ms	384 KiB		213 Bytes	2022-5-19 17:55:33
AC	王祎辰 (wangyichen)	7ms	384 KiB		158 Bytes	2023-4-1 19:16:18
AC	余晨浩 (yuchenhao)	7ms	384 KiB		185 Bytes	2022-8-24 15:26:23
AC	lch (凌昌瀚)	7ms	392 KiB		248 Bytes	2022-5-28 11:18:35
AC	余晨浩 (yuchenhao)	7ms	384 KiB		185 Bytes	2022-8-24 15:25:25
AC	LDE__113 (逯典恩)	7ms	384 KiB		179 Bytes	2022-1-25 14:18:45
AC	田雨杨 (tianyuyang23010)	7ms	7.2 MiB	C++11	122 Bytes	2024-4-30 20:50:17
AC	时代2校+涂彦迪 (tuyandi)	7ms	6.9 MiB		143 Bytes	2023-7-15 15:48:07
AC	old_doctor	7ms	436 KiB		172 Bytes	2022-6-6 13:53:45
AC	赵彬鸿	7ms	392 KiB		207 Bytes	2022-4-23 15:29:10
AC	凌肯 (lingken22006)	7ms	384 KiB		220 Bytes	2022-7-31 18:45:29
AC	. (Pig)	7ms	392 KiB		211 Bytes	2022-1-20 9:44:51
AC	无尽的想象 (谭仕高)	7ms	512 KiB		169 Bytes	2022-7-12 13:09:17
AC	任舒尧	7ms	436 KiB		248 Bytes	2023-2-1 9:10:51
AC	灿灿 (CAN)	7ms	384 KiB		224 Bytes	2022-5-12 17:02:27
AC	chaikexu	7ms	384 KiB		250 Bytes	2022-11-23 17:07:51
AC	huqingyu	7ms	384 KiB		202 Bytes	2022-4-23 15:28:48
AC	xiangsiyu	7ms	392 KiB		222 Bytes	2022-6-21 21:36:06
AC	panyan	7ms	384 KiB		187 Bytes	2022-4-23 15:29:22
AC	wky	7ms	384 KiB		322 Bytes	2022-7-8 18:54:23
AC	印昭旭（412） (印昭旭)	7ms	6.8 MiB		265 Bytes	2023-9-30 17:52:10
AC	金锦泽 (jinjinze)	7ms	6.8 MiB		228 Bytes	2023-10-4 12:49:20
AC	Nico	7ms	384 KiB		144 Bytes	2022-12-23 16:36:03
AC	郭益豪（帅哥） (guoyihao)	7ms	384 KiB		251 Bytes	2023-4-1 15:53:31
AC	王祎辰 (wangyichen)	7ms	384 KiB		158 Bytes	2023-4-1 19:16:26
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	7ms	6.7 MiB		272 Bytes	2023-9-24 13:26:44
AC	罗竣瀚	7ms	436 KiB		180 Bytes	2023-5-11 18:50:41
AC	王祎辰 (wangyichen)	7ms	384 KiB		158 Bytes	2023-4-1 19:16:24
AC	段淏泷	7ms	7 MiB	C++98	160 Bytes	2024-6-23 13:30:23
AC	袁辰奕 (yuanchenyi11b)	7ms	392 KiB		306 Bytes	2022-7-18 19:54:03
AC	wangchenyu	7ms	384 KiB		212 Bytes	2022-1-24 13:17:01
AC	王泓涵 (whh)	7ms	384 KiB		189 Bytes	2022-6-19 10:50:49
AC	advent259	7ms	7.2 MiB	C++14(O2)	191 Bytes	2024-5-16 16:42:28
AC	啊...这 (炼狱杏寿郎)	7ms	420 KiB		204 Bytes	2022-8-12 13:54:27
AC	heyuzhe	7ms	7 MiB	C++98	212 Bytes	2024-6-19 18:56:52
AC	余晨浩 (yuchenhao)	7ms	384 KiB		185 Bytes	2022-8-24 15:26:20
AC	Randy Marsh (杨子腾)	7ms	508 KiB		210 Bytes	2022-1-24 9:52:41
AC	余晨浩 (yuchenhao)	7ms	384 KiB		185 Bytes	2022-8-24 15:25:18
AC	dyp (hhy)	7ms	384 KiB		291 Bytes	2023-4-1 14:02:41
AC	lvlu	7ms	392 KiB		184 Bytes	2022-7-23 15:53:56
AC	王祎辰 (wangyichen)	7ms	392 KiB		158 Bytes	2023-4-1 19:16:28
AC	余晨浩 (yuchenhao)	7ms	384 KiB		185 Bytes	2022-8-24 15:25:23
AC	ganlin1	7ms	428 KiB		178 Bytes	2023-5-13 9:43:55
AC	BJ6180C8CTD (Fan)	7ms	6.7 MiB		162 Bytes	2023-9-17 9:06:14
AC	张智洋	7ms	6.9 MiB		137 Bytes	2023-7-15 15:47:21
AC	邓皓天 (1234567A)	7ms	6.8 MiB		164 Bytes	2023-10-9 18:45:20
AC	huqingyu	7ms	384 KiB		202 Bytes	2022-4-23 15:28:48
AC	余晨浩 (yuchenhao)	7ms	392 KiB		185 Bytes	2022-8-24 15:26:23
AC	谢佳辰	7ms	420 KiB		236 Bytes	2022-4-17 9:47:51
AC	火爆肥肠（杨弘毅） (火爆肥肠)	7ms	412 KiB		183 Bytes	2022-4-7 21:04:12
AC	付博plus	7ms	432 KiB		191 Bytes	2023-2-12 18:18:57
AC	王祎辰 (wangyichen)	7ms	384 KiB		158 Bytes	2023-4-1 19:16:26
AC	国林泽 (guolinze)	7ms	444 KiB		262 Bytes	2022-2-20 20:34:26
AC	22029-hqh	7ms	384 KiB		157 Bytes	2023-5-20 9:55:14
AC	新壹街校区-罗斤天 (罗斤天)	7ms	436 KiB		194 Bytes	2023-4-22 13:11:01
AC	李昀铂	7ms	436 KiB		190 Bytes	2022-2-26 9:25:21
AC	汤杰尧 (05c05-tjy1)	7ms	384 KiB		215 Bytes	2022-5-8 12:57:43
AC	阮 (媚狐不吃道旁李)	7ms	384 KiB		170 Bytes	2023-3-26 13:32:00
AC	言年想摆烂~	7ms	384 KiB		441 Bytes	2023-3-14 22:42:06
AC	maomao	7ms	384 KiB		228 Bytes	2022-5-19 13:39:02
AC	周琪渃	7ms	384 KiB		297 Bytes	2022-11-27 16:46:45
AC	CYT	7ms	6.8 MiB		185 Bytes	2023-10-10 9:29:38
AC	伍芷函	7ms	448 KiB		171 Bytes	2022-9-4 22:22:20
AC	极为的好van的 (lyq)	7ms	420 KiB		182 Bytes	2022-6-19 10:32:59
AC	谢思睿	7ms	6.8 MiB		156 Bytes	2023-9-3 11:40:23
AC	dengfeng	7ms	384 KiB		311 Bytes	2022-2-10 16:21:59
AC	任凌薇	7ms	6.9 MiB		150 Bytes	2023-7-16 10:19:10
AC	王祎辰 (wangyichen)	7ms	392 KiB		158 Bytes	2023-4-1 19:16:17
AC	王祎辰 (wangyichen)	7ms	384 KiB		158 Bytes	2023-4-1 19:16:27
AC	本人天生贪生pass (05c41-cqs)	7ms	6.9 MiB		127 Bytes	2023-7-26 15:31:54
AC	王祎辰 (wangyichen)	7ms	392 KiB		158 Bytes	2023-4-1 19:16:18
AC	longhao	7ms	384 KiB		174 Bytes	2022-1-23 16:57:54
AC	王祎辰 (wangyichen)	7ms	452 KiB		158 Bytes	2023-4-1 19:16:30
AC	刘鹤枫 (liuhefeng)	7ms	436 KiB		231 Bytes	2022-8-1 17:09:38
AC	关博源	7ms	384 KiB		195 Bytes	2023-2-20 19:21:18
AC	余晨浩 (yuchenhao)	7ms	392 KiB		185 Bytes	2022-8-24 15:25:26
AC	喵 (蹇心悦)	7ms	384 KiB		194 Bytes	2022-4-23 15:22:46
AC	金沙校区-李嘉齐 (李嘉齐)	7ms	7.2 MiB	C++98	173 Bytes	2024-5-2 22:34:56
AC	赵彬鸿	7ms	384 KiB		207 Bytes	2022-4-23 15:29:09
AC	李雨宸 (lyc)	7ms	440 KiB		166 Bytes	2022-7-27 8:44:22
AC	任希贤	7ms	436 KiB		205 Bytes	2022-12-3 16:51:32
AC	曾御城（现用名） (Jason)	7ms	384 KiB		234 Bytes	2022-1-23 16:52:10
AC	余晨浩 (yuchenhao)	7ms	384 KiB		185 Bytes	2022-8-24 15:25:18
AC	dengfeng	7ms	384 KiB		304 Bytes	2022-2-10 16:20:02
AC	什蒂尔布 (吴东航)	7ms	6.9 MiB	C++98	203 Bytes	2024-5-20 16:54:17
AC	wangzihang	7ms	436 KiB	C++	148 Bytes	2022-7-26 14:01:49
AC	huqingyu	7ms	384 KiB		202 Bytes	2022-4-23 15:28:48
AC	王祎辰 (wangyichen)	7ms	384 KiB		158 Bytes	2023-4-1 19:16:27
AC	汪致卉 (wangzh)	7ms	444 KiB		258 Bytes	2022-1-15 20:13:07
AC	爱情海校区—沙天一 (沙天一)	7ms	6.9 MiB		222 Bytes	2023-7-31 13:26:51