字符串长度

状态	递交者	时间	内存	语言	代码	递交时间
AC	lch (凌昌瀚)	12ms	384 KiB		139 Bytes	2022-5-27 21:09:03
AC	安一谦	12ms	6.6 MiB	C++17	119 Bytes	2024-7-21 15:08:45
AC	赵彬鸿	12ms	392 KiB		114 Bytes	2022-6-11 15:18:55
AC	钟京润	12ms	412 KiB		165 Bytes	2022-6-11 15:18:34
AC	陈骏洋	12ms	384 KiB		135 Bytes	2022-4-17 11:05:31
AC	赵彬鸿	12ms	384 KiB		114 Bytes	2022-6-11 15:18:58
AC	zhangxinchen	12ms	512 KiB		127 Bytes	2022-6-11 15:18:39
AC	huyinuo	12ms	384 KiB		151 Bytes	2022-5-31 22:33:34
AC	ywh	13ms	384 KiB		125 Bytes	2022-6-18 20:05:33
AC	赵彬鸿	13ms	384 KiB		114 Bytes	2022-6-11 15:19:01
AC	肖添宇	13ms	392 KiB		132 Bytes	2022-5-14 17:12:51
AC	陈骏洋	13ms	384 KiB		135 Bytes	2022-4-17 11:05:28
AC	王子航	13ms	6.6 MiB	C++17	113 Bytes	2024-7-21 15:07:26
AC	yanxiaosong	13ms	384 KiB		123 Bytes	2022-6-11 15:19:31
AC	jdy	13ms	384 KiB		142 Bytes	2022-6-11 15:18:25
AC	huyunyi23003	13ms	384 KiB		146 Bytes	2023-5-13 15:47:56
AC	杜俊宏	13ms	384 KiB		205 Bytes	2022-6-13 20:11:30
AC	赵彬鸿	13ms	384 KiB		114 Bytes	2022-6-11 15:19:03
AC	赵彬鸿	13ms	384 KiB		114 Bytes	2022-6-11 15:19:02
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	384 KiB		125 Bytes	2022-7-4 10:25:19
AC	李卓燃 (李卓燃1)	13ms	384 KiB		102 Bytes	2023-2-24 20:40:20
AC	王韵淮	13ms	384 KiB		244 Bytes	2022-4-17 11:08:23
AC	赵彬鸿	13ms	392 KiB		114 Bytes	2022-6-11 15:18:57
AC	时代二校-陈天成 (鸭缩毛巾)	13ms	384 KiB		127 Bytes	2023-5-20 15:26:53
AC	赵彬鸿	13ms	392 KiB		114 Bytes	2022-6-11 15:18:59
AC	panyan	13ms	436 KiB		141 Bytes	2022-6-11 15:17:50
AC	陈杰晟	13ms	424 KiB		125 Bytes	2022-5-29 11:05:44
AC	原著校区巫映秋 (巫映秋1a)	13ms	7 MiB	C++98	190 Bytes	2024-6-28 22:51:50
AC	何昊宇 (22016-hhy)	13ms	384 KiB		122 Bytes	2022-9-11 11:37:54
AC	赵彬鸿	13ms	392 KiB		114 Bytes	2022-6-11 15:19:01
AC	朱老师 (zyp)	13ms	384 KiB		235 Bytes	2023-5-13 15:47:57
AC	你爹 (郭铠嘉)	13ms	392 KiB		132 Bytes	2022-4-17 11:03:34
AC	赵泳鑫 (zhaoyongxin)	13ms	400 KiB		134 Bytes	2022-7-12 16:55:53
AC	曹埊睿 (caodirui)	13ms	392 KiB		117 Bytes	2023-4-21 18:39:37
AC	陈骏洋	13ms	512 KiB		153 Bytes	2022-4-17 11:06:29
AC	德意志第三帝国 (陈远桥)	13ms	384 KiB		153 Bytes	2022-4-17 11:07:09
AC	liangyuntian23003	13ms	392 KiB		131 Bytes	2023-5-13 15:48:07
AC	zyq1	13ms	396 KiB		210 Bytes	2023-4-3 21:07:47
AC	姚宏逸	13ms	392 KiB		139 Bytes	2022-3-21 10:12:00
AC	GYZ	13ms	392 KiB		132 Bytes	2022-5-25 18:55:05
AC	zhengjiaxiang	13ms	384 KiB		157 Bytes	2023-2-24 20:44:48
AC	赵彬鸿	13ms	432 KiB		114 Bytes	2022-6-11 15:19:00
AC	赵彬鸿	13ms	392 KiB		114 Bytes	2022-6-11 15:18:58
AC	赵彬鸿	13ms	392 KiB		114 Bytes	2022-6-11 15:18:57
AC	huanglu	13ms	7.2 MiB	C++98	184 Bytes	2024-5-17 14:22:26
AC	向俊熙 (xiangjunxi23003)	13ms	388 KiB		163 Bytes	2023-5-13 15:48:02
AC	赵彬鸿	13ms	412 KiB		114 Bytes	2022-6-11 15:18:58
AC	陈泰羽 (chentaiyu)	13ms	384 KiB		121 Bytes	2023-2-24 20:46:39
AC	赵彬鸿	13ms	384 KiB		114 Bytes	2022-6-11 15:18:57
AC	吴俊成 (wujuncheng)	13ms	436 KiB		137 Bytes	2022-7-11 20:11:08
AC	tongxiao	13ms	7.2 MiB	C++20(O2)	120 Bytes	2024-5-17 14:28:49
AC	赵彬鸿	13ms	392 KiB		114 Bytes	2022-6-11 15:19:02
AC	赵彬鸿	13ms	384 KiB		114 Bytes	2022-6-11 15:18:57
AC	朱老师 (zyp)	13ms	384 KiB		124 Bytes	2022-9-11 11:30:59
AC	何星震 (Jacob)	13ms	384 KiB		122 Bytes	2022-8-28 12:04:27
AC	赵彬鸿	13ms	392 KiB		114 Bytes	2022-6-11 15:19:00
AC	罗元邑2	13ms	512 KiB		104 Bytes	2023-4-1 11:14:30
AC	(张洛诚)	13ms	384 KiB		145 Bytes	2023-6-3 10:32:03
AC	赵沛喆	13ms	440 KiB		352 Bytes	2022-8-14 21:04:14
AC	只因 (yubohang23002)	13ms	384 KiB		146 Bytes	2023-5-13 15:47:59
AC	luoluonuoya	13ms	440 KiB		214 Bytes	2022-5-8 15:12:51
AC	Randy Marsh (杨子腾)	14ms	384 KiB		172 Bytes	2022-4-17 11:04:23
AC	22016-oyc	14ms	384 KiB		117 Bytes	2022-9-11 11:32:05
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)	14ms	400 KiB		118 Bytes	2023-5-20 13:02:16
AC	何昊宇 (22016-hhy)	14ms	392 KiB		122 Bytes	2022-9-11 11:37:44
AC	李山水	14ms	384 KiB		132 Bytes	2022-7-30 11:57:21
AC	xiangsiyu	14ms	512 KiB		163 Bytes	2022-7-4 8:21:18
AC	赵彬鸿	14ms	392 KiB		114 Bytes	2022-6-11 15:19:02
AC	pandap&a王皓宸 (WANGHAOCHEN)	14ms	512 KiB		222 Bytes	2023-4-8 8:33:16
AC	赵彬鸿	14ms	384 KiB		114 Bytes	2022-6-11 15:18:59
AC	爱琴海校区jzn (jzn)	14ms	496 KiB		134 Bytes	2023-4-1 11:15:34
AC	kql1	14ms	7.1 MiB	C++98	134 Bytes	2024-5-9 13:39:32
AC	赵彬鸿	14ms	384 KiB		114 Bytes	2022-6-11 15:19:02
AC	陈骏洋	14ms	384 KiB		135 Bytes	2022-4-17 11:05:46
AC	赵彬鸿	14ms	392 KiB		114 Bytes	2022-6-11 15:18:59
AC	qinlang	14ms	6.8 MiB		148 Bytes	2023-10-19 19:52:03
AC	wangziji	14ms	392 KiB		120 Bytes	2022-8-28 12:01:46
AC	hyh	14ms	384 KiB		115 Bytes	2023-4-1 11:20:57
AC	22016-ggs	14ms	384 KiB		1.2 KiB	2022-9-11 11:32:47
AC	何欣洋	14ms	384 KiB		141 Bytes	2023-4-1 11:22:57
AC	陈于硕(我™的) (chenyu)	14ms	392 KiB		131 Bytes	2023-4-1 11:34:10
AC	甄一阳 (22016-zyy)	14ms	440 KiB		116 Bytes	2022-9-11 11:28:50
AC	chenyantong	14ms	384 KiB		168 Bytes	2023-2-24 20:48:56
AC	新壹街校区-杨轩懿 (杨轩懿1)	14ms	6.9 MiB		202 Bytes	2023-7-25 13:01:06
AC	赵彬鸿	14ms	384 KiB		114 Bytes	2022-6-11 15:18:58
AC	yiqiuyu	14ms	436 KiB		131 Bytes	2023-5-13 15:58:34
AC	郑岐蔚	14ms	436 KiB		141 Bytes	2023-2-11 12:51:43
AC	zhm123	14ms	436 KiB		139 Bytes	2023-2-3 18:35:18
AC	李树崑 (lishukun)	14ms	440 KiB		165 Bytes	2022-8-17 11:35:02
AC	爱情海校区—沙天一 (沙天一)	14ms	384 KiB		138 Bytes	2023-4-1 11:18:02
AC	李晨希	14ms	384 KiB		133 Bytes	2023-4-1 11:24:34
AC	南坪校区-郑力博 (zhenglibo23003)	14ms	392 KiB		134 Bytes	2023-5-13 15:47:17
AC	赵彬鸿	14ms	384 KiB		114 Bytes	2022-6-11 15:19:00
AC	源著校区-宋昊成 (马冬梅)	14ms	440 KiB		134 Bytes	2023-2-26 20:00:08
AC	爱琴海校区-胡靖欢 (胡靖欢1)	14ms	384 KiB		104 Bytes	2023-4-1 11:17:15
AC	SHY20091224	14ms	384 KiB		134 Bytes	2022-8-28 12:02:42
AC	朱老师 (zyp)	14ms	392 KiB		124 Bytes	2022-9-11 11:35:46
AC	疯神芭芭脱丝 (李卓修)	14ms	440 KiB		130 Bytes	2022-7-12 16:55:52
AC	樊竣熠 (lft1114)	14ms	436 KiB		124 Bytes	2022-8-13 16:34:49
AC	wzzjnb2012	15ms	440 KiB		145 Bytes	2022-10-6 12:17:53