输出字符三角形

状态	递交者	时间	内存	语言	代码	递交时间
AC	郭睿	6ms	6.6 MiB	C++98	188 Bytes	2024-7-9 22:10:41
AC	Ronnie	6ms	388 KiB		250 Bytes	2022-1-19 16:08:32
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	6ms	436 KiB		164 Bytes	2022-7-7 18:28:08
AC	陈海骞 (chq)	6ms	384 KiB		187 Bytes	2022-3-10 23:00:31
AC	蒲梓勋 (puzixun)	6ms	384 KiB		201 Bytes	2022-6-26 10:32:18
AC	崔欧辰	6ms	6.7 MiB	C++11	186 Bytes	2024-7-12 21:40:31
AC	我谢谢你全家	6ms	384 KiB		170 Bytes	2022-3-27 18:48:44
AC	新一街校区Jason_LuoYouZheng (罗友峥)	6ms	408 KiB		179 Bytes	2022-4-1 20:59:22
AC	低调的学霸	6ms	384 KiB		179 Bytes	2022-8-18 15:48:38
AC	代尚函笛卡尔 (daishanghan)	6ms	512 KiB		169 Bytes	2022-8-22 15:29:24
AC	谢靳骁 (XJX)	6ms	392 KiB		204 Bytes	2023-5-7 18:09:30
AC	灵光sans (wangchihao)	6ms	384 KiB		182 Bytes	2022-6-18 17:02:21
AC	pwf	6ms	384 KiB		245 Bytes	2022-9-3 12:07:46
AC	李奕霖 (liyilin233)	6ms	492 KiB		186 Bytes	2022-5-21 21:14:33
AC	谢延灏 (xeiyanhao---a handsome boy)	6ms	384 KiB		177 Bytes	2022-2-27 19:44:51
AC	时代一校-王宥量 (wangyouliang)	6ms	512 KiB		156 Bytes	2022-9-11 12:17:56
AC	草\|\|草 (陈星佑)	6ms	384 KiB		198 Bytes	2022-6-5 10:57:20
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)	6ms	436 KiB		214 Bytes	2022-9-19 19:42:58
AC	刘沄熙	6ms	384 KiB		184 Bytes	2022-2-20 12:02:07
AC	任瑞的学生 (jiangyadong)	6ms	392 KiB		142 Bytes	2022-6-1 13:43:57
AC	金锦泽 (jinjinze)	6ms	384 KiB		229 Bytes	2022-4-30 21:15:31
AC	Steven (王梓丞)	6ms	384 KiB		181 Bytes	2022-4-9 14:18:02
AC	stehpen_zuo	6ms	7 MiB	C++98	219 Bytes	2024-5-11 0:25:34
AC	魏楚浔 (shawn)	6ms	384 KiB		195 Bytes	2022-2-27 18:14:07
AC	极为的好van的 (lyq)	6ms	392 KiB		153 Bytes	2022-7-2 9:01:53
AC	Guest	6ms	7 MiB	C++98	192 Bytes	2024-4-18 13:40:08
AC	NJL (NJlL)	6ms	384 KiB		176 Bytes	2022-3-27 17:58:19
AC	王胤钦 (wangyinqin)	6ms	384 KiB		173 Bytes	2022-4-4 16:16:25
AC	Turorany (郑浩然)	6ms	384 KiB		188 Bytes	2023-4-21 21:21:59
AC	王宇桐 (我是外挂)	6ms	384 KiB		227 Bytes	2022-1-23 15:55:10
AC	明哲瀚 (18580067605)	6ms	384 KiB		187 Bytes	2022-9-10 9:12:13
AC	龙沁均 (我是S神)	6ms	384 KiB		188 Bytes	2022-3-6 16:11:54
AC	杨淇瑞 (杨淇瑞29)	6ms	396 KiB		186 Bytes	2023-4-17 20:59:51
AC	05c35-hhw	6ms	432 KiB		229 Bytes	2022-3-12 20:33:11
AC	折戟沉沙	6ms	440 KiB	C++	194 Bytes	2022-5-27 18:07:40
AC	叶冠森 (叶冠森)	6ms	384 KiB		185 Bytes	2022-5-21 12:46:45
AC	杨淇瑞 (杨淇瑞29)	6ms	384 KiB		186 Bytes	2023-4-17 20:59:48
AC	张玉坚 (zhangyuian)	6ms	384 KiB		194 Bytes	2022-6-12 15:56:27
AC	dengduxi	6ms	384 KiB		183 Bytes	2022-10-23 18:26:14
AC	朱老师 (zyp)	6ms	392 KiB		239 Bytes	2022-7-18 13:18:01
AC	俞伏羲	6ms	384 KiB		183 Bytes	2023-2-12 15:40:55
AC	啊...这 (炼狱杏寿郎)	6ms	384 KiB		198 Bytes	2022-7-2 11:08:27
AC	scallway	6ms	384 KiB		159 Bytes	2023-2-12 15:39:07
AC	stehpen_zuo	6ms	7 MiB	C++98	219 Bytes	2024-5-11 0:25:26
AC	彭嘉豪 (pengjiahao)	6ms	384 KiB		177 Bytes	2022-6-26 9:08:17
AC	朱泽晟	6ms	384 KiB		215 Bytes	2022-7-1 17:11:13
AC	赵一嵘 (zhaoyirong)	6ms	384 KiB		241 Bytes	2022-1-23 15:32:59
AC	MOD	6ms	512 KiB		173 Bytes	2022-5-28 12:48:44
AC	吴俊成 (wujuncheng)	6ms	384 KiB		194 Bytes	2022-7-8 22:42:02
AC	陈秋石	6ms	432 KiB		179 Bytes	2022-8-20 13:37:33
AC	余晨浩 (yuchenhao)	6ms	384 KiB		160 Bytes	2022-8-24 15:22:55
AC	刘锦航	6ms	384 KiB		230 Bytes	2022-1-20 19:19:02
AC	old_doctor	6ms	440 KiB		176 Bytes	2022-6-6 13:38:41
AC	靳博然 (jbr)	6ms	384 KiB		186 Bytes	2022-9-10 15:17:03
AC	周功杭	6ms	384 KiB		177 Bytes	2022-4-30 13:09:48
AC	wangchenyu	6ms	384 KiB		176 Bytes	2022-1-24 15:24:30
AC	lvlu	6ms	436 KiB		215 Bytes	2022-7-22 11:57:15
AC	新壹街校区-罗斤天 (罗斤天)	6ms	436 KiB		181 Bytes	2023-4-22 13:08:32
AC	Error404sans (焦阳浩云)	6ms	6.8 MiB	C++20(O2)	392 Bytes	2024-5-20 21:19:35
AC	梦之泪伤	6ms	384 KiB		177 Bytes	2022-1-22 11:43:13
AC	什蒂尔布 (吴东航)	6ms	6.9 MiB	C++98	208 Bytes	2024-5-20 16:50:56
AC	🐟<。)#)))≦、、鱼 (张馨月)	6ms	384 KiB		158 Bytes	2023-2-11 12:11:38
AC	向俊熙 (xiangjunxi23003)	6ms	384 KiB		174 Bytes	2023-2-15 16:28:55
AC	余晨浩 (yuchenhao)	6ms	384 KiB		160 Bytes	2022-8-24 15:22:21
AC	彭嘉豪 (pengjiahao)	6ms	384 KiB		177 Bytes	2022-6-26 9:08:16
AC	MoonLight ( aaa)	6ms	384 KiB		206 Bytes	2022-1-1 9:11:51
AC	谢延灏 (xeiyanhao---a handsome boy)	6ms	416 KiB		177 Bytes	2022-1-17 22:06:49
AC	amr (董子溪)	6ms	7.1 MiB	C++98	213 Bytes	2024-6-14 19:55:53
AC	huanghaoming	6ms	432 KiB		179 Bytes	2022-8-18 11:29:31
AC	樱岛の花	6ms	384 KiB		170 Bytes	2022-5-2 20:52:14
AC	18523558128zcn	6ms	384 KiB		174 Bytes	2022-4-9 14:16:43
AC	呵呵呵 (陈思琦)	6ms	384 KiB		178 Bytes	2022-6-18 16:56:46
AC	雷承翰 (雷承翰lch)	6ms	7 MiB	C++98	174 Bytes	2024-5-26 14:53:58
AC	Error404sans (焦阳浩云)	6ms	6.8 MiB	C++20(O2)	392 Bytes	2024-5-20 21:16:00
AC	wangjunhan	6ms	440 KiB		189 Bytes	2022-1-23 16:18:51
AC	蓝色妖姬 (jiangpeiyu)	6ms	392 KiB		177 Bytes	2022-4-10 11:51:13
AC	张梓辰 (DiaoDesi屌德斯)	6ms	384 KiB		194 Bytes	2022-9-15 19:38:21
AC	李嘉瑞	6ms	392 KiB		213 Bytes	2022-4-9 18:54:51
AC	邬文博 (wwb)	6ms	384 KiB		220 Bytes	2022-6-15 18:27:20
AC	李山水	6ms	384 KiB		219 Bytes	2022-2-19 15:57:43
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	6ms	392 KiB		202 Bytes	2022-9-10 17:58:28
AC	罗竣瀚	6ms	384 KiB		184 Bytes	2022-8-23 11:04:48
AC	马渝杭 (mayuhang)	6ms	384 KiB		169 Bytes	2022-5-22 16:18:46
AC	cupy战士 (05c05-dkf)	6ms	384 KiB		174 Bytes	2022-6-5 15:37:56
AC	Randy Marsh (杨子腾)	6ms	384 KiB		207 Bytes	2022-1-24 9:53:41
AC	贺睿林	6ms	7.5 MiB		171 Bytes	2023-10-14 11:32:32
AC	黄盛凯	6ms	6.7 MiB		179 Bytes	2023-9-30 12:48:07
AC	况奕辛 (KYX_yyds)	6ms	392 KiB		200 Bytes	2021-12-30 17:55:24
AC	胡瀚文	6ms	392 KiB		170 Bytes	2022-1-20 9:37:19
AC	罗元邑	6ms	384 KiB		153 Bytes	2023-2-11 16:05:11
AC	李樊駁	6ms	384 KiB		171 Bytes	2023-2-12 15:48:15
AC	明哲瀚 (18580067605)	6ms	420 KiB		187 Bytes	2022-9-8 19:22:18
AC	Eastwa	6ms	6.8 MiB	C++98(O2)	194 Bytes	2024-8-11 16:15:06
AC	吴卓轩	6ms	384 KiB		184 Bytes	2022-9-3 15:46:03
AC	龙思颖 (lsy)	6ms	384 KiB		183 Bytes	2023-3-6 19:02:21
AC	方子谦	6ms	392 KiB		220 Bytes	2022-2-20 12:17:38
AC	谢佳辰	6ms	384 KiB		203 Bytes	2022-4-17 9:15:20
AC	许嘉恩 (xje22031)	6ms	508 KiB		188 Bytes	2022-11-10 21:44:50
AC	低调的学霸	6ms	392 KiB		179 Bytes	2022-8-18 15:48:36
AC	芒苒忧 (廖迦南)	6ms	384 KiB		192 Bytes	2022-1-25 14:24:36