希蒙捡树枝

状态	递交者	时间	内存	语言	代码	递交时间
AC	miku (阳沐珊)	5ms	6.6 MiB		277 Bytes	2023-6-3 20:39:04
AC	我很6 (zjj22031)	5ms	392 KiB		303 Bytes	2023-1-10 11:00:23
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)	5ms	6.9 MiB		253 Bytes	2023-8-10 18:36:41
AC	新壹街校区-冉睦阳 (冉睦阳)	5ms	6.8 MiB		282 Bytes	2023-6-28 13:49:39
AC	chenyantong	5ms	428 KiB		245 Bytes	2023-3-17 20:46:30
AC	时代2校+施皓宬 (shihaocheng)	5ms	6.9 MiB		259 Bytes	2023-7-22 16:13:28
AC	chenrunxiang22031	5ms	384 KiB		313 Bytes	2023-1-10 10:59:07
AC	zzl	5ms	432 KiB		295 Bytes	2023-2-16 17:56:49
AC	我很6 (zjj22031)	5ms	384 KiB		303 Bytes	2023-1-10 10:57:20
AC	我很6 (zjj22031)	5ms	392 KiB		303 Bytes	2023-1-10 11:00:31
AC	scallway	5ms	440 KiB		306 Bytes	2022-11-25 17:51:33
AC	zhm123	5ms	416 KiB		304 Bytes	2023-3-10 11:29:24
AC	我很6 (zjj22031)	5ms	384 KiB		303 Bytes	2023-1-10 11:00:24
AC	时代1校-杨宇轩 (杨宇轩)	5ms	6.6 MiB		295 Bytes	2023-8-22 12:32:48
AC	我很6 (zjj22031)	5ms	392 KiB		303 Bytes	2023-1-10 11:00:23
AC	阮 (媚狐不吃道旁李)	5ms	7.2 MiB	C++98	331 Bytes	2024-5-18 16:41:00
AC	没有此人 (akm)	5ms	6.9 MiB		332 Bytes	2023-7-2 19:11:59
AC	朱老师 (zyp)	5ms	384 KiB		318 Bytes	2023-1-10 10:54:07
AC	我很6 (zjj22031)	5ms	384 KiB		303 Bytes	2023-1-10 11:00:31
AC	我很6 (zjj22031)	5ms	384 KiB		303 Bytes	2023-1-10 11:00:24
AC	可爱的小花狗	5ms	7.5 MiB		306 Bytes	2023-7-2 17:49:01
AC	岳鑫正	5ms	6.9 MiB		372 Bytes	2023-6-28 16:31:52
AC	lizhengqian19	5ms	6.8 MiB		333 Bytes	2023-6-12 16:01:48
AC	我很6 (zjj22031)	5ms	384 KiB		303 Bytes	2023-1-10 11:00:25
AC	时代2校+涂彦迪 (tuyandi)	5ms	7 MiB		297 Bytes	2023-7-19 16:32:04
AC	时代二校-焦雨齐 (Angel)	5ms	6.9 MiB		305 Bytes	2023-7-22 16:20:02
AC	陈骏逸 (chenjunyi)	5ms	436 KiB		319 Bytes	2022-10-13 21:26:40
AC	爱琴海校区-刁钲洋 (刁钲洋)	5ms	512 KiB		291 Bytes	2023-3-5 13:14:46
AC	时代二校-焦雨齐 (Angel)	5ms	6.9 MiB		287 Bytes	2023-6-24 17:40:52
AC	李卓燃 (李卓燃1)	5ms	512 KiB		277 Bytes	2023-3-17 20:44:10
AC	我很6 (zjj22031)	5ms	384 KiB		303 Bytes	2023-1-10 11:00:24
AC	胡澜之 (666hlz666)	5ms	6.8 MiB		330 Bytes	2023-6-8 21:59:59
AC	王玺懿 (wxy)	5ms	428 KiB		574 Bytes	2022-9-25 12:19:19
AC	我很6 (zjj22031)	5ms	392 KiB		303 Bytes	2023-1-10 11:00:23
AC	我很6 (zjj22031)	5ms	384 KiB		303 Bytes	2023-1-10 11:00:23
AC	爱琴海校区-刁钲洋 (刁钲洋)	5ms	384 KiB		291 Bytes	2023-3-5 13:14:46
AC	陈家齐 (陈家齐1)	5ms	7 MiB		373 Bytes	2023-7-6 9:54:56
AC	安闵煜 (anzai)	5ms	6.7 MiB		400 Bytes	2023-6-4 10:23:45
AC	邵冠铖 (shaoguancheng22031)	5ms	384 KiB		213 Bytes	2023-1-11 16:53:00
AC	huyinuo	5ms	512 KiB		253 Bytes	2023-1-10 20:23:15
AC	zzzrrrxxx	6ms	6.9 MiB	C++98	228 Bytes	2024-8-21 17:48:16
AC	wanghuaiying	7ms	7 MiB		243 Bytes	2023-12-29 18:53:57
AC	RanHao	8ms	7 MiB		244 Bytes	2023-12-28 17:16:12
AC	wangjun	8ms	7.2 MiB		323 Bytes	2023-11-30 12:21:43
AC	爱琴海校区-刁钲洋 (刁钲洋)	9ms	384 KiB		291 Bytes	2023-3-5 13:14:46
AC	张三	17ms	6.9 MiB		245 Bytes	2023-11-27 14:45:04
AC	jdy	20ms	532 KiB		355 Bytes	2024-3-12 19:52:01
AC	yuchenyi23017	21ms	532 KiB		294 Bytes	2024-1-28 15:59:26