字符串假肢手术1

状态	递交者	时间	内存	语言	代码	递交时间
AC	zyl	-	7.1 MiB		167 Bytes	2024-1-7 10:55:15
AC	姚宏逸	2ms	256 KiB		189 Bytes	2022-5-29 10:22:42
AC	wangruibo20xh	2ms	256 KiB		181 Bytes	2022-2-11 19:09:19
AC	赵沛喆	2ms	256 KiB		193 Bytes	2022-5-8 11:12:19
AC	疯神芭芭脱丝 (李卓修)	2ms	312 KiB		172 Bytes	2022-6-9 19:45:57
AC	杜俊宏	3ms	384 KiB		255 Bytes	2022-6-3 16:40:40
AC	经常消失 (小萝卜)	3ms	392 KiB		207 Bytes	2022-4-4 13:39:47
AC	NJL (NJlL)	3ms	384 KiB		336 Bytes	2022-5-15 17:25:08
AC	李树崑 (lishukun)	3ms	384 KiB		250 Bytes	2022-8-3 18:04:54
AC	芒苒忧 (廖迦南)	4ms	404 KiB		171 Bytes	2022-8-3 15:08:13
AC	韩正墨 (xmw05)	4ms	440 KiB		221 Bytes	2022-7-14 10:39:53
AC	张祖名	4ms	6.4 MiB	C++98(O2)	168 Bytes	2024-7-5 22:16:21
AC	肖添宇	4ms	392 KiB		283 Bytes	2022-5-14 17:56:04
AC	王晨志 (wangchenzhi)	4ms	384 KiB		249 Bytes	2022-6-19 13:08:26
AC	呵 (mohaoran)	4ms	384 KiB		154 Bytes	2022-6-19 18:26:36
AC	qinyi	4ms	408 KiB		207 Bytes	2022-2-26 16:17:02
AC	lch (凌昌瀚)	4ms	384 KiB		174 Bytes	2022-5-28 11:29:06
AC	郭人瑀作业号	4ms	432 KiB		193 Bytes	2022-8-2 15:34:13
AC	17779	4ms	392 KiB		207 Bytes	2022-4-11 15:18:14
AC	RanHao	4ms	6.8 MiB		221 Bytes	2023-7-26 13:47:37
AC	王乐仪	4ms	412 KiB		223 Bytes	2022-2-6 15:57:59
AC	火爆肥肠（杨弘毅） (火爆肥肠)	4ms	392 KiB		287 Bytes	2022-4-20 21:04:44
AC	Yuan (Zongzi1)	4ms	6.6 MiB	C++17(O2)	181 Bytes	2024-7-21 15:33:21
AC	huyinuo	4ms	420 KiB		309 Bytes	2022-2-19 10:04:45
AC	xmw318046	4ms	6.6 MiB	C++98	169 Bytes	2024-7-6 16:19:28
AC	偽艺術家 (chenyanchi22006)	4ms	436 KiB		195 Bytes	2022-8-22 10:44:49
AC	1396013295	4ms	440 KiB		250 Bytes	2022-1-23 17:27:25
AC	罗晨睿 (luochenrui)	4ms	440 KiB		175 Bytes	2022-6-29 14:24:55
AC	汪致卉 (wangzh)	4ms	384 KiB		172 Bytes	2022-1-23 20:14:57
AC	SYC0226	4ms	436 KiB		221 Bytes	2022-4-10 10:40:01
AC	李禹衡 (liyuheng22006)	4ms	428 KiB		169 Bytes	2023-3-20 19:15:04
AC	zhangyh (张育菡)	4ms	444 KiB		279 Bytes	2022-6-13 22:13:01
AC	阮 (媚狐不吃道旁李)	4ms	7.2 MiB	C++98	239 Bytes	2024-5-2 16:39:03
AC	赵泳鑫 (zhaoyongxin)	4ms	408 KiB		234 Bytes	2022-4-13 20:22:01
AC	时代校区-孔令皓 (konglinghao)	4ms	7.1 MiB	C++98	235 Bytes	2024-5-8 22:43:53
AC	文硕 (文硕1)	4ms	440 KiB		234 Bytes	2022-7-12 11:55:57
AC	luoluonuoya	4ms	440 KiB		305 Bytes	2022-3-20 14:56:55
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	440 KiB		235 Bytes	2022-11-16 10:02:54
AC	谭懿轩 (yanyixuan)	4ms	436 KiB		218 Bytes	2022-8-24 14:56:56
AC	zlx (xiao)	4ms	432 KiB		342 Bytes	2022-11-26 18:42:25
AC	胡宸华 (huchenhua)	4ms	6.9 MiB		223 Bytes	2023-8-20 21:03:38
AC	朱老师 (zyp)	4ms	432 KiB		175 Bytes	2022-8-16 18:33:55
AC	李山水	4ms	384 KiB		275 Bytes	2022-2-10 9:42:41
AC	李哲 (lizhe)	4ms	436 KiB		133 Bytes	2022-11-29 19:52:51
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)	5ms	436 KiB		198 Bytes	2023-5-27 11:57:00
AC	欧俊阳	5ms	6.9 MiB		214 Bytes	2023-8-9 11:31:26
AC	林小博	5ms	440 KiB		150 Bytes	2023-2-1 16:56:37
AC	zhouxifei	5ms	440 KiB		157 Bytes	2022-10-15 9:36:28
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	5ms	384 KiB		177 Bytes	2023-1-7 12:05:51
AC	(张洛诚)	5ms	436 KiB		159 Bytes	2023-6-3 10:35:37
AC	Tender. (05c05-zhou)	5ms	6.7 MiB		223 Bytes	2023-8-24 10:25:58
AC	jdy	21ms	532 KiB		239 Bytes	2024-3-10 14:20:29
AC	赵奕铭	22ms	532 KiB		202 Bytes	2024-3-2 23:17:39
AC	Him神	22ms	532 KiB		202 Bytes	2024-3-4 16:26:56
AC	My name is Man (钟卓劭)	22ms	764 KiB		145 Bytes	2024-3-20 15:22:38
AC	希蒙 (zhengxingya)	22ms	532 KiB		270 Bytes	2024-3-6 17:27:55
AC	爱琴海校区-刁钲洋 (刁钲洋)	52ms	3.9 MiB	Python 3	63 Bytes	2022-2-15 20:43:19
AC	11111	53ms	3.9 MiB	Python 3	79 Bytes	2022-1-27 17:19:14
AC	苗润昊	53ms	3.8 MiB	Python 3	93 Bytes	2022-1-25 17:20:14
AC	杨坤霖 (steven)	55ms	3.9 MiB	Python 3	75 Bytes	2022-8-18 17:12:55
AC	shenyushun1	57ms	3.9 MiB	Python 3	79 Bytes	2022-1-24 18:57:32
AC	kongql	59ms	9 MiB	Python 3	140 Bytes	2023-7-23 15:38:26
AC	梨冻亿 (wiueh)	62ms	3.9 MiB	Python 3	100 Bytes	2022-1-23 18:46:58
AC	杨坤霖 (steven)	63ms	3.9 MiB	Python 3	75 Bytes	2022-8-18 17:12:52
AC	戴玉彤	67ms	3.9 MiB	Python 3	140 Bytes	2022-3-27 15:37:16