数字翻转

状态	递交者	时间	内存	语言	代码	递交时间
AC	MacrozClick_ (蒋淞霖)	7ms	256 KiB		330 Bytes	2022-1-26 16:12:11
AC	韩正墨 (xmw05)	12ms	512 KiB		246 Bytes	2022-7-16 8:51:33
AC	朱老师 (zyp)	13ms	384 KiB		215 Bytes	2023-5-21 19:32:48
AC	黄梓桐 (HuangZiTong)	13ms	384 KiB		200 Bytes	2023-2-26 13:29:33
AC	算法战神 (konglinghao)	13ms	6.8 MiB		197 Bytes	2023-10-27 21:32:21
AC	蒲梓勋 (puzixun)	14ms	452 KiB		346 Bytes	2022-8-9 22:03:57
AC	唐良瑞 (22016-tlr01)	14ms	384 KiB		272 Bytes	2023-3-26 10:24:35
AC	1396013295	14ms	384 KiB		290 Bytes	2022-1-23 19:20:13
AC	ycy	14ms	512 KiB		384 Bytes	2023-1-7 1:00:05
AC	樊竣熠 (lft1114)	14ms	436 KiB		205 Bytes	2022-8-17 10:19:32
AC	疯神芭芭脱丝 (李卓修)	14ms	436 KiB		564 Bytes	2022-7-14 9:54:52
AC	疯神芭芭脱丝 (李卓修)	14ms	432 KiB		222 Bytes	2023-2-4 10:27:56
AC	姚宏逸	14ms	512 KiB		449 Bytes	2022-3-3 19:41:41
AC	甄一阳 (22016-zyy)	14ms	396 KiB		267 Bytes	2023-3-26 10:17:56
AC	赵泳鑫 (zhaoyongxin)	14ms	432 KiB		591 Bytes	2022-7-15 14:52:39
AC	zlx (xiao)	14ms	420 KiB		359 Bytes	2022-11-26 20:15:12
AC	RanHao	14ms	6.7 MiB		193 Bytes	2023-9-7 10:03:52
AC	22016-lyj	14ms	512 KiB		243 Bytes	2023-3-26 10:25:43
AC	22016-yzq	14ms	488 KiB		290 Bytes	2023-3-26 10:22:19
AC	时代二校-焦雨齐 (Angel)	14ms	6.7 MiB		247 Bytes	2023-9-2 18:06:17
AC	ttt123	15ms	440 KiB		278 Bytes	2023-3-25 23:26:16
AC	王晨志 (wangchenzhi)	15ms	512 KiB		281 Bytes	2022-3-5 18:13:11
AC	(张洛诚)	15ms	432 KiB		256 Bytes	2023-5-18 19:43:26
AC	时代二校-陈天成 (鸭缩毛巾)	15ms	6.8 MiB		239 Bytes	2023-6-30 22:36:52
AC	22016-yzq	15ms	428 KiB		315 Bytes	2023-3-26 9:56:14
AC	何昊宇 (22016-hhy)	15ms	384 KiB		282 Bytes	2023-3-26 10:23:46
AC	坤坤荔枝小黑子 (zhonghaotian22006)	15ms	512 KiB		331 Bytes	2022-10-16 16:28:45
AC	ttt123	16ms	392 KiB		304 Bytes	2023-3-26 10:18:07
AC	huyinuo	16ms	436 KiB		518 Bytes	2022-8-27 9:43: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)	16ms	7 MiB		343 Bytes	2023-6-17 11:00:01
AC	郑岐蔚	16ms	512 KiB		184 Bytes	2023-1-26 15:00:20
AC	Tender. (05c05-zhou)	17ms	6.7 MiB		197 Bytes	2023-8-25 11:18:56
AC	时代2校-程俊燃 (chengjunran)	18ms	6.9 MiB		197 Bytes	2023-7-21 12:36:51
AC	zhm123	20ms	512 KiB		247 Bytes	2023-4-7 15:07:19
AC	luoluonuoya	25ms	436 KiB		266 Bytes	2022-8-30 14:28:22
AC	zyl	57ms	536 KiB		313 Bytes	2024-2-2 15:31:15
AC	yanyuhan	62ms	764 KiB		199 Bytes	2024-3-2 10:07:20
AC	wrz	63ms	764 KiB		253 Bytes	2024-1-28 17:59:46
AC	那吒 (yuchenyi23017)	63ms	532 KiB		228 Bytes	2024-1-28 16:12:11
AC	超级小菜鸟😀 (超级小白)	64ms	768 KiB		194 Bytes	2024-3-2 10:03:39
AC	胡云杰	65ms	536 KiB		240 Bytes	2024-1-28 17:58:39
AC	真的高兴(死)了 (huyunyi1)	67ms	764 KiB		173 Bytes	2024-2-21 18:55:33
AC	叶哲宇 (yzy)	67ms	552 KiB		435 Bytes	2024-3-2 9:44:54
AC	dyp (hhy)	68ms	548 KiB		168 Bytes	2024-3-2 9:41:14
AC	弹射起飞 ? 冲 ! (吴周周)	68ms	540 KiB		321 Bytes	2024-3-23 17:59:17
AC	我推忘归人 (贺俊楠)	68ms	548 KiB		268 Bytes	2024-2-5 18:58:03
AC	BJ6180C8CTD (Fan)	68ms	764 KiB		292 Bytes	2024-3-2 9:43:36
AC	编程小黑№ (叶睿)	69ms	532 KiB	C++14	239 Bytes	2025-2-11 17:40:15
AC	你个你怎么跟个一样 (钟卓劭)	71ms	764 KiB		172 Bytes	2024-4-11 18:33:08
AC	colin1112 (墙凌可)	73ms	764 KiB	C++20(O2)	434 Bytes	2025-2-8 10:41:52
AC	BJ6180C8CTD (Fan)	75ms	532 KiB		281 Bytes	2024-3-2 9:41:40
AC	xsm谢吉童	79ms	552 KiB	C++98(O2)	684 Bytes	2025-3-23 16:00:17
AC	xsm梁家畅	79ms	532 KiB	C++98(O2)	209 Bytes	2025-3-23 13:27:53
AC	11451254188 (22029-mjh)	198ms	3.9 MiB	Python 3	77 Bytes	2023-5-14 9:36:08
AC	黄琛轩	200ms	4.1 MiB	Python 3	107 Bytes	2022-5-28 18:43:55
AC	猫不理包子	203ms	9 MiB	Python 3	80 Bytes	2023-8-3 10:30:55
AC	majinhui	205ms	4 MiB	Python 3	77 Bytes	2022-8-3 14:05:26
AC	11111	207ms	3.9 MiB	Python 3	222 Bytes	2022-3-3 20:47:11
AC	梨冻亿 (wiueh)	208ms	3.9 MiB	Python 3	83 Bytes	2022-1-23 20:30:28
AC	谭红中 (不知道)	208ms	3.9 MiB	Python 3	110 Bytes	2022-4-2 18:16:01
AC	11111	218ms	3.9 MiB	Python 3	222 Bytes	2022-3-3 20:47:11
AC	11111	219ms	3.9 MiB	Python 3	222 Bytes	2022-3-3 20:47:10
AC	11111	220ms	3.9 MiB	Python 3	222 Bytes	2022-3-3 20:47:11
AC	奶龙 (hterberjh4ewjn54hgbh4)	666ms	4 MiB	Python 3	256 Bytes	2025-3-14 16:54:51