替换字母

状态	递交者	时间	内存	语言	代码	递交时间
AC	黄彦熹 (AK-203)	28ms	512 KiB		272 Bytes	2023-2-26 19:50:58
AC	刘政君 (lzj)	28ms	512 KiB		279 Bytes	2022-9-14 21:30:55
AC	缥 (王硕2012)	28ms	392 KiB		244 Bytes	2023-3-13 20:02:32
AC	luosifu22006	28ms	440 KiB		196 Bytes	2022-8-19 17:51:17
AC	时代一校林星宇 (lxy)	29ms	512 KiB		212 Bytes	2022-10-29 21:30:32
AC	林靖明	29ms	424 KiB		246 Bytes	2023-1-30 20:21:02
AC	曾御城（现用名） (Jason)	29ms	424 KiB		310 Bytes	2022-3-20 17:56:03
AC	zhangheyi22006	29ms	512 KiB		205 Bytes	2022-8-14 17:27:45
AC	谢雨贝	29ms	396 KiB		467 Bytes	2023-5-18 19:29:39
AC	姚宏逸	29ms	432 KiB		270 Bytes	2022-2-24 20:03:29
AC	王义苇 (wangyiwei)	29ms	392 KiB		224 Bytes	2023-3-12 14:46:41
AC	任童(rentong)	29ms	440 KiB		302 Bytes	2022-8-17 21:36:14
AC	zhanghaoran	29ms	432 KiB		199 Bytes	2022-3-12 10:28:55
AC	xuniaoyin (徐袅音)	29ms	384 KiB		230 Bytes	2023-3-12 14:41:06
AC	sb (吴振宇)	29ms	440 KiB		242 Bytes	2023-5-13 16:11:29
AC	wangjun	29ms	6.7 MiB		267 Bytes	2023-11-15 14:25:15
AC	SYH.邵允涵 (Zoe邵)	29ms	6.7 MiB		224 Bytes	2023-3-17 20:28:29
AC	谭懿轩 (yanyixuan)	29ms	444 KiB		213 Bytes	2022-2-19 10:29:45
AC	wangruibo20xh	29ms	428 KiB		207 Bytes	2022-2-11 14:03:40
AC	汤杰尧 (05c05-tjy1)	29ms	392 KiB		211 Bytes	2022-11-4 22:25:54
AC	86想要钱 (twt)	29ms	392 KiB		257 Bytes	2022-12-4 18:15:40
AC	黄梓桐 (HuangZiTong)	29ms	512 KiB		206 Bytes	2022-8-29 10:01:52
AC	PP (彭锦华)	29ms	7 MiB	C++98(O2)	238 Bytes	2024-6-6 19:35:26
AC	陈泰羽 (chentaiyu)	29ms	384 KiB		227 Bytes	2023-3-31 18:52:09
AC	李卓燃 (李卓燃1)	29ms	392 KiB		253 Bytes	2023-3-31 18:52:57
AC	Error404sans (焦阳浩云)	29ms	7.2 MiB		232 Bytes	2023-6-18 14:50:16
AC	马渝杭 (mayuhang)	29ms	444 KiB		254 Bytes	2023-2-25 20:09:13
AC	zry	29ms	496 KiB		214 Bytes	2022-11-6 10:04:00
AC	CK (李弘毅)	29ms	384 KiB		248 Bytes	2023-3-15 14:39:26
AC	iLansensei (hjs(Caster))	29ms	444 KiB		296 Bytes	2022-11-6 10:39:11
AC	陈杰晟	29ms	512 KiB		249 Bytes	2022-2-13 12:30:35
AC	Z.饮月君 (张皓南)	29ms	444 KiB		271 Bytes	2022-8-25 22:19:45
AC	kim	29ms	384 KiB		248 Bytes	2023-4-19 18:13:40
AC	ttt123	30ms	512 KiB		309 Bytes	2022-12-31 10:36:53
AC	xflt_dyp	30ms	384 KiB		242 Bytes	2022-9-28 18:10:20
AC	kim	30ms	512 KiB		248 Bytes	2023-4-19 18:13:27
AC	朱老师 (zyp)	30ms	512 KiB		228 Bytes	2022-7-31 16:21:45
AC	贺睿林	30ms	6.7 MiB		436 Bytes	2023-6-4 11:45:27
AC	任舒尧	30ms	412 KiB		252 Bytes	2022-9-30 18:37:29
AC	xflt_dyp	30ms	384 KiB		310 Bytes	2022-9-28 18:09:08
AC	文硕 (文硕1)	30ms	512 KiB		244 Bytes	2022-7-12 11:58:21
AC	时代校区-刘臣原 (微笑王子)	30ms	436 KiB		273 Bytes	2022-9-7 18:51:07
AC	杨宇航1	30ms	384 KiB		202 Bytes	2023-3-12 14:53:57
AC	11451254188 (22029-mjh)	30ms	512 KiB		332 Bytes	2022-12-28 19:59:30
AC	王晨志 (wangchenzhi)	30ms	512 KiB		445 Bytes	2022-9-3 17:47:54
AC	kim	30ms	384 KiB		248 Bytes	2023-4-19 18:13:41
AC	22029-zjs	30ms	384 KiB		240 Bytes	2022-12-31 10:37:28
AC	zhangzhimo	30ms	440 KiB		348 Bytes	2022-12-3 15:59:58
AC	kim	30ms	392 KiB		248 Bytes	2023-4-19 18:13:39
AC	蒲梓勋 (puzixun)	30ms	384 KiB		297 Bytes	2022-10-18 21:11:55
AC	爱琴海校区-刁钲洋 (刁钲洋)	30ms	392 KiB		271 Bytes	2023-3-12 14:43:10
AC	林凡童 (lft)	30ms	436 KiB		264 Bytes	2022-9-15 20:10:25
AC	22029-lsl	30ms	384 KiB		215 Bytes	2022-12-31 10:36:50
AC	kim	30ms	512 KiB		248 Bytes	2023-4-19 18:13:38
AC	wangzihang	30ms	6.9 MiB		356 Bytes	2023-4-1 18:17:53
AC	jinitaimei	30ms	432 KiB		199 Bytes	2022-12-4 18:07:03
AC	Tender. (05c05-zhou)	30ms	512 KiB		297 Bytes	2022-10-19 21:59:23
AC	无尽的想象 (谭仕高)	30ms	512 KiB		265 Bytes	2022-9-1 14:07:51
AC	许峻浩	30ms	392 KiB		212 Bytes	2023-3-12 15:02:51
AC	(张洛诚)	31ms	392 KiB		317 Bytes	2023-5-4 20:24:21
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	31ms	512 KiB		218 Bytes	2022-12-3 17:28:24
AC	金沙—彭智宸 (彭智宸)	31ms	6.7 MiB		210 Bytes	2023-6-4 10:33:28
AC	chenyantong	31ms	384 KiB		227 Bytes	2023-3-31 18:55:12
AC	史韵哲	31ms	6.5 MiB		210 Bytes	2023-6-4 10:05:35
AC	kim	31ms	512 KiB		248 Bytes	2023-4-19 18:13:40
AC	时代一校-曾科智 (曾科智)	31ms	512 KiB		294 Bytes	2022-9-10 20:40:28
AC	ycy	31ms	384 KiB		293 Bytes	2022-12-10 22:12:55
AC	kim	31ms	392 KiB		248 Bytes	2023-4-19 18:13:40
AC	赵沛喆	31ms	512 KiB		242 Bytes	2022-10-23 11:13:16
AC	22029-lyh	31ms	392 KiB		316 Bytes	2022-12-24 11:29:10
AC	https://www.minecraft.net/zh-hans (王振西)	31ms	6.9 MiB		248 Bytes	2023-6-18 14:33:08
AC	ttt123	31ms	512 KiB		265 Bytes	2022-12-30 14:53:48
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)	32ms	392 KiB		316 Bytes	2022-12-24 9:28:13
AC	时代一校-王宥量 (wangyouliang)	32ms	436 KiB		241 Bytes	2022-12-4 11:03:23
AC	马兴宇 (mxy01)	32ms	436 KiB		236 Bytes	2022-11-5 17:08:36
AC	周琪渃	32ms	384 KiB		293 Bytes	2022-12-10 22:15:03
AC	爱琴海校区-黄辰浩 (huangchenhao)	32ms	436 KiB		200 Bytes	2023-3-12 14:38:33
AC	kim	32ms	408 KiB		248 Bytes	2023-4-19 18:13:40
AC	孙烽轶 (sfy)	32ms	512 KiB		172 Bytes	2023-4-15 17:24:00
AC	乐瀚阳 (yuehanyang)	32ms	436 KiB		183 Bytes	2023-4-18 21:30:25
AC	欧俊阳	32ms	6.7 MiB		213 Bytes	2023-8-25 13:30:35
AC	朱老师 (zyp)	32ms	6.8 MiB		244 Bytes	2023-6-16 14:01:40
AC	ycy	33ms	432 KiB		242 Bytes	2022-10-27 13:53:23
AC	RanHao	33ms	6.9 MiB		223 Bytes	2023-8-2 10:40:20
AC	昌文迪 (05c05-cwd2)	33ms	436 KiB		221 Bytes	2022-11-4 21:31:08
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	33ms	440 KiB		220 Bytes	2022-12-24 11:12:32
AC	无尽的想象 (谭仕高)	33ms	444 KiB		238 Bytes	2023-5-18 19:26:37
AC	陈家齐 (陈家齐1)	34ms	7.1 MiB		225 Bytes	2023-7-6 9:53:12
AC	罗翌珂 (dangdang)	34ms	432 KiB		358 Bytes	2022-8-30 13:19:34
AC	胡程禹	34ms	6.9 MiB		306 Bytes	2023-7-7 10:08:48
AC	无尽的想象 (谭仕高)	34ms	444 KiB		203 Bytes	2022-8-30 14:57:25
AC	陈佳婧	34ms	512 KiB		243 Bytes	2022-9-30 18:28:28
AC	明哲瀚 (18580067605)	35ms	512 KiB		291 Bytes	2023-3-14 21:39:23
AC	zcx	36ms	512 KiB		307 Bytes	2022-12-30 19:39:56
AC	chenxiyu	41ms	512 KiB		279 Bytes	2023-4-15 17:13:08
AC	yuchenyi23017	125ms	536 KiB		227 Bytes	2024-1-28 15:34:55
AC	My name is Man (钟卓劭)	130ms	764 KiB		233 Bytes	2024-3-20 15:54:47
AC	赵奕铭	131ms	536 KiB		218 Bytes	2024-3-10 20:30:46
AC	jdy	131ms	768 KiB		244 Bytes	2024-3-6 15:25:26
AC	¿¿¿??? (李睿瞳)	132ms	764 KiB		238 Bytes	2024-2-3 15:34:43