判断回文数

状态	递交者	时间	内存	语言	代码	递交时间
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	8ms	7 MiB		179 Bytes	2023-12-27 14:20:15
AC	时代二校+王吕棪 (wanglvyan)	11ms	6.5 MiB		224 Bytes	2023-11-19 13:18:39
AC	杨坤霖 (steven)	12ms	384 KiB		285 Bytes	2023-2-12 14:16:01
AC	许梓宸 (xuzichen)	12ms	6.7 MiB	C++17(O2)	261 Bytes	2024-7-17 16:18:02
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	13ms	384 KiB		243 Bytes	2023-2-4 9:25:44
AC	疯神芭芭脱丝 (李卓修)	13ms	392 KiB		261 Bytes	2023-3-6 17:25:43
AC	赵奕铭	13ms	7 MiB	C++98	214 Bytes	2024-6-26 17:10:00
AC	https://www.minecraft.net/zh-hans (王振西)	13ms	384 KiB		215 Bytes	2023-5-21 14:02:03
AC	22029-hqh	13ms	384 KiB		291 Bytes	2023-2-4 10:03:54
AC	22029-hqh	13ms	384 KiB		291 Bytes	2023-2-4 10:03:37
AC	22029-hqh	13ms	384 KiB		291 Bytes	2023-2-4 10:03:54
AC	22029-hqh	13ms	408 KiB		291 Bytes	2023-2-4 10:03:38
AC	22029-hqh	13ms	384 KiB		291 Bytes	2023-2-4 10:04:03
AC	22029-hqh	13ms	384 KiB		291 Bytes	2023-2-4 10:03:54
AC	11451254188 (22029-mjh)	13ms	444 KiB		232 Bytes	2023-2-4 9:48:26
AC	(张洛诚)	13ms	512 KiB		406 Bytes	2023-5-1 15:40:07
AC	张瑞博	13ms	6.6 MiB	C++11	270 Bytes	2024-7-9 20:35:27
AC	kongql	14ms	7.2 MiB	C++11	259 Bytes	2024-5-11 19:30:20
AC	22029-hqh	14ms	392 KiB		291 Bytes	2023-2-4 10:03:43
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:03:46
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:03:44
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:03:40
AC	22029-hqh	14ms	392 KiB		291 Bytes	2023-2-4 10:03:37
AC	22029-hqh	14ms	392 KiB		291 Bytes	2023-2-4 10:03:48
AC	22029-hqh	14ms	408 KiB		291 Bytes	2023-2-4 10:03:50
AC	时代一校 - 冯隆浩 (冯隆浩)	14ms	444 KiB		372 Bytes	2023-2-11 22:40:22
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)	14ms	384 KiB		287 Bytes	2023-2-4 9:30:14
AC	爱琴海校区-刁钲洋 (刁钲洋)	14ms	440 KiB		339 Bytes	2023-4-9 12:50:08
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:04:03
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:03:43
AC	周琪渃	14ms	384 KiB		230 Bytes	2023-2-25 17:14:17
AC	22029-hqh	14ms	396 KiB		291 Bytes	2023-2-4 10:04:03
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:03:54
AC	22029-hqh	14ms	392 KiB		291 Bytes	2023-2-4 10:04:04
AC	22029-hqh	14ms	392 KiB		291 Bytes	2023-2-4 10:03:54
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:03:49
AC	张月恒	14ms	6.9 MiB	C++98(O2)	219 Bytes	2024-6-23 18:22:21
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:03:48
AC	22029-hqh	14ms	392 KiB		291 Bytes	2023-2-4 10:03:49
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:03:43
AC	22029-hqh	14ms	392 KiB		291 Bytes	2023-2-4 10:03:38
AC	22029-lsl	14ms	520 KiB		311 Bytes	2023-2-4 9:47:45
AC	22029-hqh	14ms	384 KiB		291 Bytes	2023-2-4 10:04:03
AC	杨瀚霖 (yanghanlin)	14ms	6.7 MiB		275 Bytes	2023-6-9 15:42:46
AC	我推的乱破 (贺俊楠)	14ms	6.8 MiB		338 Bytes	2023-6-18 10:55:28
AC	22029-hqh	14ms	432 KiB		291 Bytes	2023-2-4 10:03:32
AC	时代二校-陈天成 (鸭缩毛巾)	15ms	6.9 MiB		262 Bytes	2023-6-29 21:21:50
AC	陈家齐 (陈家齐1)	15ms	7 MiB		210 Bytes	2023-7-4 16:32:37
AC	colin1112 (墙凌可)	15ms	6.8 MiB		286 Bytes	2023-8-20 10:44:05
AC	22029-hqh	15ms	396 KiB		291 Bytes	2023-2-4 10:03:49
AC	zhm123	15ms	428 KiB		282 Bytes	2023-3-30 15:50:33
AC	时代2校-程俊燃 (chengjunran)	15ms	6.9 MiB		222 Bytes	2023-7-21 12:33:29
AC	李哲 (lizhe)	15ms	384 KiB		203 Bytes	2023-1-11 21:58:13
AC	李哲 (lizhe)	15ms	384 KiB		203 Bytes	2023-1-12 17:31:35
AC	黄梓桐 (HuangZiTong)	15ms	392 KiB		285 Bytes	2023-1-15 17:37:56
AC	曹埊睿 (caodirui)	16ms	512 KiB		259 Bytes	2023-5-12 19:24:24
AC	科比.布莱恩特 (董浩琰)	16ms	7 MiB		220 Bytes	2023-6-30 19:46:49
AC	爱情海校区—沙天一 (沙天一)	16ms	7.1 MiB		203 Bytes	2023-7-9 9:21:36
AC	无尽的想象 (谭仕高)	16ms	6.9 MiB		207 Bytes	2023-8-2 18:05:44
AC	何昊宇 (22016-hhy)	17ms	6.9 MiB		325 Bytes	2023-8-13 10:49:43
AC	SMIK	17ms	512 KiB		299 Bytes	2023-1-12 20:53:37
AC	中岛敦 (黄麒瑞)	36ms	7 MiB		328 Bytes	2023-11-26 9:21:40
AC	K517	67ms	548 KiB		267 Bytes	2024-4-4 12:52:50
AC	冉诩然	68ms	532 KiB	C++11	371 Bytes	2024-10-17 20:08:08
AC	邹智吉	69ms	764 KiB	C++98	249 Bytes	2024-10-21 22:24:19
AC	廖祥富	70ms	532 KiB	C++17	223 Bytes	2024-10-12 15:05:22
AC	付玮钊	71ms	536 KiB	C++11	249 Bytes	2024-11-3 11:12:25
AC	Accepted (周芷乐)	72ms	764 KiB	C++14	201 Bytes	2024-10-7 9:46:53
AC	A小涂	72ms	768 KiB	C++17	185 Bytes	2024-10-5 8:47:05
AC	崔欧辰	73ms	536 KiB	C++11	369 Bytes	2024-11-3 11:11:52
AC	学神降临 (陈柯玮)	195ms	9 MiB	Python 3	89 Bytes	2023-7-4 17:16:24
AC	11451254188 (22029-mjh)	200ms	3.9 MiB	Python 3	72 Bytes	2023-2-4 9:33:31
AC	杨坤霖 (steven)	210ms	4 MiB	Python 3	74 Bytes	2023-1-19 16:53:52
AC	杨坤霖 (steven)	212ms	3.9 MiB	Python 3	74 Bytes	2023-1-19 16:53:53