队列练习1

状态	递交者	时间	内存	语言	代码	递交时间
AC	zhm123	124ms	6.8 MiB		523 Bytes	2023-6-25 16:48:08
AC	新壹街校区-陈琬舒 (空空大师)	124ms	6.9 MiB		469 Bytes	2023-7-21 8:21:28
AC	新壹街——陈学彬 (BUG)	126ms	6.7 MiB		303 Bytes	2023-9-2 20:17:01
AC	黄梓轩 (huangzixuan)	126ms	6.8 MiB		373 Bytes	2023-7-16 13:49:48
AC	乐瀚阳 (yuehanyang)	127ms	6.8 MiB		531 Bytes	2023-6-15 19:28:11
AC	xyc (谢雨宸)	127ms	6.8 MiB		547 Bytes	2023-11-5 10:27:55
AC	希蒙 (zhengxingya)	129ms	6.8 MiB		408 Bytes	2023-10-21 9:33:20
AC	周琪渃	129ms	6.8 MiB		429 Bytes	2023-6-30 22:39:11
AC	王祎辰 (wangyichen)	130ms	6.8 MiB		572 Bytes	2023-7-16 13:37:11
AC	三差学生 (尘埃蓝莓)	131ms	7.9 MiB		508 Bytes	2023-7-7 13:55:48
AC	无尽的想象 (谭仕高)	133ms	6.9 MiB		332 Bytes	2023-6-24 16:25:26
AC	胡澜之 (666hlz666)	133ms	832 KiB		350 Bytes	2024-2-4 19:38:53
AC	何昊宇 (22016-hhy)	133ms	6.9 MiB		349 Bytes	2023-7-20 14:02:12
AC	leisixian (22029-lyh)	135ms	6.9 MiB		361 Bytes	2023-8-10 15:28:09
AC	许嘉恩 (xje22031)	137ms	6.9 MiB		480 Bytes	2023-8-21 10:33:35
AC	Jack	137ms	6.9 MiB		348 Bytes	2023-10-22 15:06:03
AC	时代一校-赵彦博 (zyb)	137ms	6.9 MiB		488 Bytes	2023-8-9 21:11:51
AC	zcx	138ms	7.5 MiB		305 Bytes	2023-7-4 17:38:14
AC	时代一校 - 冯隆浩 (冯隆浩)	138ms	6.9 MiB		310 Bytes	2023-7-15 11:30:38
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	138ms	6.7 MiB		241 Bytes	2023-8-27 15:55:06
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)	139ms	6.8 MiB		344 Bytes	2023-7-1 10:01:18
AC	坤坤荔枝小黑子 (zhonghaotian22006)	143ms	648 KiB		317 Bytes	2022-12-11 18:31:54
AC	唐一航	143ms	1 MiB	C++11	305 Bytes	2024-9-13 15:56:03
AC	时代二校-王盼兮 (wangpanxi)	143ms	7.1 MiB		542 Bytes	2023-12-24 11:13:59
AC	时代2校+涂彦迪 (tuyandi)	145ms	7 MiB		535 Bytes	2023-12-2 16:49:30
AC	三差学生(尘埃蓝莓) (白佳睿)	146ms	7.2 MiB		536 Bytes	2023-11-25 11:13:01
AC	张景豪	150ms	6.9 MiB		552 Bytes	2023-7-1 19:10:48
AC	张梓浩 (zhangzihao)	153ms	6.9 MiB		484 Bytes	2023-12-16 9:26:00
AC	时代二校-焦雨齐 (Angel)	163ms	7 MiB		641 Bytes	2023-12-2 16:42:41
AC	可爱的小花狗	167ms	7 MiB		632 Bytes	2023-12-2 16:58:13
AC	南坪校区—喻子峰 (yuzifeng23002)	177ms	6.9 MiB		322 Bytes	2023-11-25 18:11:20
AC	弹射起飞 ? 冲 ! (吴周周)	181ms	7 MiB		625 Bytes	2023-12-2 16:28:13
AC	wangjun	187ms	7 MiB		390 Bytes	2023-12-23 14:17:48
AC	牟淳雅	189ms	7.1 MiB		300 Bytes	2023-12-31 10:37:07
AC	新壹街校区-杨轩懿 (杨轩懿1)	191ms	7.1 MiB		338 Bytes	2023-12-3 10:40:21
AC	U城校区毕悦志 (byz)	191ms	7.2 MiB		616 Bytes	2023-12-31 17:33:50
AC	周靖淞 (zhoujingsong)	195ms	7.3 MiB		531 Bytes	2023-12-31 17:23:20
AC	周琳竣1	201ms	7 MiB		572 Bytes	2023-12-31 17:15:15
AC	zyz (曾韵竹)	202ms	7 MiB		500 Bytes	2023-12-31 17:23:09
AC	时代2校-程俊燃 (chengjunran)	207ms	6.9 MiB		563 Bytes	2023-12-2 16:46:56
AC	南坪校区-吴延衡 (小吴同学23003)	212ms	7.2 MiB		631 Bytes	2023-12-16 11:42:17
AC	时代二校+王吕棪 (wanglvyan)	214ms	7 MiB		526 Bytes	2023-12-2 16:51:37
AC	梨冻亿 (wiueh)	305ms	4.8 MiB	Python 3	189 Bytes	2022-1-23 20:42:01
AC	My name is Man (钟卓劭)	635ms	940 KiB		325 Bytes	2024-4-3 15:21:11
AC	王义苇 (wangyiwei)	638ms	964 KiB		348 Bytes	2024-4-6 9:35:33