字符串的子串

状态	递交者	时间	内存	语言	代码	递交时间
AC	胡宸华 (huchenhua)	7ms	312 KiB		203 Bytes	2022-3-27 12:01:39
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	11ms	6.8 MiB		159 Bytes	2023-11-24 22:12:05
AC	17779	12ms	384 KiB		214 Bytes	2022-4-26 18:32:02
AC	张月恒	13ms	7 MiB	C++98(O2)	148 Bytes	2024-6-2 17:59:01
AC	Yuan (Zongzi1)	13ms	6.9 MiB	C++17(O2)	219 Bytes	2024-8-15 20:49:27
AC	Microsoft (hu_moren)	13ms	6.8 MiB	C++98	184 Bytes	2024-8-14 17:23:04
AC	甄一阳 (22016-zyy)	13ms	392 KiB		165 Bytes	2022-8-19 14:13:02
AC	SYC0226	13ms	512 KiB		179 Bytes	2022-4-10 10:54:35
AC	11111	13ms	384 KiB		203 Bytes	2022-7-1 16:40:01
AC	汪致卉 (wangzh)	13ms	512 KiB		222 Bytes	2022-4-22 19:19:34
AC	xmw318046	13ms	6.6 MiB	C++98	224 Bytes	2024-7-7 18:28:39
AC	黄梓桐 (HuangZiTong)	13ms	384 KiB		155 Bytes	2023-2-10 18:32:42
AC	Yuan (Zongzi1)	13ms	6.5 MiB	C++17(O2)	165 Bytes	2024-7-21 19:24:07
AC	扬子鳄	13ms	6.8 MiB	C++98	209 Bytes	2024-6-23 12:11:49
AC	My name is Man (钟卓劭)	13ms	6.8 MiB	C++98	189 Bytes	2024-8-9 15:09:02
AC	韩正墨 (xmw05)	13ms	432 KiB		162 Bytes	2022-7-14 11:13:02
AC	张瑞博	13ms	7 MiB	C++11	156 Bytes	2024-6-16 8:32:53
AC	Yuan (Zongzi1)	13ms	6.9 MiB	C++17(O2)	227 Bytes	2024-8-15 22:35:44
AC	朱老师 (zyp)	13ms	420 KiB		179 Bytes	2022-8-19 14:12:18
AC	王韵淮	13ms	512 KiB		139 Bytes	2022-5-29 8:57:43
AC	杜俊宏	13ms	512 KiB		162 Bytes	2022-6-25 19:45:45
AC	wangzihang	14ms	6.6 MiB	C++98	283 Bytes	2024-7-6 15:24:29
AC	林凡童 (lft)	14ms	428 KiB		249 Bytes	2022-9-15 20:09:02
AC	陈杰晟	14ms	452 KiB		201 Bytes	2022-2-13 12:29:28
AC	李树崑 (lishukun)	14ms	512 KiB		227 Bytes	2022-8-12 12:31:37
AC	qinlang	15ms	6.8 MiB		187 Bytes	2023-10-19 20:12:10
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.7 MiB		227 Bytes	2023-8-24 15:20:28
AC	RanHao	15ms	6.9 MiB		171 Bytes	2023-8-2 10:35:42
AC	蒲梓勋 (puzixun)	15ms	456 KiB		187 Bytes	2022-11-17 21:41:23
AC	姚宏逸	15ms	512 KiB		238 Bytes	2022-11-19 12:58:03
AC	Randy Marsh (杨子腾)	15ms	440 KiB		179 Bytes	2023-1-3 15:30:03
AC	zlx (xiao)	16ms	424 KiB		230 Bytes	2022-11-26 18:47:37
AC	金沙—彭智宸 (彭智宸)	16ms	6.9 MiB		171 Bytes	2023-8-10 18:58:31
AC	谭懿轩 (yanyixuan)	16ms	436 KiB		179 Bytes	2022-8-24 15:37:42
AC	huyinuo	16ms	424 KiB		188 Bytes	2023-3-18 9:04:40
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)	16ms	6.8 MiB		175 Bytes	2023-6-24 10:10:14
AC	Tender. (05c05-zhou)	18ms	8.2 MiB		171 Bytes	2023-8-24 10:37:57
AC	zyl	19ms	7.3 MiB		162 Bytes	2024-1-21 14:47:58
AC	坤坤荔枝小黑子 (zhonghaotian22006)	20ms	512 KiB		191 Bytes	2022-11-16 12:18:37
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	26ms	7.3 MiB		215 Bytes	2024-1-20 15:38:36
AC	heyuzhe	65ms	768 KiB	C++98	204 Bytes	2024-9-8 18:31:36
AC	22029-zjs	68ms	764 KiB		191 Bytes	2024-3-2 14:22:22
AC	stehpen_zuo	69ms	536 KiB	C++20	204 Bytes	2024-9-18 15:33:02
AC	赵奕铭	70ms	788 KiB		149 Bytes	2024-3-8 21:39:04
AC	huanglu	71ms	776 KiB	C++98	157 Bytes	2024-11-22 13:51:16
AC	jdy	71ms	536 KiB		195 Bytes	2024-3-12 20:22:36
AC	褚博艺	71ms	764 KiB		183 Bytes	2024-3-30 16:22:59
AC	曾御城（现用名） (Jason)	195ms	3.9 MiB	Python 3	56 Bytes	2022-1-25 14:58:49
AC	kongql	197ms	9 MiB	Python 3	62 Bytes	2023-7-23 17:49:56
AC	爱琴海校区-刁钲洋 (刁钲洋)	205ms	4 MiB	Python 3	81 Bytes	2022-4-27 22:05:33
AC	梨冻亿 (wiueh)	208ms	3.9 MiB	Python 3	72 Bytes	2022-1-23 18:51:57
AC	谭红中 (不知道)	213ms	3.9 MiB	Python 3	54 Bytes	2022-4-2 17:32:29