单词的长度

状态	递交者	时间	内存	语言	代码	递交时间
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	6ms	256 KiB		273 Bytes	2022-1-23 18:47:51
AC	我推的乱破 (贺俊楠)	9ms	7.1 MiB		542 Bytes	2024-1-21 20:55:47
AC	汪致卉 (wangzh)	12ms	384 KiB		432 Bytes	2022-1-29 0:30:26
AC	Accepted (周芷乐)	13ms	6.7 MiB	C++14	315 Bytes	2024-7-20 12:35:25
AC	王韵淮	13ms	384 KiB		234 Bytes	2022-5-20 21:50:06
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	392 KiB		244 Bytes	2022-7-5 9:24:55
AC	赵沛喆	13ms	444 KiB		382 Bytes	2022-7-25 19:35:14
AC	Randy Marsh (杨子腾)	13ms	444 KiB		357 Bytes	2022-6-12 18:44:55
AC	赵泳鑫 (zhaoyongxin)	13ms	384 KiB		298 Bytes	2022-6-18 17:41:39
AC	冒牌陈杰晟【MOD】 (wed)	14ms	392 KiB		432 Bytes	2022-4-10 16:34:00
AC	杜俊宏	14ms	440 KiB		334 Bytes	2022-6-6 20:46:07
AC	文硕 (文硕1)	14ms	424 KiB		318 Bytes	2023-2-2 17:16:59
AC	黄梓桐 (HuangZiTong)	14ms	448 KiB		392 Bytes	2022-9-1 12:40:03
AC	Tang	14ms	384 KiB		252 Bytes	2022-5-14 9:53:31
AC	RanHao	14ms	6.9 MiB		280 Bytes	2023-8-18 17:54:16
AC	林凡童 (lft)	14ms	6.9 MiB		287 Bytes	2023-7-20 8:50:32
AC	李哲 (lizhe)	14ms	488 KiB		372 Bytes	2022-8-15 19:27:55
AC	李树崑 (lishukun)	14ms	432 KiB		202 Bytes	2022-8-16 11:44:58
AC	疯神芭芭脱丝 (李卓修)	14ms	440 KiB		298 Bytes	2022-7-12 11:41:46
AC	11451254188 (22029-mjh)	14ms	436 KiB		338 Bytes	2023-4-27 22:19:00
AC	樊竣熠 (lft1114)	14ms	512 KiB		354 Bytes	2023-2-9 11:11:49
AC	贾鑫豪 (Mr Sam)	15ms	440 KiB		308 Bytes	2022-3-3 22:00:28
AC	姚宏逸	15ms	440 KiB		488 Bytes	2022-2-17 19:16:21
AC	huyinuo	15ms	436 KiB		297 Bytes	2023-3-18 9:23:44
AC	朱老师 (zyp)	15ms	384 KiB		330 Bytes	2022-10-28 17:57:22
AC	爱琴海校区-黄辰浩 (huangchenhao)	15ms	8 MiB		615 Bytes	2023-8-22 17:09:14
AC	zlx (xiao)	16ms	432 KiB		308 Bytes	2022-11-27 12:13:27
AC	周琪渃	16ms	512 KiB		436 Bytes	2023-3-9 19:13:35
AC	李彭宋代诗人 (ljy123456)	16ms	512 KiB		408 Bytes	2023-3-22 16:21:18
AC	曾御城（现用名） (Jason)	16ms	6.9 MiB		419 Bytes	2023-8-8 21:07:45
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)	21ms	6.4 MiB		438 Bytes	2023-11-19 10:34:55
AC	经常消失 (小萝卜)	22ms	6.9 MiB		297 Bytes	2023-11-25 10:03:45
AC	阮 (媚狐不吃道旁李)	70ms	536 KiB		268 Bytes	2024-4-13 10:28:06
AC	zyl	74ms	764 KiB	C++11(O2)	267 Bytes	2024-10-12 18:34:46
AC	谭红中 (不知道)	211ms	3.9 MiB	Python 3	143 Bytes	2022-4-5 15:51:51
AC	梨冻亿 (wiueh)	214ms	3.9 MiB	Python 3	184 Bytes	2022-1-23 23:06:43
AC	爱琴海校区-刁钲洋 (刁钲洋)	216ms	4 MiB	Python 3	113 Bytes	2022-4-10 10:11:09
AC	戴玉彤	227ms	3.9 MiB	Python 3	135 Bytes	2022-4-10 15:50:08