将字符串中的小写字母转换成大写字母

状态	递交者	时间	内存	语言	代码	递交时间
AC	王义苇 (wangyiwei)	13ms	384 KiB		223 Bytes	2023-3-5 13:27:52
AC	ycy	13ms	384 KiB		211 Bytes	2022-8-31 15:26:03
AC	陈一锋 (cyf01)	13ms	384 KiB		222 Bytes	2022-7-1 20:57:19
AC	任希贤	13ms	384 KiB		226 Bytes	2023-5-10 21:15:45
AC	zhuqiwei22006	13ms	384 KiB		197 Bytes	2022-6-19 18:34:47
AC	魑归sama	13ms	444 KiB		220 Bytes	2022-7-12 16:45:27
AC	05c05-zjk	13ms	392 KiB		239 Bytes	2022-6-19 18:29:20
AC	郑之策	13ms	384 KiB		263 Bytes	2022-2-14 10:23:59
AC	xuniaoyin (徐袅音)	13ms	384 KiB		181 Bytes	2023-3-5 13:33:07
AC	NJL (NJlL)	13ms	512 KiB		235 Bytes	2022-6-5 17:31:59
AC	CMG	13ms	512 KiB		226 Bytes	2022-5-29 19:37:06
AC	zhangyh (张育菡)	13ms	384 KiB		272 Bytes	2022-6-13 22:11:09
AC	田信 (tianxincn1)	13ms	388 KiB		206 Bytes	2022-6-5 17:29:45
AC	zhangheyi22006	13ms	384 KiB		218 Bytes	2022-6-19 18:29:07
AC	章愉霖	13ms	392 KiB		241 Bytes	2023-5-21 17:20:37
AC	神秘人 (张涵曦大帅哥)	13ms	384 KiB		254 Bytes	2022-2-15 15:52:48
AC	李禹衡 (liyuheng22006)	13ms	384 KiB		246 Bytes	2022-6-19 18:26:31
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	13ms	384 KiB		227 Bytes	2022-6-4 20:22:58
AC	德意志第三帝国 (陈远桥)	13ms	396 KiB		234 Bytes	2022-6-5 12:54:10
AC	火爆肥肠（杨弘毅） (火爆肥肠)	13ms	392 KiB		267 Bytes	2022-6-12 15:34:40
AC	(张洛诚)	13ms	384 KiB		286 Bytes	2023-4-22 22:02:06
AC	ymh	13ms	384 KiB		242 Bytes	2022-2-15 15:54:18
AC	ywh	13ms	384 KiB		232 Bytes	2022-2-13 11:35:53
AC	谁陪訫牞（杀手） (22029-zys)	13ms	432 KiB		232 Bytes	2023-2-7 18:34:49
AC	刘锦航	13ms	512 KiB		248 Bytes	2022-6-8 18:27:03
AC	12345	13ms	384 KiB		251 Bytes	2022-2-15 15:42:10
AC	无尽的想象 (谭仕高)	13ms	384 KiB		293 Bytes	2022-8-27 17:33:54
AC	huyinuo	13ms	392 KiB		274 Bytes	2022-4-4 17:13:45
AC	朱老师 (zyp)	13ms	392 KiB		236 Bytes	2022-6-19 18:20:17
AC	真的高兴(死)了 (huyunyi1)	13ms	6.8 MiB	C++11	216 Bytes	2024-6-6 19:05:06
AC	霍弈丞小号	13ms	384 KiB		223 Bytes	2023-5-7 16:43:11
AC	疯神芭芭脱丝 (李卓修)	13ms	384 KiB		231 Bytes	2022-6-5 17:30:59
AC	杜是贤 (dushixian)	13ms	384 KiB		263 Bytes	2022-2-21 20:07:59
AC	马渝杭 (mayuhang)	14ms	384 KiB		304 Bytes	2022-8-27 17:29:26
AC	xiangsiyu	14ms	384 KiB		264 Bytes	2022-6-19 18:25:04
AC	周琪渃	14ms	392 KiB		215 Bytes	2023-3-8 22:17:14
AC	小根哥	14ms	384 KiB		299 Bytes	2022-8-27 11:35:11
AC	xiongxinyao	14ms	384 KiB		257 Bytes	2022-2-13 12:12:10
AC	雷文博（帅哥） (18983951391)	14ms	432 KiB		256 Bytes	2023-3-5 14:13:44
AC	~ycy~	14ms	384 KiB		199 Bytes	2023-4-29 17:55:20
AC	熊奕博 (Mothefuck)	14ms	512 KiB		229 Bytes	2023-2-26 18:15:12
AC	凌肯 (lingken22006)	14ms	384 KiB		282 Bytes	2022-6-19 18:30:31
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)	14ms	384 KiB		257 Bytes	2022-12-11 18:20:36
AC	PP (彭锦华)	14ms	6.8 MiB	C++98(O2)	259 Bytes	2024-6-6 19:05:21
AC	吴俊成 (wujuncheng)	14ms	392 KiB		207 Bytes	2022-6-5 20:59:31
AC	李哲 (lizhe)	14ms	512 KiB		234 Bytes	2022-7-22 14:35:19
AC	Tender. (05c05-zhou)	14ms	440 KiB		218 Bytes	2023-5-14 17:17:30
AC	王韵淮	14ms	392 KiB		205 Bytes	2022-5-29 9:18:13
AC	汤杰尧 (05c05-tjy1)	14ms	440 KiB		292 Bytes	2023-4-24 20:38:29
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		280 Bytes	2023-10-21 8:01:59
AC	姚宏逸	14ms	384 KiB		423 Bytes	2022-2-2 22:25:10
AC	文硕 (文硕1)	14ms	432 KiB		236 Bytes	2022-7-12 11:50:57
AC	xmw318046	14ms	6.5 MiB	C++98	230 Bytes	2024-7-5 14:45:57
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	14ms	384 KiB		288 Bytes	2022-2-15 15:46:16
AC	孙烽轶 (sfy)	14ms	384 KiB		189 Bytes	2023-4-5 17:37:18
AC	新一街校区Jason_LuoYouZheng (罗友峥)	14ms	392 KiB		221 Bytes	2022-2-15 15:54:12
AC	杨宇航1	14ms	392 KiB		190 Bytes	2023-3-5 13:32:39
AC	某某 (xuhaotian)	14ms	384 KiB		308 Bytes	2022-3-12 13:59:26
AC	王义苇 (wangyiwei)	14ms	412 KiB		223 Bytes	2023-3-5 13:31:29
AC	杜俊宏	14ms	384 KiB		270 Bytes	2022-4-9 15:34:54
AC	李彭宋代诗人 (ljy123456)	14ms	392 KiB		311 Bytes	2023-4-5 21:05:49
AC	王胤钦 (wangyinqin)	14ms	7.2 MiB	C++11	198 Bytes	2024-4-20 10:34:59
AC	经常消失 (小萝卜)	14ms	392 KiB		265 Bytes	2022-2-15 15:45:38
AC	zxccv	14ms	444 KiB		322 Bytes	2022-3-18 20:29:29
AC	李禹衡 (liyuheng22006)	14ms	392 KiB		229 Bytes	2022-6-19 18:26:42
AC	谢博文	14ms	384 KiB		239 Bytes	2022-2-13 11:33:06
AC	Erin	14ms	7 MiB	C++98	217 Bytes	2024-6-12 15:51:31
AC	时代1校-杨宇轩 (杨宇轩)	14ms	392 KiB		225 Bytes	2023-5-18 20:18:06
AC	旷山 (15213268688)	14ms	384 KiB		333 Bytes	2022-2-13 18:30:58
AC	梁金同 (liangjintong)	14ms	404 KiB		270 Bytes	2023-4-5 16:16:47
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)	14ms	384 KiB		257 Bytes	2022-12-11 18:18:52
AC	_daa	14ms	432 KiB		393 Bytes	2022-3-12 9:11:15
AC	(05c35-cyd)	14ms	384 KiB		310 Bytes	2022-3-2 20:16:47
AC	邬文博	14ms	392 KiB		223 Bytes	2022-7-1 15:47:13
AC	谢欣霖 (xiexinlin)	14ms	512 KiB		308 Bytes	2022-3-12 14:01:00
AC	段淏泷	14ms	7.2 MiB	C++98	242 Bytes	2024-5-9 21:26:46
AC	(05c35-cyd)	14ms	392 KiB		310 Bytes	2022-3-2 20:16:50
AC	(05c35-cyd)	14ms	392 KiB		310 Bytes	2022-3-2 20:16:49
AC	陈杰晟	14ms	392 KiB		230 Bytes	2022-2-13 12:03:05
AC	赵泳鑫 (zhaoyongxin)	14ms	384 KiB		224 Bytes	2022-7-11 14:31:43
AC	凌肯 (lingken22006)	14ms	412 KiB		282 Bytes	2022-6-19 18:30:28
AC	zhaoziqian	14ms	436 KiB		257 Bytes	2022-7-1 15:42:00
AC	luosifu22006	14ms	392 KiB		220 Bytes	2022-6-19 18:34:57
AC	wrqwc	14ms	400 KiB		206 Bytes	2022-7-1 15:53:57
AC	缥 (王硕2012)	14ms	428 KiB		258 Bytes	2023-2-6 20:53:36
AC	(05c35-cyd)	14ms	384 KiB		310 Bytes	2022-3-2 20:16:49
AC	(05c35-cyd)	14ms	384 KiB		310 Bytes	2022-3-2 20:16:50
AC	(05c35-cyd)	14ms	404 KiB		310 Bytes	2022-3-2 20:16:50
AC	庹仕杰	14ms	392 KiB		208 Bytes	2023-5-18 19:32:55
AC	17779	14ms	384 KiB		255 Bytes	2022-4-4 14:31:30
AC	CK (李弘毅)	14ms	436 KiB		183 Bytes	2023-4-15 15:42:44
AC	(05c35-cyd)	14ms	384 KiB		310 Bytes	2022-3-2 20:17:21
AC	林靖明	14ms	444 KiB		227 Bytes	2023-1-30 20:06:12
AC	时代一校 - 冯隆浩 (冯隆浩)	14ms	432 KiB		288 Bytes	2022-9-4 22:15:12
AC	LUKHE (LukeHu)	14ms	384 KiB		336 Bytes	2022-2-20 13:39:45
AC	我是傻逼 (刘鸿瑞)	14ms	6.9 MiB	C++11	224 Bytes	2024-8-24 10:20:35
AC	李禹衡 (liyuheng22006)	14ms	404 KiB		246 Bytes	2022-6-19 18:26:33
AC	陈佳婧	14ms	512 KiB		255 Bytes	2022-9-9 20:54:50
AC	王晴萱	14ms	6.9 MiB		245 Bytes	2023-7-16 16:08:55
AC	林凡童 (lft)	14ms	444 KiB		327 Bytes	2022-9-15 20:04:53