斐波那契数列的第k项

状态	递交者	时间	内存	语言	代码	递交时间
AC	stehpen_zuo	14ms	6.9 MiB	C++20	403 Bytes	2024-5-26 16:08:04
AC	王乐仪	14ms	384 KiB		181 Bytes	2022-2-4 15:10:20
AC	WHWHWHWHWHW (OP AI)	14ms	6.9 MiB	C++98	214 Bytes	2024-6-26 19:10:43
AC	罗竣瀚	14ms	384 KiB		179 Bytes	2022-12-7 18:23:34
AC	霍弈丞小号	14ms	384 KiB		274 Bytes	2023-4-16 17:03:00
AC	余晨浩 (yuchenhao)	14ms	392 KiB		179 Bytes	2022-9-4 14:37:22
AC	余晨浩 (yuchenhao)	14ms	384 KiB		179 Bytes	2022-9-4 14:37:23
AC	scallway	14ms	396 KiB		213 Bytes	2023-2-2 20:42:10
AC	樊竣熠 (lft1114)	14ms	384 KiB		148 Bytes	2022-8-16 9:37:47
AC	double夏 (夏子一)	14ms	7.2 MiB	C++98	263 Bytes	2024-5-1 20:03:07
AC	陈杰晟	14ms	384 KiB		269 Bytes	2022-2-19 11:27:25
AC	时代2校+涂彦迪 (tuyandi)	14ms	6.9 MiB		183 Bytes	2023-10-21 16:11:58
AC	邵冠铖 (shaoguancheng22031)	14ms	6.8 MiB		183 Bytes	2023-6-14 21:07:20
AC	郑之策	14ms	384 KiB		201 Bytes	2022-5-22 11:00:28
AC	朱老师 (zyp)	14ms	6.8 MiB	C++11	336 Bytes	2024-6-1 17:40:03
AC	余晨浩 (yuchenhao)	14ms	392 KiB		179 Bytes	2022-9-4 14:37:24
AC	ttt123	14ms	384 KiB		283 Bytes	2022-11-26 11:31:35
AC	肖添宇	14ms	384 KiB		287 Bytes	2022-3-5 17:41:39
AC	我是个s* (lijinze)	14ms	384 KiB		254 Bytes	2023-5-20 14:25:33
AC	余晨浩 (yuchenhao)	14ms	384 KiB		179 Bytes	2022-9-4 14:37:26
AC	余晨浩 (yuchenhao)	14ms	392 KiB		179 Bytes	2022-9-4 14:37:22
AC	kql1	14ms	7.1 MiB	C++98	187 Bytes	2024-5-9 13:14:05
AC	郑之策	14ms	384 KiB		201 Bytes	2022-5-22 10:55:30
AC	李彦臻	14ms	436 KiB		231 Bytes	2022-11-24 10:05:16
AC	余晨浩 (yuchenhao)	14ms	384 KiB		179 Bytes	2022-9-4 14:37:24
AC	徐子恩 (Cow)	14ms	512 KiB		322 Bytes	2022-7-7 20:01:36
AC	22029-hqh	14ms	384 KiB		263 Bytes	2022-11-26 11:45:32
AC	龚信丞	14ms	7.2 MiB		202 Bytes	2023-6-10 19:24:10
AC	CK (李弘毅)	14ms	6.7 MiB		206 Bytes	2023-9-30 14:55:47
AC	靳博然 (jbr)	14ms	440 KiB		210 Bytes	2023-4-9 17:05:20
AC	时代一校林星宇 (lxy)	14ms	392 KiB		171 Bytes	2022-10-22 19:19:33
AC	新壹街-李昕宇 (李昕宇)	14ms	7.5 MiB	C++98	191 Bytes	2024-6-1 11:45:22
AC	朱老师 (zyp)	14ms	6.8 MiB		232 Bytes	2023-6-14 21:03:45
AC	无尽的想象 (谭仕高)	14ms	384 KiB		257 Bytes	2022-9-4 14:36:57
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		194 Bytes	2023-10-3 11:23:54
AC	源著校区-宋昊成 (马冬梅)	14ms	384 KiB		214 Bytes	2023-4-8 18:25:11
AC	郑之策	14ms	384 KiB		201 Bytes	2022-5-22 10:55:39
AC	zyz (曾韵竹)	14ms	6.9 MiB		174 Bytes	2023-11-19 16:42:40
AC	余晨浩 (yuchenhao)	14ms	384 KiB		179 Bytes	2022-9-4 14:37:26
AC	赵泳鑫 (zhaoyongxin)	14ms	384 KiB		196 Bytes	2022-1-26 14:43:56
AC	黄相茗	14ms	384 KiB		196 Bytes	2022-4-7 19:36:53
AC	李哲 (lizhe)	14ms	404 KiB		188 Bytes	2023-3-12 10:53:13
AC	Cristiano·Ronaldo (05c41-gmz)	14ms	432 KiB		193 Bytes	2022-7-27 13:42:25
AC	heyi	14ms	6.8 MiB	C++98(O2)	260 Bytes	2024-8-9 13:39:51
AC	郑之策	14ms	384 KiB		201 Bytes	2022-5-22 10:55:38
AC	朱老师 (zyp)	14ms	6.9 MiB	C++11	268 Bytes	2024-8-20 23:44:23
AC	xyc (谢雨宸)	14ms	6.7 MiB		212 Bytes	2023-9-27 20:36:40
AC	zzl	14ms	6.8 MiB		191 Bytes	2023-11-7 0:33:22
AC	余晨浩 (yuchenhao)	14ms	384 KiB		179 Bytes	2022-9-4 14:37:28
AC	时代二校+王吕棪 (wanglvyan)	14ms	6.8 MiB		190 Bytes	2023-10-21 16:06:55
AC	吴俊成 (wujuncheng)	14ms	384 KiB		344 Bytes	2022-7-9 22:26:34
AC	朱老师 (zyp)	14ms	384 KiB		198 Bytes	2022-7-16 14:31:18
AC	朱老师 (zyp)	14ms	6.9 MiB	C++11	292 Bytes	2024-8-21 9:49:28
AC	时代二校-焦雨齐 (Angel)	14ms	6.9 MiB		324 Bytes	2023-10-21 16:07:06
AC	李哲 (lizhe)	14ms	436 KiB		188 Bytes	2022-8-3 18:32:54
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	404 KiB		315 Bytes	2022-11-26 11:31:15
AC	luosifu22006	14ms	384 KiB		209 Bytes	2022-11-6 18:48:33
AC	我是周靖松长得帅 (mouyunqi)	14ms	384 KiB		179 Bytes	2023-5-27 13:53:14
AC	xflt_dyp	14ms	6.9 MiB		191 Bytes	2023-7-22 16:49:43
AC	新壹街校区-罗斤天 (罗斤天)	14ms	392 KiB		259 Bytes	2023-4-29 14:16:46
AC	余晨浩 (yuchenhao)	14ms	384 KiB		179 Bytes	2022-9-4 14:37:23
AC	朱老师 (zyp)	14ms	384 KiB		215 Bytes	2022-11-6 18:50:46
AC	chen (peter)	14ms	440 KiB		201 Bytes	2022-7-19 14:11:03
AC	leisixian (22029-lyh)	14ms	436 KiB		231 Bytes	2022-11-26 8:56:18
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	6.8 MiB		313 Bytes	2023-10-21 16:04:42
AC	22029-zjs	14ms	392 KiB		270 Bytes	2022-11-26 11:44:43
AC	代尚函笛卡尔 (daishanghan)	14ms	392 KiB		226 Bytes	2022-9-4 14:37:36
AC	林小博	14ms	384 KiB		218 Bytes	2022-11-26 14:22:30
AC	ycy	14ms	416 KiB		319 Bytes	2023-4-6 19:02:20
AC	余晨浩 (yuchenhao)	14ms	392 KiB		179 Bytes	2022-9-4 14:37:24
AC	王涵熙 (水煮大肠)	14ms	512 KiB		231 Bytes	2022-4-9 16:51:39
AC	余晨浩 (yuchenhao)	14ms	392 KiB		179 Bytes	2022-9-4 14:37:25
AC	源著校区-宋昊成 (马冬梅)	14ms	384 KiB		214 Bytes	2023-4-8 18:24:58
AC	牟淳雅	14ms	7.2 MiB		188 Bytes	2023-9-29 10:11:42
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	6.8 MiB		180 Bytes	2023-10-21 15:58:42
AC	yanglang	14ms	384 KiB		195 Bytes	2022-10-22 21:13:46
AC	时代一校 - 冯隆浩 (冯隆浩)	14ms	436 KiB		198 Bytes	2022-10-17 9:28:55
AC	周琪渃	14ms	384 KiB		232 Bytes	2022-12-24 17:56:26
AC	爱琴海校区-刁钲洋 (刁钲洋)	14ms	428 KiB		179 Bytes	2023-2-8 19:02:12
AC	时代2校-程俊燃 (chengjunran)	14ms	6.8 MiB		201 Bytes	2023-10-21 16:05:23
AC	余晨浩 (yuchenhao)	14ms	392 KiB		179 Bytes	2022-9-4 14:37:30
AC	黄立信	14ms	6.8 MiB		227 Bytes	2023-10-14 12:53:35
AC	luosifu22006	14ms	384 KiB		209 Bytes	2022-10-30 19:02:08
AC	新壹街-王智琦 (王智琦)	14ms	7.4 MiB	C++11	253 Bytes	2024-6-1 11:44:08
AC	关博源	14ms	408 KiB		218 Bytes	2023-3-11 9:24:16
AC	可爱的小花狗	14ms	7 MiB		218 Bytes	2023-10-21 16:07:52
AC	Mr_D	14ms	7.2 MiB	C++17	320 Bytes	2024-4-26 17:08:20
AC	新壹街校区-陈琬舒 (空空大师)	14ms	6.9 MiB		247 Bytes	2023-11-4 16:02:23
AC	新壹街校区-杨轩懿 (杨轩懿1)	14ms	6.8 MiB		215 Bytes	2023-9-29 11:43:59
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	384 KiB		333 Bytes	2022-11-26 11:32:02
AC	yang	14ms	384 KiB		193 Bytes	2022-8-16 15:15:42
AC	zhuqiwei22006	14ms	420 KiB		178 Bytes	2022-11-6 18:52:25
AC	wangyueru	14ms	6.9 MiB		217 Bytes	2023-6-9 19:37:35
AC	huanglu	14ms	512 KiB		487 Bytes	2023-4-26 17:03:47
AC	zhangxinyue	14ms	512 KiB		179 Bytes	2022-11-20 19:53:04
AC	在煎鱼的肖大总铳 (肖宇航)	14ms	7.1 MiB		316 Bytes	2023-9-24 11:07:15
AC	余晨浩 (yuchenhao)	14ms	392 KiB		179 Bytes	2022-9-4 14:37:22
AC	杨浩灵 (金坷拉)	14ms	436 KiB		191 Bytes	2023-1-4 23:27:11
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	384 KiB		218 Bytes	2022-11-6 18:53:38
AC	wuqi	14ms	448 KiB		232 Bytes	2022-9-17 14:17:00