陶陶摘苹果（升级版）

状态	递交者	时间	内存	语言	代码	递交时间
AC	luozixi	10ms	256 KiB		400 Bytes	2023-3-26 13:49:36
AC	白祖睿	17ms	6.6 MiB	C++98(O2)	658 Bytes	2024-7-12 11:04:31
AC	wangruibo20xh	18ms	512 KiB		373 Bytes	2022-3-5 19:26:34
AC	段淏泷	19ms	6.7 MiB	C++98	432 Bytes	2024-8-3 16:24:50
AC	芒苒忧 (廖迦南)	20ms	384 KiB		385 Bytes	2022-4-10 18:33:15
AC	赵泳鑫 (zhaoyongxin)	20ms	476 KiB		539 Bytes	2022-7-15 14:53:59
AC	1396013295	20ms	384 KiB		501 Bytes	2022-1-23 19:23:41
AC	疯神芭芭脱丝 (李卓修)	20ms	520 KiB		502 Bytes	2022-7-14 16:20:45
AC	zlx (xiao)	20ms	464 KiB		486 Bytes	2022-11-26 20:18:35
AC	余晨浩 (yuchenhao)	20ms	440 KiB		408 Bytes	2023-4-2 16:58:38
AC	zzzrrrxxx	20ms	7.2 MiB	C++98	403 Bytes	2024-4-27 9:23:39
AC	余龙恩---来自额嘛瑞卡 (yulongenshijieshangzuishuai)	20ms	384 KiB		472 Bytes	2022-1-23 10:46:58
AC	dengduxi	20ms	384 KiB		468 Bytes	2023-3-26 13:49:33
AC	colin1112 (墙凌可)	20ms	392 KiB		627 Bytes	2023-3-20 21:11:32
AC	MoonLight ( aaa)	21ms	460 KiB		744 Bytes	2022-8-11 9:43:43
AC	Tender. (05c05-zhou)	21ms	6.7 MiB		375 Bytes	2023-8-25 11:28:35
AC	李倾城的忠实假粉 (向熠可)	21ms	440 KiB		397 Bytes	2022-3-29 21:27:28
AC	郑栋文	21ms	460 KiB		408 Bytes	2022-4-10 15:58:42
AC	zjl	21ms	384 KiB		457 Bytes	2023-3-26 14:20:23
AC	樊竣熠 (lft1114)	21ms	512 KiB		431 Bytes	2022-8-3 14:47:09
AC	黄梓桐 (HuangZiTong)	22ms	392 KiB		515 Bytes	2023-3-26 13:54:21
AC	周琪渃	22ms	392 KiB		500 Bytes	2023-5-30 20:30:10
AC	RanHao	22ms	6.7 MiB		457 Bytes	2023-9-12 18:23:34
AC	时代一校 - 冯隆浩 (冯隆浩)	22ms	6.7 MiB		449 Bytes	2023-9-27 19:25:42
AC	11451254188 (22029-mjh)	22ms	6.7 MiB		414 Bytes	2023-6-7 21:45:15
AC	22029-lsl	22ms	6.8 MiB		408 Bytes	2023-6-10 9:49:35
AC	. (Pig)	22ms	384 KiB		459 Bytes	2022-8-28 15:00:08
AC	ttt123	22ms	6.8 MiB		511 Bytes	2023-6-10 9:49:55
AC	关博源	22ms	440 KiB		484 Bytes	2023-3-6 19:33:19
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)	23ms	6.8 MiB		424 Bytes	2023-6-10 9:49:54
AC	zcx	23ms	6.8 MiB		497 Bytes	2023-6-8 19:55:36
AC	梁金同 (liangjintong)	23ms	440 KiB		404 Bytes	2023-3-26 13:41:08
AC	蓝色妖姬 (jiangpeiyu)	23ms	512 KiB		452 Bytes	2022-11-7 9:45:00
AC	luoluonuoya	24ms	444 KiB		472 Bytes	2022-8-26 18:28:19
AC	zhm123	24ms	440 KiB		457 Bytes	2023-3-17 20:07:02
AC	陈风亦 (chenfengyi)	25ms	440 KiB		502 Bytes	2023-1-18 17:06:57
AC	火星伞宾——刘晏恺 (刘晏恺)	25ms	7.3 MiB		375 Bytes	2023-8-24 11:15:24
AC	希蒙 (zhengxingya)	25ms	6.7 MiB		506 Bytes	2023-9-27 17:08:09
AC	ttt123	26ms	6.8 MiB		486 Bytes	2023-6-9 21:55:40
AC	郑岐蔚	27ms	444 KiB		530 Bytes	2023-1-26 15:00:54
AC	zhouzipu	28ms	512 KiB		489 Bytes	2022-8-19 18:48:02
AC	22029-zjs	30ms	6.8 MiB		475 Bytes	2023-6-9 21:57:41
AC	CK (李弘毅)	33ms	6.9 MiB		511 Bytes	2023-11-17 20:33:36
AC	huyinuo	33ms	432 KiB		539 Bytes	2022-8-26 10:40:13
AC	xuniaoyin (徐袅音)	36ms	6.6 MiB	C++98(O2)	641 Bytes	2024-7-21 16:58:37
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	84ms	820 KiB		697 Bytes	2024-3-30 20:46:46
AC	时代一校石博文 (shibowen)	84ms	768 KiB		490 Bytes	2024-2-13 16:32:24
AC	朱老师 (zyp)	85ms	600 KiB		496 Bytes	2024-4-2 18:43:03
AC	曹雅萱	92ms	572 KiB	C++11	469 Bytes	2024-9-5 20:51:21
AC	姚宏逸	129ms	512 KiB		1 KiB	2022-2-11 19:36:31