大写字母的判断

状态	递交者	时间	内存	代码	递交时间
AC	阮 (媚狐不吃道旁李)	14ms	444 KiB	167 Bytes	2023-3-5 16:57:06
AC	靳博然 (jbr)	14ms	436 KiB	174 Bytes	2023-2-19 17:30:36
AC	赵彬鸿	14ms	384 KiB	147 Bytes	2022-9-9 13:39:07
AC	colin1112 (墙凌可)	14ms	384 KiB	161 Bytes	2022-8-24 22:06:20
AC	22029-hqh	14ms	440 KiB	165 Bytes	2022-11-20 21:06:41
AC	余彦瑞	14ms	420 KiB	161 Bytes	2022-8-23 11:22:58
AC	胡瀚文	14ms	448 KiB	158 Bytes	2022-7-12 19:32:26
AC	祝熙承 (zxc)	14ms	384 KiB	168 Bytes	2022-8-29 16:39:54
AC	zyq1	14ms	384 KiB	178 Bytes	2023-5-3 11:07:36
AC	纪承熙 (jcx001)	14ms	512 KiB	195 Bytes	2022-6-3 20:06:05
AC	赵彬鸿	14ms	384 KiB	147 Bytes	2022-9-9 13:39:08
AC	汪致卉 (wangzh)	14ms	384 KiB	165 Bytes	2022-8-25 16:59:05
AC	13668050628	14ms	444 KiB	167 Bytes	2023-2-26 17:43:50
AC	罗宇凡 (吴彦祖)	14ms	416 KiB	154 Bytes	2022-3-13 20:03:44
AC	22029-lsl	14ms	444 KiB	177 Bytes	2022-11-20 19:31:42
AC	赵一嵘 (zhaoyirong)	14ms	432 KiB	191 Bytes	2022-3-15 20:29:04
AC	赵彬鸿	14ms	384 KiB	147 Bytes	2022-9-9 13:39:07
AC	冉宸语	14ms	420 KiB	177 Bytes	2023-2-19 17:29:02
AC	周米骐 (zsb)	14ms	6.8 MiB	176 Bytes	2023-10-26 18:23:09
AC	胡熙景	14ms	384 KiB	164 Bytes	2022-8-26 17:18:18
AC	王胤钦 (wangyinqin)	14ms	384 KiB	148 Bytes	2022-9-2 19:37:23
AC	ycy	14ms	436 KiB	147 Bytes	2022-4-22 17:53:45
AC	陈泰羽 (chentaiyu)	14ms	384 KiB	157 Bytes	2023-3-13 19:34:14
AC	22029-zjs	14ms	512 KiB	180 Bytes	2022-11-20 17:14:58
AC	彭崇鑫	14ms	384 KiB	155 Bytes	2022-8-28 10:37:58
AC	zhangzhimo	14ms	384 KiB	143 Bytes	2022-9-7 19:10:49
AC	杜俊宏	14ms	448 KiB	163 Bytes	2022-7-31 11:21:20
AC	呵呵呵 (陈思琦)	14ms	512 KiB	149 Bytes	2022-9-7 19:00:47
AC	zyq1	14ms	384 KiB	177 Bytes	2023-5-3 11:06:11
AC	yixingyou	14ms	392 KiB	146 Bytes	2022-9-7 19:05:54
AC	唐梓竣	14ms	384 KiB	224 Bytes	2022-8-23 20:46:12
AC	许嘉恩 (xje22031)	14ms	512 KiB	166 Bytes	2022-11-19 17:56:27
AC	黄梓轩 (huangzixuan)	14ms	384 KiB	173 Bytes	2022-9-7 19:01:58
AC	(张洛诚)	14ms	384 KiB	214 Bytes	2022-9-2 17:48:53
AC	chenxiaozhun	14ms	392 KiB	161 Bytes	2022-8-26 17:09:41
AC	谭懿轩 (yanyixuan)	14ms	432 KiB	134 Bytes	2022-3-17 20:29:20
AC	昌文迪 (05c05-cwd2)	14ms	520 KiB	162 Bytes	2022-11-19 16:22:33
AC	蒋青峰	14ms	512 KiB	130 Bytes	2023-2-26 10:20:50
AC	1396013295	14ms	384 KiB	191 Bytes	2022-3-20 11:27:49
AC	wuqilin	14ms	384 KiB	153 Bytes	2022-9-7 18:59:25
AC	22029-zjs	14ms	444 KiB	180 Bytes	2022-11-20 18:37:40
AC	luoluonuoya	14ms	444 KiB	144 Bytes	2022-8-28 16:19:16
AC	杨皓迪	14ms	388 KiB	158 Bytes	2022-9-7 19:05:34
AC	林小博	14ms	444 KiB	193 Bytes	2022-9-10 15:30:52
AC	黄梓桐 (HuangZiTong)	14ms	512 KiB	141 Bytes	2023-2-1 13:02:45
AC	霍弈丞小号	14ms	384 KiB	176 Bytes	2022-8-23 11:22:47
AC	SHY20091224	14ms	448 KiB	148 Bytes	2022-8-31 15:09:24
AC	明轩 (吕同学)	14ms	400 KiB	182 Bytes	2022-8-26 15:08:56
AC	偽艺術家 (chenyanchi22006)	14ms	424 KiB	148 Bytes	2022-8-23 23:22:58
AC	Jack	14ms	384 KiB	158 Bytes	2022-8-26 17:01:39
AC	赵彬鸿	14ms	384 KiB	147 Bytes	2022-9-9 13:39:08
AC	赵彬鸿	14ms	392 KiB	147 Bytes	2022-9-9 13:39:06
AC	zhangyh (张育菡)	14ms	424 KiB	169 Bytes	2022-3-14 21:06:00
AC	赵彬鸿	14ms	512 KiB	147 Bytes	2022-9-9 13:39:04
AC	时代一校-王宥量 (wangyouliang)	14ms	436 KiB	155 Bytes	2022-9-11 11:22:25
AC	芒苒忧 (廖迦南)	14ms	440 KiB	160 Bytes	2022-9-10 20:47:49
AC	无尽的想象 (谭仕高)	15ms	436 KiB	154 Bytes	2023-2-22 15:01:04
AC	zhangjiani	15ms	384 KiB	183 Bytes	2022-9-7 19:13:01
AC	王义苇 (wangyiwei)	15ms	436 KiB	181 Bytes	2023-3-2 21:02:19
AC	李卓燃 (李卓燃1)	15ms	512 KiB	166 Bytes	2023-3-17 17:49:10
AC	王彬羽 (wby)	15ms	512 KiB	194 Bytes	2023-2-19 17:27:56
AC	时代二校+王吕棪 (wanglvyan)	15ms	8.3 MiB	143 Bytes	2023-7-1 17:38:03
AC	zenglongxi	15ms	392 KiB	173 Bytes	2022-9-7 19:08:08
AC	hyh22031	15ms	384 KiB	186 Bytes	2023-3-16 21:05:24
AC	孙烽轶 (sfy)	15ms	404 KiB	173 Bytes	2022-9-7 19:10:52
AC	黄彦熹 (AK-203)	15ms	436 KiB	445 Bytes	2022-10-19 21:56:09
AC	zcx	15ms	496 KiB	157 Bytes	2023-3-8 20:10:07
AC	RanHao	15ms	6.7 MiB	206 Bytes	2023-8-23 9:43:45
AC	邵冠铖 (shaoguancheng22031)	15ms	384 KiB	139 Bytes	2022-10-23 12:44:47
AC	张景豪	15ms	6.9 MiB	161 Bytes	2023-7-1 19:41:37
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	424 KiB	146 Bytes	2022-11-19 12:35:43
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)	15ms	392 KiB	1.3 KiB	2022-11-19 17:13:03
AC	xuniaoyin (徐袅音)	15ms	416 KiB	145 Bytes	2023-3-6 18:42:22
AC	刘昱辰	15ms	384 KiB	181 Bytes	2022-8-26 15:27:27
AC	U城校区-漆子轩 (叶子小七)	15ms	6.7 MiB	164 Bytes	2023-9-7 19:25:53
AC	李树崑 (lishukun)	15ms	384 KiB	213 Bytes	2022-8-23 11:44:07
AC	唐良瑞 (22016-tlr01)	15ms	412 KiB	167 Bytes	2022-11-20 16:30:55
AC	潘佑实	15ms	512 KiB	162 Bytes	2023-2-19 17:09:09
AC	本人天生贪生pass (05c41-cqs)	15ms	444 KiB	147 Bytes	2022-8-24 20:17:03
AC	彭熙芮	15ms	6.7 MiB	156 Bytes	2023-9-7 19:32:44
AC	李谨严	15ms	512 KiB	198 Bytes	2022-8-28 15:10:20
AC	11111	15ms	440 KiB	161 Bytes	2022-3-20 9:39:28
AC	食不食油饼（点主页康康） (Nemo)	15ms	400 KiB	155 Bytes	2022-8-26 15:27:07
AC	赵彬鸿	15ms	392 KiB	147 Bytes	2022-9-9 13:39:07
AC	zhangxinchen	15ms	384 KiB	193 Bytes	2022-9-8 18:14:36
AC	缥 (王硕2012)	15ms	440 KiB	181 Bytes	2022-11-6 13:24:37
AC	杨滨郝 (ybh)	15ms	436 KiB	182 Bytes	2022-8-29 20:00:38
AC	赵彬鸿	15ms	404 KiB	147 Bytes	2022-9-9 13:39:08
AC	暗蛆突围 (lzh)	15ms	384 KiB	180 Bytes	2022-8-26 17:01:31
AC	胡益玮 (胡益玮_1)	15ms	512 KiB	179 Bytes	2023-2-19 17:13:24
AC	李树崑 (lishukun)	15ms	436 KiB	221 Bytes	2022-8-20 12:08:04
AC	赵彬鸿	15ms	384 KiB	147 Bytes	2022-9-9 13:39:06
AC	AC[谭赫奕] (tanheyi)	15ms	512 KiB	178 Bytes	2023-4-17 10:59:16
AC	U城校区-郭旻哲 (郭旻哲)	15ms	6.7 MiB	185 Bytes	2023-9-7 19:18:20
AC	肖钦文 (xiaoqinwen)	15ms	384 KiB	161 Bytes	2022-8-23 11:21:04
AC	谢靳骁 (XJX)	15ms	520 KiB	164 Bytes	2023-5-19 18:06:35
AC	陈秋石	15ms	456 KiB	172 Bytes	2022-8-29 10:58:30
AC	爱琴海校区-黄辰浩 (huangchenhao)	15ms	512 KiB	151 Bytes	2023-3-6 18:53:30
AC	廖永亨	16ms	512 KiB	188 Bytes	2022-11-30 18:35:16
AC	郑尧 (zhengyao)	16ms	6.9 MiB	173 Bytes	2023-7-1 19:34:18