字符串的前k个字符

状态	递交者	时间	内存	语言	代码	递交时间
AC	张雯皓 (zhangwenhao)	4ms	7.1 MiB		204 Bytes	2023-12-23 11:39:58
AC	李彦臻	4ms	7.1 MiB		187 Bytes	2023-12-3 20:58:28
AC	lby_joey	12ms	6.7 MiB	C++98(O2)	156 Bytes	2024-7-23 15:41:01
AC	原著校区巫映秋 (巫映秋1a)	12ms	7 MiB	C++98	203 Bytes	2024-6-28 22:59:10
AC	xiangsiyu	12ms	384 KiB		181 Bytes	2022-7-3 22:03:45
AC	zyq1	13ms	384 KiB		166 Bytes	2023-4-3 21:05:26
AC	肖添宇	13ms	392 KiB		169 Bytes	2022-5-14 17:49:26
AC	王玺懿 (wxy)	13ms	384 KiB		169 Bytes	2022-7-2 12:35:40
AC	吴俊成 (wujuncheng)	13ms	436 KiB		154 Bytes	2022-7-11 20:10:25
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	384 KiB		183 Bytes	2022-7-4 10:19:21
AC	极为的好van的 (lyq)	13ms	404 KiB		188 Bytes	2022-7-2 11:29:55
AC	疯神芭芭脱丝 (李卓修)	13ms	392 KiB		184 Bytes	2022-7-12 19:05:46
AC	王泓涵 (whh)	13ms	392 KiB		188 Bytes	2022-7-2 11:35:41
AC	GYZ	13ms	420 KiB		181 Bytes	2022-5-25 19:27:17
AC	huyinuo	13ms	512 KiB		208 Bytes	2022-5-31 22:06:44
AC	甄一阳 (22016-zyy)	13ms	384 KiB		159 Bytes	2022-9-11 9:32:11
AC	杜俊宏	13ms	384 KiB		201 Bytes	2022-6-13 19:48:46
AC	王韵淮	13ms	384 KiB		132 Bytes	2022-5-31 21:21:23
AC	陈杰晟	13ms	384 KiB		182 Bytes	2022-5-29 11:05:10
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)	13ms	392 KiB		159 Bytes	2023-5-20 12:59:00
AC	源著校区-宋昊成 (马冬梅)	13ms	512 KiB		190 Bytes	2023-2-26 19:51:43
AC	罗伟杰 (13308275065)	13ms	440 KiB		151 Bytes	2022-7-12 14:09:05
AC	张瑞博	13ms	7 MiB	C++11	152 Bytes	2024-6-9 16:23:48
AC	ywh	14ms	512 KiB		163 Bytes	2022-4-16 11:19:50
AC	杨皓宇 (杨浩宇)	14ms	384 KiB		179 Bytes	2022-7-2 11:35:57
AC	新壹街校区-陈品烨 (陈品烨)	14ms	6.8 MiB		145 Bytes	2023-10-3 9:50:58
AC	77777777	14ms	6.6 MiB	C++17	214 Bytes	2024-7-16 21:21:39
AC	luoluonuoya	14ms	448 KiB		243 Bytes	2022-5-8 14:49:38
AC	何昊宇 (22016-hhy)	14ms	404 KiB		172 Bytes	2022-9-11 9:32:29
AC	姚宏逸	14ms	384 KiB		236 Bytes	2022-3-8 18:51:18
AC	新壹街校区--税崇峻 (税崇峻)	14ms	6.7 MiB		167 Bytes	2023-8-27 18:03:55
AC	zhoumingze23017	14ms	6.7 MiB		174 Bytes	2023-9-4 19:23:50
AC	huanglu	14ms	6.7 MiB		264 Bytes	2023-10-1 9:59:46
AC	xyc (谢雨宸)	14ms	6.7 MiB		170 Bytes	2023-9-27 20:18:32
AC	周琪渃	14ms	384 KiB		276 Bytes	2022-11-28 15:27:38
AC	赵泳鑫 (zhaoyongxin)	14ms	428 KiB		195 Bytes	2022-7-15 15:24:32
AC	ycy	14ms	440 KiB		167 Bytes	2022-4-22 17:42:00
AC	曹埊睿 (caodirui)	14ms	512 KiB		173 Bytes	2023-4-20 21:39:37
AC	罗翌珂 (dangdang)	14ms	436 KiB		177 Bytes	2022-7-2 11:10:19
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	440 KiB		181 Bytes	2022-9-24 22:13:50
AC	阮 (媚狐不吃道旁李)	14ms	7.2 MiB	C++98	177 Bytes	2024-5-18 11:21:03
AC	pandap&a王皓宸 (WANGHAOCHEN)	15ms	512 KiB		243 Bytes	2023-4-7 19:56:54
AC	huanglu	15ms	6.7 MiB		214 Bytes	2023-10-1 9:58:03
AC	wangzihang	15ms	6.8 MiB		178 Bytes	2023-4-1 18:15:46
AC	陈于硕(我™的) (chenyu)	15ms	384 KiB		176 Bytes	2023-3-25 11:34:17
AC	22016-oyc	15ms	440 KiB		160 Bytes	2022-9-11 11:50:09
AC	王晴萱	15ms	6.8 MiB		174 Bytes	2023-9-24 11:03:49
AC	colin1112 (墙凌可)	15ms	6.7 MiB		163 Bytes	2023-9-1 17:12:39
AC	王晨志 (wangchenzhi)	15ms	512 KiB		358 Bytes	2022-7-21 14:47:38
AC	许徐非凡 (非同凡响)	15ms	392 KiB		130 Bytes	2022-10-1 11:19:40
AC	王晴萱	15ms	7 MiB		225 Bytes	2023-7-16 11:01:49
AC	何昊宇 (22016-hhy)	15ms	384 KiB		184 Bytes	2022-9-11 9:32:45
AC	wzzjnb2012	15ms	432 KiB		215 Bytes	2022-10-6 11:42:13
AC	(张洛诚)	15ms	512 KiB		201 Bytes	2023-5-27 18:14:05
AC	李廷旭 (litingxu)	15ms	6.9 MiB		215 Bytes	2023-8-17 14:44:52
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	15ms	384 KiB		174 Bytes	2023-1-17 15:37:42
AC	8086	16ms	6.9 MiB		171 Bytes	2023-7-12 11:32:44
AC	李树崑 (lishukun)	16ms	512 KiB		218 Bytes	2022-8-17 11:36:27
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	16ms	440 KiB		191 Bytes	2022-12-25 16:22:53
AC	RanHao	16ms	6.7 MiB		155 Bytes	2023-9-8 16:08:42
AC	郑岐蔚	16ms	512 KiB		196 Bytes	2023-2-11 12:51:26
AC	laiyouming22031	16ms	384 KiB		177 Bytes	2022-12-18 10:45:57
AC	无尽的想象 (谭仕高)	16ms	512 KiB		151 Bytes	2023-1-6 15:46:03
AC	葛琮扬	16ms	6.9 MiB		164 Bytes	2023-8-4 16:13:28
AC	许嘉恩 (xje22031)	16ms	436 KiB		165 Bytes	2022-12-21 19:53:33
AC	zlx (xiao)	17ms	440 KiB		210 Bytes	2022-11-27 12:29:40
AC	朱老师 (zyp)	17ms	440 KiB		157 Bytes	2022-12-18 11:18:41
AC	缥 (王硕2012)	17ms	436 KiB		190 Bytes	2022-12-18 18:49:25
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	19ms	7.1 MiB		212 Bytes	2024-1-20 15:39:47
AC	吕同学是傻逼 (黄立信)	23ms	7 MiB		185 Bytes	2024-1-10 22:24:26
AC	wangjun	23ms	6.9 MiB		168 Bytes	2023-11-26 15:11:56
AC	不怎么聪明的家伙 (贺俊楠)	27ms	7.1 MiB		176 Bytes	2023-12-3 9:51:59
AC	你个你怎么跟个一样 (钟卓劭)	65ms	548 KiB		145 Bytes	2024-3-20 20:03:44
AC	zyl	66ms	768 KiB		206 Bytes	2024-3-14 17:11:12
AC	赵奕铭	68ms	764 KiB		157 Bytes	2024-2-22 19:39:11
AC	Him神	75ms	764 KiB		168 Bytes	2024-3-4 15:35:58
AC	梨冻亿 (wiueh)	201ms	4 MiB	Python 3	43 Bytes	2022-4-4 10:11:16
AC	谭红中 (不知道)	217ms	3.9 MiB	Python 3	37 Bytes	2022-4-17 21:54:20
AC	1396013295	223ms	3.9 MiB	Python 3	116 Bytes	2022-3-9 19:38:30