过滤空格2

状态	递交者	时间	内存	语言	代码	递交时间
AC	黄相茗	13ms	384 KiB		291 Bytes	2022-4-6 21:39:15
AC	文硕 (文硕1)	13ms	384 KiB		430 Bytes	2022-2-6 14:10:16
AC	疯神芭芭脱丝 (李卓修)	14ms	384 KiB		271 Bytes	2022-6-12 19:19:09
AC	赵泳鑫 (zhaoyongxin)	14ms	284 KiB		291 Bytes	2022-4-6 19:14:21
AC	zyl	16ms	7.1 MiB		132 Bytes	2024-1-7 11:01:19
AC	Zongzi1	24ms	6.9 MiB	C++17(O2)	339 Bytes	2024-8-15 20:55:06
AC	Zongzi1	24ms	6.9 MiB	C++17(O2)	339 Bytes	2024-8-15 20:55:50
AC	吴俊成 (wujuncheng)	25ms	392 KiB		342 Bytes	2022-7-11 11:33:05
AC	李树崑 (lishukun)	25ms	384 KiB		349 Bytes	2022-8-3 18:06:47
AC	赵沛喆	25ms	384 KiB		341 Bytes	2022-5-15 10:29:09
AC	zlx (xiao)	25ms	392 KiB		290 Bytes	2022-6-5 18:55:27
AC	Zongzi1	25ms	6.9 MiB	C++17(O2)	500 Bytes	2024-8-15 22:28:10
AC	徐子恩 (Cow)	25ms	396 KiB		280 Bytes	2022-6-5 19:23:45
AC	iLansensei (hjs(Caster))	25ms	420 KiB		243 Bytes	2022-6-15 16:39:28
AC	苏承泽	25ms	6.5 MiB	C++98(O2)	288 Bytes	2024-7-30 18:57:44
AC	杨颂恩 (yangsongen)	25ms	6.6 MiB	C++11	335 Bytes	2024-7-27 18:02:51
AC	ywh	25ms	384 KiB		287 Bytes	2022-5-28 9:34:52
AC	陈祖明	25ms	384 KiB		222 Bytes	2022-5-14 15:47:15
AC	徐伟宸 (徐伟宸1)	25ms	6.8 MiB	C++11	273 Bytes	2024-7-2 16:03:52
AC	任童(rentong)	26ms	384 KiB		332 Bytes	2022-5-14 15:48:44
AC	zhangyh (张育菡)	26ms	392 KiB		258 Bytes	2022-6-13 22:14:12
AC	11111	26ms	512 KiB		392 Bytes	2022-5-22 10:35:59
AC	杜俊宏	26ms	384 KiB		337 Bytes	2022-4-11 19:32:54
AC	_PXY_	26ms	388 KiB		276 Bytes	2022-1-23 11:57:44
AC	liusihan	26ms	384 KiB		291 Bytes	2022-6-5 16:07:39
AC	李倾城的忠实假粉 (向熠可)	26ms	388 KiB		392 Bytes	2022-3-27 14:38:16
AC	陈祖明	26ms	392 KiB		212 Bytes	2022-5-14 15:47:02
AC	Accepted (周芷乐)	26ms	6.7 MiB	C++14	156 Bytes	2024-7-20 12:38:41
AC	zcx	26ms	384 KiB		205 Bytes	2023-5-18 19:16:33
AC	wangzihang	26ms	6.5 MiB	C++98	772 Bytes	2024-7-5 14:33:20
AC	Zongzi1	26ms	6.5 MiB	C++17(O2)	334 Bytes	2024-7-21 18:58:06
AC	longhao	26ms	392 KiB		479 Bytes	2022-1-28 9:31:07
AC	张瑞博	26ms	6.9 MiB	C++11	253 Bytes	2024-6-22 23:29:55
AC	朱泓屹 (ZYH)	26ms	384 KiB		186 Bytes	2022-6-5 19:27:18
AC	段淏泷	26ms	7.2 MiB	C++98	237 Bytes	2024-5-9 21:22:27
AC	疯神芭芭脱丝 (李卓修)	26ms	384 KiB		368 Bytes	2023-4-16 19:48:51
AC	许梓宸 (xuzichen)	26ms	6.7 MiB	C++17(O2)	248 Bytes	2024-7-17 16:54:57
AC	CMG	26ms	384 KiB		197 Bytes	2022-6-5 19:25:52
AC	何煜琦	27ms	6.8 MiB	C++11	168 Bytes	2024-8-3 16:42:59
AC	lby_joey	27ms	6.5 MiB	C++98(O2)	268 Bytes	2024-7-24 10:06:00
AC	XYZ303	27ms	384 KiB		218 Bytes	2022-6-5 19:07:11
AC	张祖名	27ms	6.9 MiB	C++98(O2)	261 Bytes	2024-8-23 12:40:29
AC	杨瀚霖 (yanghanlin)	27ms	640 KiB		275 Bytes	2023-3-4 11:19:33
AC	miku (阳沐珊)	27ms	384 KiB		381 Bytes	2023-5-6 18:53:15
AC	22029-lsl	27ms	384 KiB		158 Bytes	2023-5-18 19:18:55
AC	枉哲锐	27ms	384 KiB		440 Bytes	2022-1-26 20:10:01
AC	七叶寂照秘密主 (mohaoran)	27ms	408 KiB		292 Bytes	2022-9-16 22:05:06
AC	张玉坚 (zhangyuian)	27ms	384 KiB		304 Bytes	2022-6-5 16:08:38
AC	lch (凌昌瀚)	27ms	436 KiB		297 Bytes	2022-7-6 22:19:49
AC	xmw318046	27ms	6.6 MiB	C++98	235 Bytes	2024-7-7 17:33:29
AC	芒苒忧 (廖迦南)	27ms	512 KiB		306 Bytes	2022-8-3 15:11:19
AC	偽艺術家 (chenyanchi22006)	27ms	512 KiB		197 Bytes	2022-8-22 23:30:39
AC	17779	27ms	436 KiB		262 Bytes	2022-4-24 15:31:43
AC	朱老师 (zyp)	27ms	444 KiB		214 Bytes	2022-8-18 18:17:20
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	27ms	392 KiB		426 Bytes	2023-4-18 21:41:32
AC	luoluonuoya	27ms	512 KiB		288 Bytes	2022-8-17 13:17:10
AC	肖添宇	28ms	448 KiB		295 Bytes	2022-4-16 20:13:19
AC	三藏的痔疮 (不会玩是原罪)	28ms	388 KiB		232 Bytes	2022-1-23 11:40:41
AC	韩正墨 (xmw05)	28ms	440 KiB		201 Bytes	2022-7-13 10:05:48
AC	朱泽晟	28ms	436 KiB		345 Bytes	2022-8-31 16:53:03
AC	l;k (陈彬宾)	28ms	492 KiB		246 Bytes	2022-6-5 19:30:16
AC	姚宏逸	28ms	512 KiB		345 Bytes	2022-3-21 9:21:25
AC	chenyantong	28ms	384 KiB		234 Bytes	2023-3-31 19:05:11
AC	草\|\|草 (陈星佑)	28ms	384 KiB		215 Bytes	2022-8-21 15:42:07
AC	何晟瑞 (hsr01)	28ms	448 KiB		122 Bytes	2022-6-9 21:19:34
AC	胡宸华 (huchenhua)	28ms	6.9 MiB		283 Bytes	2023-8-20 22:53:21
AC	My name is Man (钟卓劭)	28ms	6.8 MiB	C++98	195 Bytes	2024-8-9 15:05:02
AC	scallway	28ms	416 KiB		218 Bytes	2023-5-27 11:08:19
AC	Tang	28ms	436 KiB		641 Bytes	2022-4-23 15:31:56
AC	微风将至 (李睿轩)	28ms	384 KiB		209 Bytes	2022-6-5 19:29:12
AC	胡澜之 (666hlz666)	28ms	384 KiB		304 Bytes	2023-5-25 18:32:57
AC	南坪校区-邵冠铖 (邵冠铖)	28ms	384 KiB		224 Bytes	2023-5-18 19:19:22
AC	新壹街校区-周士杰 (zsj)	28ms	7 MiB		283 Bytes	2023-7-16 14:44:40
AC	朱老师 (zyp)	28ms	384 KiB		130 Bytes	2023-5-18 19:18:50
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	28ms	512 KiB		199 Bytes	2022-8-1 13:43:27
AC	huyinuo	28ms	436 KiB		465 Bytes	2022-5-2 13:46:12
AC	xyc (谢雨宸)	28ms	6.7 MiB		195 Bytes	2023-9-27 20:20:30
AC	罗晨睿 (luochenrui)	28ms	512 KiB		323 Bytes	2022-6-29 14:25:57
AC	SYC0226	28ms	520 KiB		366 Bytes	2022-4-10 10:46:15
AC	李卓燃 (李卓燃1)	28ms	384 KiB		279 Bytes	2023-3-31 19:00:57
AC	HIMMZXC	28ms	512 KiB		295 Bytes	2022-3-5 15:01:02
AC	陈泰羽 (chentaiyu)	28ms	392 KiB		279 Bytes	2023-3-31 19:02:33
AC	11451254188 (22029-mjh)	29ms	436 KiB		224 Bytes	2023-5-18 19:15:47
AC	chenyantong	29ms	392 KiB		234 Bytes	2023-3-31 19:05:14
AC	孙烽轶 (sfy)	29ms	6.8 MiB	C++98	196 Bytes	2024-8-12 16:41:56
AC	爱琴海校区-刁钲洋 (刁钲洋)	29ms	512 KiB		298 Bytes	2023-2-15 16:59:25
AC	chenyantong	29ms	444 KiB		234 Bytes	2023-3-31 19:05:15
AC	詹宇航 (zyh7)	29ms	424 KiB		269 Bytes	2022-7-8 18:08:10
AC	葛琮扬	29ms	6.9 MiB		274 Bytes	2023-7-21 12:20:31
AC	任舒尧	29ms	384 KiB		324 Bytes	2022-9-23 19:03:30
AC	陈杰晟	29ms	512 KiB		220 Bytes	2022-2-22 14:04:00
AC	在煎鱼的肖大总铳 (肖宇航)	29ms	6.8 MiB		213 Bytes	2023-9-24 11:24:51
AC	zhengjiaxiang	29ms	392 KiB		301 Bytes	2023-3-31 19:05:20
AC	谭懿轩 (yanyixuan)	29ms	512 KiB		210 Bytes	2022-2-19 10:23:49
AC	魑归sama	29ms	512 KiB		269 Bytes	2022-7-12 16:48:04
AC	chenyantong	29ms	384 KiB		234 Bytes	2023-3-31 19:05:14
AC	SB (mfy01)	29ms	384 KiB		257 Bytes	2023-2-3 17:53:36
AC	罗翌珂 (dangdang)	29ms	492 KiB		470 Bytes	2022-8-13 12:58:33
AC	曹埊睿 (caodirui)	29ms	436 KiB		232 Bytes	2023-4-27 18:02:56
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)	29ms	384 KiB		126 Bytes	2023-5-18 19:22:55