「习题1-1」平均数（average ）

状态	递交者	时间	内存	语言	代码	递交时间
AC	李安桐23025	4ms	7 MiB		155 Bytes	2024-1-6 22:44:28
AC	徐伟宸 (徐伟宸1)	4ms	7.1 MiB		149 Bytes	2023-12-28 21:18:17
AC	¿¿¿??? (李睿瞳)	4ms	7.1 MiB		125 Bytes	2023-12-6 22:01:59
AC	曾龙兮	4ms	384 KiB		198 Bytes	2022-9-11 18:06:32
AC	yuhaodi	4ms	672 KiB		203 Bytes	2023-4-15 18:26:12
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)	4ms	432 KiB		164 Bytes	2022-11-30 18:41:38
AC	南坪校区-龙浩睿 (longhaorui)	4ms	7.2 MiB		146 Bytes	2023-12-31 15:53:22
AC	hyh	4ms	7.3 MiB		135 Bytes	2024-1-17 11:29:49
AC	许嘉恩 (xje22031)	4ms	384 KiB		135 Bytes	2022-12-1 17:46:45
AC	SB (mfy01)	4ms	412 KiB		147 Bytes	2022-12-5 8:56:34
AC	新壹街校区-吴鑫鹏 (吴鑫鹏)	5ms	436 KiB		170 Bytes	2022-12-2 20:25:08
AC	zhongjunxuan	5ms	7.2 MiB		144 Bytes	2023-12-30 12:33:28
AC	黄立信是XXS (吕同学)	5ms	7.1 MiB		177 Bytes	2024-1-22 14:12:57
AC	时代二校-王盼兮 (wangpanxi)	5ms	7.1 MiB		150 Bytes	2024-1-22 10:38:00
AC	zyl	5ms	7.3 MiB		151 Bytes	2024-1-3 15:21:47
AC	zhongjunxuan	6ms	7.2 MiB		145 Bytes	2023-12-29 18:16:32
AC	胡熙景	7ms	440 KiB		151 Bytes	2022-9-15 21:13:42
AC	黄鹏翰	7ms	7 MiB		116 Bytes	2024-1-12 19:15:52
AC	qinhaoxiang	7ms	7.1 MiB		177 Bytes	2024-1-20 14:01:56
AC	袁伟宸23025	8ms	6.8 MiB		167 Bytes	2023-11-22 19:36:46
AC	AI创客	8ms	6.5 MiB		138 Bytes	2023-11-16 19:30:27
AC	金沙校区-先珂熠 (九转大肠)	8ms	528 KiB		166 Bytes	2024-3-6 18:57:47
AC	wanghuaiying	8ms	6.8 MiB		173 Bytes	2023-12-2 10:35:04
AC	没有此人 (akm)	8ms	7 MiB		158 Bytes	2023-12-3 14:14:47
AC	ReFly (NKZKY)	8ms	6.9 MiB		133 Bytes	2023-11-27 20:48:44
AC	只因 (yubohang23002)	8ms	7 MiB		146 Bytes	2023-12-31 10:15:00
AC	王康瑞	9ms	7 MiB		183 Bytes	2023-12-23 11:19:53
AC	https://www.crazygames.com/game/merge-construct (陈诺)	9ms	7 MiB		154 Bytes	2023-12-16 14:26:46
AC	算法战神 (konglinghao)	12ms	536 KiB		155 Bytes	2024-4-9 8:30:34
AC	那吒 (yuchenyi23017)	12ms	7.2 MiB		161 Bytes	2023-11-25 23:28:43
AC	Guest	12ms	536 KiB	C++98(O2)	140 Bytes	2025-3-22 16:36:44
AC	源著校区陈锐霖 (13983855850)	13ms	532 KiB		155 Bytes	2024-3-26 21:13:41
AC	金沙-文豪 (wenhao)	13ms	532 KiB		174 Bytes	2024-4-6 9:57:40
AC	https://www.crazygames.com/game/merge-construct (陈诺)	14ms	7 MiB		158 Bytes	2023-12-16 14:31:35
AC	jianxinming	14ms	532 KiB		142 Bytes	2024-2-1 20:05:28
AC	李 (李恺伦)	14ms	320 KiB		145 Bytes	2024-3-24 16:17:04
AC	勾晨禹	14ms	604 KiB		171 Bytes	2024-4-3 17:25:55
AC	彭粤庭 (JJlinCN)	14ms	532 KiB		157 Bytes	2024-4-12 15:37:49
AC	wrz	14ms	532 KiB		150 Bytes	2024-3-8 15:41:41
AC	Ryan	14ms	532 KiB		119 Bytes	2024-3-3 16:53:16
AC	张瑞博	14ms	532 KiB		135 Bytes	2024-3-18 21:53:16
AC	杨骏逸	14ms	532 KiB		177 Bytes	2024-2-1 17:43:26
AC	无名之辈	14ms	532 KiB	C++14	143 Bytes	2025-2-19 20:49:07
AC	曼波（＾-＾） (hechenxuan23005)	14ms	532 KiB		142 Bytes	2024-2-6 16:07:04
AC	fjx	15ms	532 KiB		154 Bytes	2024-3-9 12:57:38
AC	朱印洹	15ms	532 KiB	C++17	142 Bytes	2025-2-12 19:54:14
AC	xsm梁家畅	15ms	532 KiB	C++98(O2)	170 Bytes	2025-1-14 19:45:54
AC	你个你怎么跟个一样 (钟卓劭)	15ms	536 KiB		129 Bytes	2024-2-7 14:50:02
AC	李晟熙	15ms	532 KiB	C++17	230 Bytes	2025-2-15 17:56:53
AC	1 (高梓睿23025)	15ms	764 KiB		196 Bytes	2024-4-14 13:51:41
AC	U城校区-邓皓月 (邓皓月)	15ms	528 KiB		157 Bytes	2024-2-20 20:35:48
AC	wuenzi	15ms	532 KiB		132 Bytes	2024-3-9 10:26:01
AC	Noah (mwx)	15ms	520 KiB		160 Bytes	2024-3-14 18:29:24
AC	shishen	15ms	532 KiB	C++98	153 Bytes	2025-2-11 18:09:26
AC	cola	15ms	532 KiB		154 Bytes	2024-3-8 15:23:23
AC	真的高兴(死)了 (huyunyi1)	15ms	552 KiB		141 Bytes	2024-2-16 20:31:48
AC	jiaozihuan	15ms	532 KiB	C++98(O2)	147 Bytes	2025-2-8 13:35:43
AC	王祎辰 (wangyichen)	15ms	532 KiB		171 Bytes	2024-4-6 16:41:11
AC	xsm陈思齐	15ms	532 KiB	C++98(O2)	165 Bytes	2025-1-20 12:55:55
AC	cainuoyan	15ms	532 KiB		122 Bytes	2024-4-13 15:42:07
AC	宋春霖	16ms	524 KiB		139 Bytes	2024-4-4 15:18:38
AC	jiangzhenghan	16ms	596 KiB		151 Bytes	2024-2-27 18:53:25
AC	赵奕铭	16ms	532 KiB		145 Bytes	2024-2-28 20:29:34
AC	张芮茜	16ms	532 KiB	C++11	148 Bytes	2025-1-18 14:59:45
AC	xsm王翊丞	16ms	768 KiB	C++98(O2)	161 Bytes	2025-3-23 11:16:59
AC	xpp	16ms	532 KiB	C++14(O2)	160 Bytes	2025-3-19 13:40:29
AC	xsm王墨宣	16ms	532 KiB	C++98(O2)	209 Bytes	2025-2-9 17:02:47
AC	xsm李晟睿	16ms	532 KiB	C++98(O2)	237 Bytes	2025-2-13 15:38:36
AC	金沙校区-先珂熠 (九转大肠)	16ms	532 KiB		166 Bytes	2024-2-9 19:40:27
AC	xsm杨一宸	16ms	532 KiB	C++98(O2)	179 Bytes	2025-3-22 17:28:30
AC	黄力宏	16ms	552 KiB	C++98(O2)	134 Bytes	2025-1-27 21:43:03
AC	xsm唐晨翔	16ms	532 KiB	C++98(O2)	137 Bytes	2025-3-22 16:53:13
AC	A小涂	16ms	756 KiB		128 Bytes	2024-3-2 7:47:31
AC	zhy123	16ms	532 KiB		134 Bytes	2024-3-29 7:47:46
AC	lwj	16ms	540 KiB	C++98(O2)	139 Bytes	2025-2-19 16:38:11
AC	马老师	16ms	532 KiB	C++14(O2)	148 Bytes	2025-3-22 14:03:54
AC	蒲昊	16ms	532 KiB	C++17	145 Bytes	2025-1-25 20:01:12
AC	xsm郑世檄	16ms	532 KiB	C++98(O2)	123 Bytes	2025-3-29 21:19:19
AC	xsm张弘毅	16ms	532 KiB	C++98(O2)	153 Bytes	2025-3-22 16:34:02
AC	xsm涂书菡	16ms	532 KiB	C++98(O2)	139 Bytes	2025-2-28 16:37:16
AC	xsm张近遥	16ms	532 KiB	C++98(O2)	122 Bytes	2025-3-18 21:34:56
AC	奶龙 (hterberjh4ewjn54hgbh4)	16ms	532 KiB	C++20(O2)	310 Bytes	2025-3-28 15:31:14
AC	xsm刘思锐	16ms	532 KiB	C++98(O2)	215 Bytes	2025-3-22 16:53:12
AC	xsm张智涵	16ms	532 KiB	C++98(O2)	140 Bytes	2025-3-22 16:41:21
AC	xsm朱楷瑞	16ms	532 KiB	C++98(O2)	163 Bytes	2025-3-22 16:34:34
AC	周子敬	16ms	532 KiB	C++98	140 Bytes	2025-3-27 19:01:57
AC	xsm刘芷彤	16ms	764 KiB	C++98(O2)	171 Bytes	2025-3-23 11:18:14
AC	王芃淏	16ms	548 KiB	C++98	151 Bytes	2025-1-11 13:29:29
AC	jdy	17ms	768 KiB		151 Bytes	2024-3-6 14:56:58
AC	孔崇安	17ms	532 KiB	C++98(O2)	122 Bytes	2025-3-12 20:18:06
AC	wangzihang3	17ms	532 KiB		251 Bytes	2024-2-13 16:47:09
AC	王子昕(scallway)	17ms	532 KiB	C++11	149 Bytes	2025-1-11 18:48:54
AC	zhaochenrui	17ms	764 KiB	C++98	142 Bytes	2025-3-23 15:53:04
AC	费治铭	17ms	532 KiB	C++98(O2)	164 Bytes	2025-3-4 13:45:07
AC	xsm池泓锐	17ms	532 KiB	C++98(O2)	152 Bytes	2025-3-22 17:30:27
AC	欧俊阳	17ms	540 KiB	C++98	276 Bytes	2025-3-1 15:59:47
AC	xsm何俊贤	17ms	536 KiB	C++98(O2)	174 Bytes	2025-3-11 17:27:41
AC	XSM熊瑾涵	17ms	552 KiB	C++98(O2)	136 Bytes	2025-3-19 17:28:15
AC	xsm陈信锴	17ms	532 KiB	C++98(O2)	163 Bytes	2025-3-23 11:16:45
AC	xsm孙张天逸	17ms	532 KiB	C++98(O2)	136 Bytes	2025-3-23 11:38:49