过滤空格1

状态	递交者	时间	内存	语言	代码	递交时间
AC	葛琮扬	30ms	6.9 MiB		243 Bytes	2023-8-11 13:25: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)	30ms	512 KiB		339 Bytes	2023-1-1 17:33:45
AC	没有此人 (akm)	30ms	520 KiB		231 Bytes	2022-12-31 18:11:04
AC	时代二校-陈天成 (鸭缩毛巾)	31ms	6.9 MiB		230 Bytes	2023-6-17 21:48:52
AC	朱泽晟	31ms	384 KiB		321 Bytes	2022-8-31 17:01:44
AC	许炜铭 (xuweiming)	31ms	7.1 MiB		276 Bytes	2023-7-18 16:42:21
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	31ms	424 KiB		247 Bytes	2022-12-25 9:35:54
AC	王康瑞	31ms	7.1 MiB		182 Bytes	2024-1-20 15:56:33
AC	kim	31ms	440 KiB		233 Bytes	2023-3-26 15:08:48
AC	黄梓轩 (huangzixuan)	31ms	6.9 MiB		225 Bytes	2023-7-15 8:24:30
AC	金沙—彭智宸 (彭智宸)	31ms	6.9 MiB		191 Bytes	2023-8-10 12:56:01
AC	zlx (xiao)	31ms	512 KiB		219 Bytes	2022-11-26 18:46:08
AC	朱老师 (zyp)	31ms	6.9 MiB		216 Bytes	2023-8-18 17:19:19
AC	Tender. (05c05-zhou)	32ms	444 KiB		196 Bytes	2022-10-19 21:57:33
AC	时代二校-焦雨齐 (Angel)	32ms	6.9 MiB		182 Bytes	2023-6-24 17:39:28
AC	ycy	32ms	432 KiB		198 Bytes	2022-9-29 20:56:40
AC	胡程禹	32ms	7 MiB		228 Bytes	2023-7-7 9:50:05
AC	刘致言	32ms	512 KiB		238 Bytes	2022-9-22 20:37:12
AC	陈家齐 (陈家齐1)	32ms	7 MiB		171 Bytes	2023-7-5 16:50:16
AC	RanHao	32ms	6.9 MiB		210 Bytes	2023-7-26 18:27:44
AC	欧俊阳	32ms	6.9 MiB		206 Bytes	2023-8-9 14:39:27
AC	李廷旭 (litingxu)	32ms	7.1 MiB		294 Bytes	2023-7-14 11:49:17
AC	杨颂恩 (yangsongen)	32ms	6.9 MiB		261 Bytes	2023-8-19 19:20:56
AC	陈风亦 (chenfengyi)	32ms	440 KiB		186 Bytes	2023-1-18 16:47:50
AC	坤坤荔枝小黑子 (zhonghaotian22006)	32ms	444 KiB		186 Bytes	2022-10-23 16:12:24
AC	郑岐蔚	32ms	432 KiB		208 Bytes	2023-1-26 14:50:56
AC	协信校区-田煜帆 (tianyufan23010)	33ms	6.9 MiB		197 Bytes	2023-8-18 17:22:35
AC	代尚函笛卡尔 (daishanghan)	33ms	6.9 MiB		212 Bytes	2023-8-10 16:52:41
AC	colin1112 (墙凌可)	34ms	6.7 MiB		231 Bytes	2023-9-8 18:22:58
AC	彭子彦	34ms	7 MiB		240 Bytes	2024-1-20 10:43:53
AC	三差学生(尘埃蓝莓) (白佳睿)	34ms	7.1 MiB		183 Bytes	2023-7-11 10:22:15
AC	曹埊睿 (caodirui)	34ms	512 KiB		166 Bytes	2023-4-15 13:26:21
AC	叶雨昊 (yeyuhao22006)	35ms	512 KiB		210 Bytes	2022-10-24 19:55:34
AC	王晨志 (wangchenzhi)	35ms	428 KiB		411 Bytes	2022-9-3 17:56:25
AC	蒲梓勋 (puzixun)	36ms	512 KiB		125 Bytes	2022-10-11 23:29:16
AC	坤坤荔枝小黑子 (zhonghaotian22006)	37ms	7 MiB		199 Bytes	2023-12-19 19:29:23
AC	wanghuaiying	39ms	7.1 MiB		190 Bytes	2024-1-18 20:24:39
AC	zyl	40ms	7.2 MiB		125 Bytes	2024-1-7 11:01:53
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	40ms	7.3 MiB		239 Bytes	2024-1-20 15:37:52
AC	拥抱幸福小熊(吴沛篪)	47ms	7 MiB		237 Bytes	2024-1-20 14:57:52
AC	Nico	48ms	7.3 MiB		249 Bytes	2023-12-31 15:36:33
AC	Guest	50ms	7.1 MiB		202 Bytes	2024-1-20 15:50:49
AC	田开蕊	58ms	7.1 MiB		188 Bytes	2024-1-20 15:48:11
AC	Jose (反恐皮蛋)	125ms	764 KiB		244 Bytes	2024-3-17 14:09:18
AC	邱越	130ms	764 KiB		227 Bytes	2024-2-6 14:26:28
AC	yuchenyi23017	131ms	540 KiB		194 Bytes	2024-1-28 15:32:48
AC	Him神	131ms	764 KiB		281 Bytes	2024-3-4 14:50:06
AC	22029-zjs	134ms	768 KiB		243 Bytes	2024-3-3 8:56:01
AC	你个你怎么跟个一样 (钟卓劭)	134ms	764 KiB		209 Bytes	2024-4-4 13:38:00
AC	jdy	135ms	764 KiB		238 Bytes	2024-3-6 16:47:45
AC	赵奕铭	137ms	776 KiB		178 Bytes	2024-3-8 23:58:15
AC	褚博艺	142ms	764 KiB		192 Bytes	2024-3-30 16:17:06
AC	无尽的想象 (谭仕高)	142ms	548 KiB	C++11	181 Bytes	2025-1-11 20:47:09
AC	你个你怎么跟个一样 (钟卓劭)	143ms	764 KiB		340 Bytes	2024-3-20 14:41:55
AC	xsm邹家民	147ms	764 KiB	C++98(O2)	178 Bytes	2025-1-11 20:48:07
AC	赵耘毅	148ms	768 KiB	C++98	196 Bytes	2025-1-11 20:39:12
AC	kongql	378ms	8.9 MiB	Python 3	122 Bytes	2023-7-23 15:46:36
AC	梨冻亿 (wiueh)	443ms	3.9 MiB	Python 3	63 Bytes	2022-1-23 18:49:04
AC	汪致卉 (wangzh)	446ms	4 MiB	Python 3	53 Bytes	2022-4-22 16:31:13
AC	谭红中 (不知道)	447ms	3.9 MiB	Python 3	51 Bytes	2022-4-17 13:25:31
AC	王文林	449ms	3.9 MiB	Python 3	89 Bytes	2022-2-11 18:59:11