字符三角形plus

状态	递交者	时间	内存	语言	代码	递交时间
AC	(金沙天街)严皓月 (严皓月)	10ms	7 MiB		253 Bytes	2023-11-18 19:21:52
AC	张瑞博	13ms	6.6 MiB	C++11	241 Bytes	2024-7-11 6:22:48
AC	hyh	13ms	6.9 MiB	C++98	262 Bytes	2024-6-5 17:37:15
AC	杨皓然(X) (yanghaoran12)	13ms	392 KiB		270 Bytes	2022-9-12 18:02:47
AC	江子墨	13ms	6.8 MiB	C++98	237 Bytes	2024-6-7 16:00:48
AC	heyuzhe	13ms	7 MiB	C++98	291 Bytes	2024-6-12 18:02:40
AC	益布响完辣 (黄靖益1)	13ms	7 MiB	C++17	266 Bytes	2024-6-2 10:36:59
AC	龙吉先 (ljx)	13ms	6.9 MiB	C++98	309 Bytes	2024-8-22 15:21:40
AC	缥 (王硕2012)	13ms	392 KiB		393 Bytes	2023-2-18 12:12:44
AC	陌生人 (涂玉龙)	13ms	7.1 MiB		225 Bytes	2023-12-3 14:40:54
AC	huanghaoming	13ms	444 KiB		224 Bytes	2022-9-11 19:29:24
AC	李信 (朱子龙)	14ms	6.9 MiB	C++11	226 Bytes	2024-8-21 10:46:48
AC	罗翌珂 (dangdang)	14ms	384 KiB		311 Bytes	2022-8-28 10:44:34
AC	曹埊睿 (caodirui)	14ms	512 KiB		230 Bytes	2023-4-10 18:58:22
AC	zyq1	14ms	384 KiB		228 Bytes	2023-4-10 21:11:20
AC	爱琴海校区-刁钲洋 (刁钲洋)	14ms	436 KiB		288 Bytes	2023-2-27 19:32:12
AC	没有此人 (akm)	14ms	7 MiB		346 Bytes	2023-7-4 16:22:27
AC	xzf	14ms	6.9 MiB	C++98	215 Bytes	2024-8-18 15:50:19
AC	时代一校-吴琪磷 (jiku)	14ms	7.1 MiB		230 Bytes	2023-11-14 20:22:26
AC	杜俊宏	15ms	512 KiB		247 Bytes	2022-8-27 8:57:29
AC	yang	15ms	436 KiB		261 Bytes	2022-9-8 12:24:14
AC	huyinuo	15ms	440 KiB		282 Bytes	2022-8-28 9:38:34
AC	^_^ (ctc)	15ms	432 KiB		228 Bytes	2022-10-19 21:04:47
AC	李哲 (lizhe)	15ms	440 KiB		234 Bytes	2022-8-29 22:37:25
AC	zhm123	15ms	428 KiB		229 Bytes	2023-6-1 15:24:16
AC	周琪渃	15ms	384 KiB		265 Bytes	2022-12-31 17:38:06
AC	My name is Man (钟卓劭)	15ms	6.9 MiB	C++98	228 Bytes	2024-6-9 13:40:45
AC	1396013295	15ms	384 KiB		242 Bytes	2022-10-23 10:44:09
AC	RanHao	15ms	6.7 MiB		229 Bytes	2023-9-27 11:26:02
AC	杨瀚霖 (yanghanlin)	15ms	392 KiB		271 Bytes	2023-3-11 10:26:06
AC	luoluonuoya	15ms	440 KiB		237 Bytes	2022-9-24 10:59:37
AC	jighghjkfkhfdhdfdfdsfsdfsafvmnkbnkbmnlvnmkbvnvb;,.m;,;.;,;kbvlmkbnlmkblnvkmlbnkmlbvkmlbvklmbkmlkblmbnm;,l.,.;,'.,';.[',;.[,kjkoihgfhfgiohifgohifgohiofgihgofhiofgihofgihofgihofgiho;''[;.',m;.',m.;',.;'m,.;';'cv;x'cb'cx;b'cv;b'xc;b'c;b'cvbvc.'bv.//,/vb./vcb./cvbv,c.b,cv.,b.cv,b.vc,bg;hgl;hgl;hg;h;hfg;hl;lf;l;lxc;cln;bvln;vcln;vnl;vbl;vbln;vlv;blnvb;plnp;lplhfljpjh;nlvb;nv;bn;vcvl;nlv;nlv;g;hjhchl;ghfghl;fghl;ltlh;l;hlf;lg;bnlc;;nlv;nbv;nbv;nvb;nlvcnl;xc;blxcb;ll;hg;lhgl;dfl;t;ldy;l;lyl;rewlt493;l;dl;dsflg;lsdlpbpcxobpocvbpopopopreopotpreotertertretert (litingxu)	15ms	6.9 MiB		326 Bytes	2023-8-17 14:42:43
AC	坤坤荔枝小黑子 (zhonghaotian22006)	15ms	428 KiB		293 Bytes	2022-11-17 20:30:30
AC	王晴萱	17ms	7 MiB		240 Bytes	2023-7-14 14:53: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)	18ms	6.8 MiB		246 Bytes	2023-6-12 20:59:37
AC	xuniaoyin (徐袅音)	18ms	7 MiB		230 Bytes	2023-12-17 10:52:03
AC	张雯皓 (zhangwenhao)	19ms	7.1 MiB		244 Bytes	2023-12-23 11:40:26
AC	ChongqingGroup (Donce)	19ms	7.1 MiB		233 Bytes	2023-12-3 14:39:27
AC	高彬月	20ms	7.1 MiB		224 Bytes	2023-12-3 14:37:55
AC	200800	25ms	7.1 MiB		246 Bytes	2023-12-3 14:44:30
AC	新壹街校区-冉睦阳 (冉睦阳)	73ms	532 KiB	C++98	270 Bytes	2024-9-22 11:40:06