回文数

状态	递交者	时间	内存	语言	代码	递交时间
AC	江子墨	16ms	7 MiB	C++98	460 Bytes	2024-6-21 20:09:06
AC	scallway	21ms	7.2 MiB	C++11	225 Bytes	2024-4-21 14:44:02
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)	21ms	384 KiB		312 Bytes	2023-2-4 9:47:33
AC	段淏泷	22ms	6.5 MiB	C++98	214 Bytes	2024-7-23 17:17:59
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	22ms	384 KiB		301 Bytes	2023-2-4 9:35:17
AC	杨坤霖 (steven)	22ms	428 KiB		324 Bytes	2023-2-2 18:24:12
AC	杨坤霖 (steven)	22ms	384 KiB		324 Bytes	2023-2-2 18:24:12
AC	Ryan	22ms	7.3 MiB	C++98	261 Bytes	2024-4-21 16:58:31
AC	杨坤霖 (steven)	22ms	412 KiB		324 Bytes	2023-2-2 18:24:12
AC	22029-hqh	22ms	384 KiB		356 Bytes	2023-2-4 10:11:05
AC	杨坤霖 (steven)	22ms	392 KiB		324 Bytes	2023-2-2 18:24:12
AC	ttt123	22ms	384 KiB		330 Bytes	2023-2-3 19:08:35
AC	杨坤霖 (steven)	23ms	412 KiB		324 Bytes	2023-2-2 18:24:11
AC	杨哲羽	23ms	7.1 MiB	C++11	214 Bytes	2024-6-22 15:38:57
AC	杨坤霖 (steven)	23ms	416 KiB		324 Bytes	2023-2-2 18:24:13
AC	杨坤霖 (steven)	23ms	396 KiB		324 Bytes	2023-2-2 18:24:12
AC	zcx	23ms	412 KiB		301 Bytes	2023-2-3 19:09:28
AC	11451254188 (22029-mjh)	23ms	392 KiB		329 Bytes	2023-2-4 10:27:22
AC	李绪航	23ms	6.6 MiB	C++11	267 Bytes	2024-7-19 19:27:11
AC	杨坤霖 (steven)	23ms	400 KiB		324 Bytes	2023-2-2 18:24:11
AC	22029-zjs	23ms	416 KiB		314 Bytes	2023-2-3 19:08:36
AC	22029-lsl	23ms	396 KiB		339 Bytes	2023-2-4 9:30:30
AC	姚宏逸	23ms	384 KiB		218 Bytes	2023-1-11 20:47:36
AC	朱子龙	23ms	6.8 MiB	C++11	241 Bytes	2024-8-15 10:54:12
AC	杨坤霖 (steven)	23ms	440 KiB		324 Bytes	2023-2-2 18:24:10
AC	坤坤荔枝小黑子 (zhonghaotian22006)	23ms	440 KiB		340 Bytes	2023-2-11 16:22:45
AC	坤坤荔枝小黑子 (zhonghaotian22006)	24ms	512 KiB		357 Bytes	2023-2-20 20:30:36
AC	zyq1	24ms	504 KiB		332 Bytes	2023-5-29 21:05:26
AC	周琪渃	24ms	392 KiB		343 Bytes	2023-2-25 17:28:12
AC	22029-lsl	24ms	512 KiB		339 Bytes	2023-2-4 9:28:40
AC	邹智吉	25ms	6.8 MiB	C++98	364 Bytes	2024-8-25 14:02:42
AC	zhm123	26ms	436 KiB		301 Bytes	2023-3-30 15:52:07
AC	colin1112 (墙凌可)	26ms	6.7 MiB		370 Bytes	2023-8-30 10:26:46
AC	李哲 (lizhe)	26ms	440 KiB		256 Bytes	2023-1-14 11:44:13
AC	SMIK	26ms	392 KiB		334 Bytes	2023-1-12 20:54:23
AC	zzzrrrxxx	26ms	6.7 MiB		216 Bytes	2023-9-28 16:38:07
AC	杨瀚霖 (yanghanlin)	27ms	6.7 MiB		391 Bytes	2023-6-9 15:50:50
AC	黄梓桐 (HuangZiTong)	27ms	512 KiB		281 Bytes	2023-1-15 17:39:01
AC	谁陪訫牞（杀手） (22029-zys)	30ms	444 KiB		339 Bytes	2023-2-3 19:13:58
AC	huanglu	30ms	7.1 MiB		287 Bytes	2023-12-7 13:12:10
AC	(金沙天街)严皓月 (严皓月)	34ms	7.1 MiB		275 Bytes	2023-12-3 19:56:05
AC	陌生人 (涂玉龙)	34ms	7 MiB		291 Bytes	2024-1-14 14:07:12
AC	高彬月	35ms	7 MiB		300 Bytes	2024-1-14 14:20:10
AC	源著校区-宋昊成 (马冬梅)	39ms	7.1 MiB		275 Bytes	2023-12-3 18:57:32
AC	易锦程 (sky)	43ms	7.2 MiB		393 Bytes	2023-12-3 15:31:33
AC	黄彦熹 (AK-203)	45ms	6.9 MiB		250 Bytes	2023-12-7 20:26:52
AC	tangshangjie12345	46ms	7 MiB		265 Bytes	2023-12-6 19:15:08
AC	章愉霖	53ms	7 MiB		228 Bytes	2023-12-7 20:32:49
AC	黄立信	57ms	7 MiB		323 Bytes	2023-12-20 19:29:51
AC	朱老师 (zyp)	64ms	7.2 MiB		372 Bytes	2024-1-19 17:19:02
AC	U城校区-邓皓月 (邓皓月)	64ms	6.6 MiB	C++11	256 Bytes	2024-7-17 15:13:30
AC	煞笔笔	87ms	768 KiB		211 Bytes	2024-4-4 11:13:49
AC	时代一校石博文 (shibowen)	89ms	776 KiB		1.4 KiB	2024-3-30 11:51:39
AC	c (江宇轩)	91ms	764 KiB		245 Bytes	2024-3-15 20:19:36
AC	李浩然	93ms	540 KiB		351 Bytes	2024-3-6 20:02:17
AC	李禹呈	94ms	768 KiB	C++11	235 Bytes	2024-9-6 15:22:41
AC	新壹街校区-陈琬舒 (空空大师)	102ms	7.2 MiB		374 Bytes	2023-12-1 19:16:14
AC	可爱酱 (张可忻)	334ms	9.4 MiB	Python 3	324 Bytes	2024-7-27 17:04:45
AC	kongql	1254ms	4 MiB	Python 3	221 Bytes	2023-3-8 13:59:51