字符变换

状态	递交者	时间	内存	语言	代码	递交时间
AC	新壹街校区-杨轩懿 (杨轩懿1)	-	7.2 MiB		261 Bytes	2023-12-30 12:22:51
AC	MoonLight ( aaa)	1ms	256 KiB		338 Bytes	2022-1-22 9:53:07
AC	xiangsiyu	2ms	384 KiB		560 Bytes	2022-7-2 16:12:59
AC	zcx	2ms	384 KiB		316 Bytes	2023-2-17 19:51:39
AC	kim	2ms	384 KiB		268 Bytes	2023-3-4 12:56:04
AC	赵泳鑫 (zhaoyongxin)	2ms	384 KiB		266 Bytes	2022-5-14 17:59:28
AC	kim	2ms	384 KiB		268 Bytes	2023-3-4 12:56:09
AC	李树崑 (lishukun)	2ms	372 KiB		232 Bytes	2022-4-30 13:40:12
AC	中岛敦 (黄麒瑞)	2ms	6.8 MiB		368 Bytes	2023-10-15 10:38:01
AC	杜俊宏	2ms	384 KiB		273 Bytes	2022-3-26 17:06:51
AC	17779	2ms	384 KiB		241 Bytes	2022-4-4 17:16:48
AC	肖添宇	2ms	384 KiB		336 Bytes	2022-5-14 16:55:38
AC	陈于硕(我™的) (chenyu)	2ms	384 KiB		526 Bytes	2023-4-8 14:56:55
AC	魑归sama	2ms	384 KiB		226 Bytes	2022-7-12 16:47:15
AC	新壹街+黄路+江宇轩 (江宇轩)	2ms	6.9 MiB	C++98	235 Bytes	2024-5-23 21:08:52
AC	xuniaoyin (徐袅音)	2ms	384 KiB		261 Bytes	2023-2-15 19:54:27
AC	lch (凌昌瀚)	2ms	436 KiB		229 Bytes	2022-7-5 18:39:48
AC	RanHao	2ms	6.7 MiB		247 Bytes	2023-7-26 13:24:09
AC	小忙果 (王昱杰)	2ms	7 MiB		229 Bytes	2023-7-18 9:04:22
AC	kim	2ms	384 KiB		268 Bytes	2023-3-4 12:56:15
AC	stehpen_zuo	2ms	6.6 MiB	C++20	288 Bytes	2024-7-7 14:02:57
AC	时代二校-陈天成 (鸭缩毛巾)	2ms	408 KiB		600 Bytes	2023-5-27 16:53:57
AC	经常消失 (小萝卜)	2ms	384 KiB		277 Bytes	2022-4-4 13:39:22
AC	22029-hqh	2ms	384 KiB		257 Bytes	2023-3-4 21:09:18
AC	NJL (NJlL)	2ms	392 KiB		255 Bytes	2022-2-27 19:34:47
AC	姚宏逸	2ms	384 KiB		241 Bytes	2022-6-1 21:56:24
AC	kim	2ms	384 KiB		268 Bytes	2023-3-4 12:56:12
AC	wangxingyue	2ms	384 KiB		306 Bytes	2022-3-26 17:51:57
AC	kim	2ms	384 KiB		268 Bytes	2023-3-4 12:56:07
AC	kim	2ms	384 KiB		268 Bytes	2023-3-4 12:56:11
AC	kim	2ms	384 KiB		268 Bytes	2023-3-4 12:56:02
AC	在煎鱼的肖大总铳 (肖宇航)	2ms	6.8 MiB		252 Bytes	2023-9-24 11:23:49
AC	bvvd	2ms	7 MiB	C++98	314 Bytes	2024-6-14 15:46:37
AC	stehpen_zuo	2ms	6.6 MiB	C++20	374 Bytes	2024-7-7 13:59:38
AC	冒牌陈杰晟【MOD】 (wed)	2ms	392 KiB		560 Bytes	2022-2-27 19:23:43
AC	stehpen_zuo	2ms	6.6 MiB	C++20	418 Bytes	2024-7-7 13:54:24
AC	罗翌珂 (dangdang)	2ms	440 KiB		306 Bytes	2022-8-31 13:24:12
AC	Yuan (Zongzi1)	2ms	6.6 MiB	C++17(O2)	298 Bytes	2024-7-20 19:58:32
AC	疯神芭芭脱丝 (李卓修)	2ms	392 KiB		333 Bytes	2022-4-17 17:59:17
AC	爱琴海校区-黄辰浩 (huangchenhao)	2ms	432 KiB		236 Bytes	2023-2-12 15:53:04
AC	我是个s* (lijinze)	3ms	6.8 MiB		269 Bytes	2023-7-18 22:08:03
AC	张瑞博	3ms	7 MiB	C++11	230 Bytes	2024-6-9 21:42:37
AC	新壹街校区-周士杰 (zsj)	3ms	412 KiB		272 Bytes	2022-2-27 19:26:39
AC	樊竣熠 (lft1114)	3ms	436 KiB		261 Bytes	2022-8-3 13:36:37
AC	我谢谢你全家	3ms	436 KiB		560 Bytes	2022-2-27 19:25:14
AC	qinyi	3ms	384 KiB		277 Bytes	2022-2-26 15:29:04
AC	kim	3ms	384 KiB		268 Bytes	2023-3-4 12:55:52
AC	王晨志 (wangchenzhi)	3ms	440 KiB		353 Bytes	2022-6-19 13:00:29
AC	李山水	3ms	420 KiB		582 Bytes	2022-7-29 16:10:35
AC	56 (13883454928)	3ms	384 KiB		256 Bytes	2022-3-5 16:14:37
AC	冒牌陈杰晟【MOD】 (wed)	3ms	384 KiB		560 Bytes	2022-2-27 19:19:44
AC	kim	3ms	384 KiB		268 Bytes	2023-3-4 12:55:51
AC	孙烽轶 (sfy)	3ms	6.9 MiB		232 Bytes	2023-7-9 9:49:34
AC	luoluonuoya	3ms	384 KiB		388 Bytes	2022-3-16 18:39:57
AC	谢博文	3ms	384 KiB		334 Bytes	2022-2-13 11:18:14
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	3ms	6.7 MiB		271 Bytes	2023-8-26 12:57:52
AC	时代2校-程俊燃 (chengjunran)	3ms	6.7 MiB		302 Bytes	2023-8-25 9:21:21
AC	xmw318046	3ms	6.4 MiB	C++98	250 Bytes	2024-7-5 18:22:53
AC	黄彦熹 (AK-203)	3ms	448 KiB		325 Bytes	2023-2-26 19:39:29
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	3ms	436 KiB		329 Bytes	2022-3-5 16:03:06
AC	kim	3ms	384 KiB		268 Bytes	2023-3-4 12:55:56
AC	谭懿轩 (yanyixuan)	3ms	384 KiB		291 Bytes	2022-2-19 10:16:04
AC	文硕 (文硕1)	3ms	432 KiB		266 Bytes	2022-7-12 11:52:38
AC	王韵淮	3ms	512 KiB		224 Bytes	2022-5-20 21:45:27
AC	ywh	3ms	440 KiB		334 Bytes	2022-2-13 11:13:44
AC	kim	3ms	392 KiB		268 Bytes	2023-3-4 12:56:13
AC	我推的乱破 (贺俊楠)	3ms	392 KiB		348 Bytes	2023-5-21 13:49:32
AC	朱老师 (zyp)	3ms	392 KiB		247 Bytes	2023-2-16 18:32:38
AC	高致远 (GZY)	3ms	384 KiB		237 Bytes	2022-2-13 11:14:04
AC	zhangheyi22006	3ms	384 KiB		237 Bytes	2023-2-15 19:26:17
AC	缥 (王硕2012)	3ms	384 KiB		434 Bytes	2023-2-17 19:37:23
AC	CK (李弘毅)	3ms	440 KiB		304 Bytes	2022-11-22 11:21:36
AC	吴俊成 (wujuncheng)	3ms	440 KiB		200 Bytes	2022-7-11 11:23:54
AC	王义苇 (wangyiwei)	3ms	364 KiB		246 Bytes	2023-2-13 20:39:40
AC	朱老师 (zyp)	3ms	440 KiB		238 Bytes	2022-8-16 18:08:55
AC	陈杰晟	3ms	440 KiB		240 Bytes	2022-5-29 11:09:55
AC	hyh22031	3ms	384 KiB		203 Bytes	2023-1-9 17:35:27
AC	蒲梓勋 (puzixun)	3ms	432 KiB		302 Bytes	2022-9-11 9:36:38
AC	任童(rentong)	3ms	432 KiB		313 Bytes	2022-7-2 15:07:08
AC	HIMMZXC	3ms	384 KiB		543 Bytes	2022-3-5 14:22:32
AC	林小博	3ms	384 KiB		336 Bytes	2023-2-1 16:51:52
AC	SYC0226	3ms	384 KiB		238 Bytes	2022-3-20 14:32:57
AC	kim	3ms	384 KiB		268 Bytes	2023-3-4 12:55:54
AC	11451254188 (22029-mjh)	3ms	428 KiB		306 Bytes	2023-2-14 21:33:33
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)	3ms	384 KiB		327 Bytes	2023-2-18 9:03:53
AC	zhm123	3ms	440 KiB		206 Bytes	2023-2-6 18:23:51
AC	陈佳婧	3ms	384 KiB		221 Bytes	2022-10-14 21:14:46
AC	wangruibo20xh	3ms	432 KiB		241 Bytes	2022-2-11 14:00:21
AC	ycy	3ms	412 KiB		265 Bytes	2022-6-29 19:29:01
AC	kim	3ms	384 KiB		268 Bytes	2023-3-4 12:55:47
AC	kim	3ms	384 KiB		268 Bytes	2023-3-4 12:55:58
AC	kim	3ms	384 KiB		268 Bytes	2023-3-4 12:56:00
AC	huanglu	3ms	436 KiB		288 Bytes	2022-9-23 13:36:17
AC	(张洛诚)	3ms	384 KiB		367 Bytes	2023-4-6 20:59:19
AC	ttt123	3ms	436 KiB		302 Bytes	2023-3-4 20:48:47
AC	zlx (xiao)	3ms	432 KiB		260 Bytes	2022-11-26 18:40:34
AC	22029-zjs	3ms	384 KiB		308 Bytes	2023-2-16 18:36:13
AC	kim	3ms	384 KiB		268 Bytes	2023-3-4 12:56:05
AC	胡程禹	3ms	6.6 MiB		283 Bytes	2023-9-13 20:45:51
AC	周琪渃	3ms	6.9 MiB		373 Bytes	2023-7-27 12:47:02