单词的长度

状态	递交者	时间	内存	语言	代码	递交时间
AC	の (魏子恒)	14ms	444 KiB		312 Bytes	2022-9-13 18:45:30
AC	姚宏逸	14ms	444 KiB		488 Bytes	2022-2-20 13:06:04
AC	熊奕博 (Mothefuck)	14ms	444 KiB		311 Bytes	2023-2-26 17:35:34
AC	吴俊成 (wujuncheng)	14ms	440 KiB		435 Bytes	2022-6-6 21:50:49
AC	程子杰 (05c41-czj)	14ms	436 KiB		276 Bytes	2022-7-27 11:11:09
AC	陈祖明	14ms	384 KiB		355 Bytes	2022-5-14 18:15:22
AC	凌肯 (lingken22006)	14ms	384 KiB		427 Bytes	2022-7-25 21:58:22
AC	谭懿轩 (yanyixuan)	14ms	384 KiB		249 Bytes	2022-8-23 18:16:48
AC	朱老师 (zyp)	14ms	7 MiB	C++11	271 Bytes	2024-6-6 19:41:40
AC	Jerry	14ms	392 KiB		245 Bytes	2022-4-27 19:39:20
AC	李树崑 (lishukun)	14ms	436 KiB		217 Bytes	2022-8-16 12:05:24
AC	毕浩宇 (bihaoyu)	14ms	6.8 MiB		298 Bytes	2023-10-18 20:09:23
AC	时代一校-赵彦博 (zyb)	14ms	512 KiB		261 Bytes	2023-2-7 14:54:23
AC	罗翌珂 (dangdang)	14ms	432 KiB		768 Bytes	2022-9-2 10:20:28
AC	朱老师 (zyp)	14ms	512 KiB		302 Bytes	2023-5-31 21:49:44
AC	天之渺 (05c41-dd)	14ms	512 KiB		276 Bytes	2022-11-6 11:41:51
AC	朱老师 (zyp)	14ms	440 KiB		286 Bytes	2022-7-31 16:22:18
AC	贾鑫豪 (Mr Sam)	14ms	512 KiB		308 Bytes	2022-3-3 22:00:19
AC	无尽的想象 (谭仕高)	14ms	512 KiB		304 Bytes	2022-8-30 21:02:30
AC	林靖明	14ms	436 KiB		384 Bytes	2023-1-30 20:35:40
AC	ttt123	14ms	444 KiB		292 Bytes	2023-2-22 14:24:47
AC	He Yiqi (和平精英)	14ms	384 KiB		389 Bytes	2022-2-22 22:11:57
AC	陈杰晟	14ms	392 KiB		423 Bytes	2022-2-13 12:09:38
AC	真的高兴(死)了 (huyunyi1)	14ms	7 MiB	C++11	246 Bytes	2024-6-6 19:41:52
AC	马渝杭 (mayuhang)	14ms	512 KiB		253 Bytes	2023-2-25 20:19:32
AC	ttt123	14ms	444 KiB		314 Bytes	2022-9-9 15:02:56
AC	(05c35-cyd)	14ms	392 KiB		305 Bytes	2022-11-6 11:50:53
AC	德意志第三帝国 (陈远桥)	14ms	444 KiB		293 Bytes	2022-6-5 18:59:53
AC	Randy Marsh (杨子腾)	14ms	448 KiB		357 Bytes	2023-4-29 17:43:18
AC	huanglu	14ms	432 KiB		452 Bytes	2022-9-23 13:00:28
AC	爱琴海校区-黄辰浩 (huangchenhao)	15ms	8 MiB		615 Bytes	2023-8-22 17:08:33
AC	欧俊阳	15ms	6.7 MiB		298 Bytes	2023-8-24 15:24:09
AC	scallway	15ms	428 KiB		286 Bytes	2023-4-14 16:31:55
AC	凌肯 (lingken22006)	15ms	392 KiB		427 Bytes	2022-7-25 21:58:22
AC	林凡童 (lft)	15ms	7 MiB		287 Bytes	2023-7-15 14:01:47
AC	繁星 (05c35-zzm)	15ms	436 KiB		293 Bytes	2022-11-6 11:39:43
AC	缥 (王硕2012)	15ms	452 KiB		498 Bytes	2023-3-5 20:07:55
AC	偽艺術家 (chenyanchi22006)	15ms	436 KiB		284 Bytes	2022-7-18 11:09:48
AC	陈雨泽1	15ms	436 KiB		282 Bytes	2023-1-31 17:54:55
AC	刘政君 (lzj)	15ms	512 KiB		422 Bytes	2022-9-15 22:29:19
AC	时代校区-刘臣原 (微笑王子)	15ms	384 KiB		292 Bytes	2022-9-7 19:03:41
AC	wangruibo20xh	15ms	436 KiB		312 Bytes	2022-2-12 19:09:49
AC	朱老师 (zyp)	15ms	432 KiB		311 Bytes	2022-8-10 15:34:51
AC	luoluonuoya	15ms	440 KiB		588 Bytes	2022-3-20 14:25:15
AC	22016-yzq	15ms	392 KiB		290 Bytes	2022-12-4 9:55:28
AC	RanHao	15ms	6.9 MiB		280 Bytes	2023-7-26 11:29:50
AC	MoonLight ( aaa)	15ms	512 KiB		312 Bytes	2022-4-28 20:58:15
AC	周琪渃	15ms	384 KiB		381 Bytes	2023-1-4 18:38:29
AC	iLansensei (hjs(Caster))	15ms	512 KiB		301 Bytes	2022-11-6 10:45:06
AC	86想要钱 (twt)	15ms	384 KiB		343 Bytes	2022-12-4 18:35:47
AC	wangruibo20xh	15ms	6.8 MiB		172 Bytes	2023-11-7 15:58:34
AC	https://www.minecraft.net/zh-hans (王振西)	15ms	6.8 MiB		326 Bytes	2023-6-18 22:49:07
AC	Nico	15ms	6.8 MiB	C++11	317 Bytes	2024-6-28 11:32:16
AC	cupy战士 (05c05-dkf)	15ms	6.9 MiB		359 Bytes	2023-9-24 11:45:23
AC	zhangzhimo	15ms	424 KiB		488 Bytes	2022-12-3 15:58:43
AC	xuniaoyin (徐袅音)	15ms	6.9 MiB		393 Bytes	2023-7-28 11:07:19
AC	SB (mfy01)	15ms	444 KiB		318 Bytes	2023-2-3 17:50:58
AC	Alduin	15ms	440 KiB		326 Bytes	2023-2-26 17:29:04
AC	章愉霖	15ms	444 KiB		376 Bytes	2023-5-21 17:42:46
AC	杨坤霖 (steven)	15ms	384 KiB		415 Bytes	2023-1-15 15:37:06
AC	许嘉恩 (xje22031)	15ms	392 KiB		276 Bytes	2023-1-8 11:54:52
AC	周琪渃	15ms	440 KiB		379 Bytes	2023-1-4 18:37:56
AC	22029-zjs	15ms	392 KiB		343 Bytes	2022-12-17 11:33:38
AC	蒲梓勋 (puzixun)	15ms	384 KiB		242 Bytes	2022-10-16 16:16: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)	15ms	440 KiB		414 Bytes	2022-12-24 11:18:07
AC	10255	15ms	384 KiB		310 Bytes	2022-12-21 20:11:43
AC	杨浩灵 (金坷拉)	15ms	512 KiB		373 Bytes	2023-4-15 16:17:26
AC	胡宸华 (huchenhua)	15ms	7.7 MiB		504 Bytes	2023-7-12 10:55:31
AC	Z.饮月君 (张皓南)	15ms	428 KiB		251 Bytes	2022-10-30 17:59:27
AC	我很6 (zjj22031)	16ms	408 KiB		338 Bytes	2023-1-8 11:51:40
AC	时代一校-王宥量 (wangyouliang)	16ms	512 KiB		316 Bytes	2022-12-8 19:31:09
AC	炸鱼4000+ (dxc)	16ms	7.3 MiB		302 Bytes	2023-7-5 10:50:26
AC	新壹街-张博涵 (张博涵)	16ms	6.9 MiB		401 Bytes	2023-8-10 14:16:57
AC	纪承熙 (jcx001)	16ms	512 KiB		357 Bytes	2022-11-17 11:23:25
AC	SYH.邵允涵 (Zoe邵)	16ms	6.7 MiB		294 Bytes	2023-3-17 20:39:52
AC	李彭宋代诗人 (ljy123456)	16ms	512 KiB		408 Bytes	2023-3-22 16:05:24
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	16ms	512 KiB		354 Bytes	2022-12-31 17:05:19
AC	我是个s* (lijinze)	16ms	6.8 MiB		291 Bytes	2023-6-28 15:07:54
AC	zry	16ms	512 KiB		299 Bytes	2022-11-6 9:53:00
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	7 MiB		326 Bytes	2023-12-19 19:27:39
AC	Nico	16ms	6.9 MiB		304 Bytes	2023-8-10 14:02:56
AC	ttt123	16ms	440 KiB		284 Bytes	2022-12-16 16:57:47
AC	巨珩宇	16ms	6.8 MiB		323 Bytes	2023-8-26 16:30:27
AC	本人天生贪生pass (05c41-cqs)	16ms	384 KiB		249 Bytes	2022-11-6 11:39:57
AC	Tender. (05c05-zhou)	16ms	436 KiB		356 Bytes	2022-10-19 21:54:47
AC	杨颂恩 (yangsongen)	17ms	6.9 MiB		266 Bytes	2023-8-19 19:14:53
AC	汤杰尧 (05c05-tjy1)	17ms	436 KiB		331 Bytes	2022-11-4 22:26:14
AC	zcx	17ms	440 KiB		268 Bytes	2022-12-17 11:31:40
AC	我是个s* (lijinze)	17ms	6.9 MiB		291 Bytes	2023-8-3 11:42:21
AC	11451254188 (22029-mjh)	17ms	436 KiB		269 Bytes	2022-12-17 11:44:53
AC	22029-lsl	17ms	400 KiB		301 Bytes	2022-12-17 11:41:20
AC	杨坤霖 (steven)	17ms	512 KiB		415 Bytes	2023-1-15 15:37:04
AC	叶雨昊 (yeyuhao22006)	18ms	440 KiB		271 Bytes	2022-10-24 19:53:19
AC	leisixian (22029-lyh)	18ms	440 KiB		269 Bytes	2022-12-13 11:49:08
AC	朱老师 (zyp)	18ms	444 KiB		318 Bytes	2023-1-8 11:46:01
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	19ms	432 KiB		251 Bytes	2022-12-17 11:33:26
AC	甄一阳 (22016-zyy)	19ms	448 KiB		267 Bytes	2022-11-24 16:51:26
AC	wangzihang	20ms	6.9 MiB		237 Bytes	2023-12-16 20:51:30
AC	周浩楠 (开朗的周好难)	21ms	7 MiB		281 Bytes	2023-12-7 20:54:06
AC	zyl	22ms	7.3 MiB		267 Bytes	2024-1-6 14:16:54