大写转小写

状态	递交者	时间	内存	语言	代码	递交时间
AC	李树崑 (lishukun)	7ms	512 KiB		408 Bytes	2022-11-5 12:30:09
AC	﹢•﹡🕉☽✝⚜Halanfus⚜✝☾⚔⚝﹡﹢• (黄子瑞)	7ms	6.9 MiB	C++98	197 Bytes	2024-8-23 15:34:07
AC	徐正旺 (xzw)	7ms	432 KiB		106 Bytes	2023-2-21 17:57:38
AC	叶雨昊 (yeyuhao22006)	7ms	384 KiB		111 Bytes	2022-10-14 19:10:29
AC	叶哲宇 (yzy)	7ms	6.9 MiB		115 Bytes	2023-8-13 19:28:59
AC	熊俊喆	7ms	6.8 MiB		148 Bytes	2023-10-8 21:32:56
AC	时代二校-陈天成 (鸭缩毛巾)	7ms	384 KiB		120 Bytes	2023-4-1 17:24:29
AC	啊...这 (炼狱杏寿郎)	7ms	436 KiB		174 Bytes	2022-8-12 17:02:43
AC	zyq1	7ms	384 KiB		109 Bytes	2023-3-27 21:23:51
AC	王康瑞	7ms	6.8 MiB		129 Bytes	2023-10-21 9:44:19
AC	陈博昊 (cbh)	7ms	396 KiB		158 Bytes	2023-5-19 19:18:23
AC	hangge	7ms	440 KiB		252 Bytes	2023-5-29 19:04:49
AC	童艺涵	7ms	392 KiB		116 Bytes	2022-12-5 22:02:50
AC	余彦瑞	7ms	436 KiB		145 Bytes	2023-3-5 10:14:21
AC	zhangzhixiong	7ms	392 KiB		146 Bytes	2022-12-4 16:03:40
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:17:00
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:17:02
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:17:02
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:17:00
AC	11451254188 (22029-mjh)	7ms	420 KiB		923 Bytes	2022-11-25 13:58:42
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	7ms	428 KiB		124 Bytes	2022-11-25 11:23:43
AC	陈博昊 (cbh)	7ms	392 KiB		158 Bytes	2023-5-19 19:16:49
AC	刘鹤枫 (liuhefeng)	7ms	392 KiB		196 Bytes	2022-8-7 13:49:44
AC	zhangyouze (张佑泽)	7ms	6.8 MiB		125 Bytes	2023-10-25 22:04:08
AC	lihongyi	7ms	6.7 MiB		126 Bytes	2023-9-12 11:42:38
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)	7ms	444 KiB		107 Bytes	2023-5-16 18:20:06
AC	甄一阳 (22016-zyy)	7ms	436 KiB		126 Bytes	2022-10-30 11:15:58
AC	UsMt1 (jiangyuan)	7ms	6.7 MiB		228 Bytes	2023-9-14 22:08:25
AC	王冉燚默(重庆龙湖U城天街A馆) (wangranyimo)	7ms	7.2 MiB	C++98	103 Bytes	2024-5-6 22:28:20
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:18:19
AC	He Yiqi (和平精英)	7ms	7 MiB		113 Bytes	2023-6-10 20:00:18
AC	杨淇瑞 (杨淇瑞29)	7ms	6.9 MiB		128 Bytes	2023-7-13 12:21:02
AC	05c05-yyc	7ms	440 KiB		125 Bytes	2022-9-2 19:11:20
AC	chuhaorui	7ms	6.8 MiB	C++98(O2)	118 Bytes	2024-8-10 13:39:43
AC	贾博涵	7ms	6.8 MiB		106 Bytes	2023-11-1 12:19:31
AC	赵启程 (赵启程1)	7ms	384 KiB		123 Bytes	2023-3-31 21:58:52
AC	许徐非凡 (非同凡响)	7ms	6.7 MiB		138 Bytes	2023-8-26 16:39:57
AC	tsc_ (杨悦堃)	7ms	384 KiB		119 Bytes	2023-4-9 21:36:54
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:16:50
AC	杨在云 (yangzaiyun001)	7ms	384 KiB		104 Bytes	2022-9-17 17:15:43
AC	许炜铭 (xuweiming)	7ms	6.9 MiB		117 Bytes	2023-7-16 11:38:54
AC	新壹街校区-周士杰 (zsj)	7ms	440 KiB		139 Bytes	2023-2-12 16:42:41
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:18:18
AC	WangXi	7ms	384 KiB		108 Bytes	2022-10-15 18:17:18
AC	在煎鱼的肖大总铳 (肖宇航)	7ms	6.9 MiB		147 Bytes	2023-8-14 21:09:27
AC	wangzihang	7ms	512 KiB		127 Bytes	2022-7-28 10:41:10
AC	丛林 (conglin)	7ms	512 KiB		119 Bytes	2022-12-2 21:37:33
AC	LDE__113 (逯典恩)	7ms	436 KiB		121 Bytes	2022-8-28 18:18:54
AC	章愉霖	7ms	512 KiB		123 Bytes	2023-6-1 10:54:54
AC	冒牌陈杰晟【MOD】 (wed)	7ms	436 KiB		216 Bytes	2022-2-24 19:33:54
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:16:49
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:18:20
AC	sb (吴振宇)	7ms	436 KiB		113 Bytes	2023-1-5 12:55:29
AC	ttt123	7ms	440 KiB		120 Bytes	2023-4-20 13:15:47
AC	陈博昊 (cbh)	7ms	392 KiB		158 Bytes	2023-5-19 19:18:24
AC	stehpen_zuo	7ms	7.2 MiB	C++20	133 Bytes	2024-5-17 18:14:13
AC	K517	7ms	7.1 MiB		122 Bytes	2023-12-3 15:23:09
AC	江政含	7ms	6.9 MiB		142 Bytes	2023-7-6 19:38:35
AC	新壹街校区-陈峻熙 (陈峻熙)	7ms	7.3 MiB		125 Bytes	2023-10-28 11:30:53
AC	源著校区-宋昊成 (马冬梅)	7ms	512 KiB		124 Bytes	2023-2-25 17:03:43
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:16:49
AC	yxj	7ms	448 KiB		117 Bytes	2022-10-20 14:50:28
AC	张梓轩 (zhangzixuan)	7ms	7.1 MiB		130 Bytes	2022-2-19 9:45:03
AC	陈博昊 (cbh)	7ms	384 KiB		158 Bytes	2023-5-19 19:16:49
AC	孟子轩 (km老冯)	7ms	384 KiB		138 Bytes	2022-4-28 18:52:43
AC	金沙校区-王俊元 (王俊元)	7ms	6.7 MiB		121 Bytes	2023-9-16 22:26:50
AC	张睎宇	7ms	7.3 MiB		154 Bytes	2024-1-24 10:55:31
AC	赵奕铭	7ms	7.2 MiB		125 Bytes	2023-12-30 18:19:01
AC	何昊宇 (22016-hhy)	7ms	7.1 MiB		121 Bytes	2023-12-3 11:18:15
AC	yl123	7ms	7 MiB	C++11	119 Bytes	2024-6-21 17:05:17
AC	明哲瀚 (18580067605)	7ms	392 KiB		118 Bytes	2022-10-15 18:10:56
AC	伍芷函	8ms	440 KiB		125 Bytes	2022-8-30 15:03:31
AC	U城校区-董思羽 (董思羽)	8ms	6.7 MiB		149 Bytes	2023-9-3 21:47:06
AC	陈博昊 (cbh)	8ms	384 KiB		158 Bytes	2023-5-19 19:18:19
AC	无尽的想象 (谭仕高)	8ms	6.9 MiB		785 Bytes	2023-7-6 19:37:00
AC	美术猫映画 (mkh)	8ms	6.9 MiB		104 Bytes	2023-7-18 19:11:08
AC	yangbinyu	8ms	440 KiB		255 Bytes	2022-10-16 11:57:12
AC	Dell	8ms	7.1 MiB		111 Bytes	2023-12-3 15:19:18
AC	稻妻第一深情 (喝酒の吟游诗人)	8ms	432 KiB		1.2 KiB	2023-1-10 10:49:33
AC	陈博昊 (cbh)	8ms	384 KiB		158 Bytes	2023-5-19 19:16:49
AC	邹曜丞 (13983097018)	8ms	512 KiB		107 Bytes	2023-4-15 19:43:17
AC	陈博昊 (cbh)	8ms	512 KiB		158 Bytes	2023-5-19 19:17:00
AC	马渝杭 (mayuhang)	8ms	440 KiB		109 Bytes	2023-3-21 19:37:44
AC	三差学生 (尘埃蓝莓)	8ms	6.9 MiB		101 Bytes	2023-7-8 11:54:24
AC	贾鑫豪 (Mr Sam)	8ms	428 KiB		157 Bytes	2022-8-24 12:48:05
AC	黄歆恬 (teresac)	8ms	424 KiB		126 Bytes	2022-8-11 9:30:38
AC	dengduxi	8ms	384 KiB		128 Bytes	2022-11-27 11:48:10
AC	王重道	8ms	440 KiB		127 Bytes	2023-6-1 20:21:06
AC	zhangjiani	8ms	440 KiB		111 Bytes	2023-3-29 20:53:37
AC	XMW22024LXN	8ms	7.1 MiB		121 Bytes	2023-12-3 15:21:12
AC	yuchenyi23017	8ms	6.7 MiB		142 Bytes	2023-9-12 20:55:41
AC	新壹街校区-冉睦阳 (冉睦阳)	8ms	7.4 MiB		101 Bytes	2024-1-21 18:27:42
AC	我很6 (zjj22031)	8ms	392 KiB		260 Bytes	2023-3-12 11:06:49
AC	黄立信	8ms	384 KiB		116 Bytes	2022-12-3 11:57:55
AC	爱琴海校区-王宥喆 (王宥喆)	8ms	6.9 MiB		382 Bytes	2023-7-6 19:23:32
AC	杜启苇 (duqiwei)	8ms	6.8 MiB		97 Bytes	2023-6-17 13:34:54
AC	yanglang	8ms	420 KiB		119 Bytes	2022-10-16 12:15:41
AC	胡澜之 (666hlz666)	8ms	6.9 MiB		114 Bytes	2023-7-20 9:54:17
AC	希蒙 (zhengxingya)	8ms	6.9 MiB		114 Bytes	2023-7-24 19:47:14
AC	陈博昊 (cbh)	8ms	392 KiB		158 Bytes	2023-5-19 19:18:19