「习题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	明轩 (吕同学)	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	陈诺	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	源著校区陈锐霖 (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	陈诺	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	AAA? (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	My name is Man (钟卓劭)	15ms	536 KiB		129 Bytes	2024-2-7 14:50:02
AC	何煜琦	15ms	532 KiB	C++11	123 Bytes	2024-9-12 15:00:46
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	时代1校-杨宇轩 (杨宇轩)	15ms	532 KiB	C++11	156 Bytes	2024-9-15 13:34:13
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	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	王祎辰 (wangyichen)	15ms	532 KiB		171 Bytes	2024-4-6 16:41:11
AC	Sivan	15ms	532 KiB	C++98(O2)	164 Bytes	2024-9-1 14:17:05
AC	新壹街校区-陈品烨 (陈品烨)	15ms	532 KiB	C++98	144 Bytes	2024-9-9 12:58:51
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		166 Bytes	2024-2-9 19:40:27
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	王子睿	16ms	532 KiB	C++98	132 Bytes	2024-9-1 8:53:10
AC	jdy	17ms	768 KiB		151 Bytes	2024-3-6 14:56:58
AC	wangzihang3	17ms	532 KiB		251 Bytes	2024-2-13 16:47:09
AC	曹雅萱	18ms	532 KiB	C++11	159 Bytes	2024-9-3 10:55:00
AC	孙启航	22ms	9.6 MiB	Python 3	64 Bytes	2024-6-23 15:17:50
AC	包卓轩123	23ms	9.6 MiB	Python 3	62 Bytes	2024-5-26 13:01:45
AC	Zongzi1	23ms	9.3 MiB	Python 3	118 Bytes	2024-7-16 15:15:32
AC	fcxin	23ms	9.3 MiB	Python 3	69 Bytes	2024-8-4 16:47:05
AC	叶睿	23ms	9.1 MiB	Python 3	83 Bytes	2024-5-4 13:03:32
AC	高俊	26ms	9.6 MiB	Python 3	96 Bytes	2023-11-11 15:50:21
AC	Greta	28ms	9.3 MiB	Python 3	179 Bytes	2024-5-18 15:18:28
AC	李yc	29ms	9.4 MiB	Python 3	92 Bytes	2024-6-27 20:10:15
AC	许祖睿	29ms	9.2 MiB	Python 3	208 Bytes	2024-5-18 18:17:37
AC	April	33ms	9.1 MiB	Python 3	114 Bytes	2023-11-5 19:36:07
AC	kongql	34ms	3.8 MiB	Python 3	66 Bytes	2022-6-12 11:18:56
AC	cola	34ms	3.9 MiB	Python 3	80 Bytes	2022-1-29 18:06:53
AC	陆琦澔	34ms	3.9 MiB	Python 3	62 Bytes	2022-5-14 11:46:31
AC	朱思衡	35ms	3.9 MiB	Python 3	195 Bytes	2022-12-6 22:14:12
AC	猫不理包子	35ms	3.9 MiB	Python 3	79 Bytes	2022-6-22 14:13:39
AC	11111	35ms	3.9 MiB	Python 3	101 Bytes	2022-1-24 20:24:51
AC	陈年保宁醋 (dengboren)	35ms	3.8 MiB	Python 3	89 Bytes	2022-1-22 19:41:09
AC	黄晗汐	35ms	3.9 MiB	Python 3	66 Bytes	2023-5-20 14:54:49
AC	孙烽轶 (sfy)	35ms	3.9 MiB	Python 3	137 Bytes	2022-2-19 17:32:16
AC	王晴萱	35ms	9.1 MiB	Python 3	62 Bytes	2023-7-4 9:52:39
AC	WHWHWHWHWHW (OP AI)	35ms	3.9 MiB	Python 3	67 Bytes	2023-6-2 19:29:54
AC	陈璟志 (cjz)	35ms	3.9 MiB	Python 3	102 Bytes	2022-12-4 14:33:08
AC	漩涡刺客	36ms	3.9 MiB	Python 3	121 Bytes	2022-3-17 12:30:06
AC	梨冻亿 (wiueh)	36ms	3.9 MiB	Python 3	209 Bytes	2022-1-22 18:01:15
AC	王晴萱	36ms	9 MiB	Python 3	62 Bytes	2023-7-4 9:51:43
AC	孙烽轶 (sfy)	36ms	3.9 MiB	Python 3	137 Bytes	2022-4-30 14:46:46
AC	马某克	36ms	4 MiB	Python 3	70 Bytes	2022-9-29 20:25:59
AC	liuyuchen	36ms	3.9 MiB	Python 3	131 Bytes	2022-6-29 14:25:21
AC	11111	36ms	3.9 MiB	Python 3	101 Bytes	2022-1-24 20:24:50
AC	cola	36ms	3.9 MiB	Python 3	65 Bytes	2022-1-29 17:21:45
AC	Wling	36ms	3.9 MiB	Python 3	61 Bytes	2022-10-30 16:50:32
AC	cola	36ms	3.9 MiB	Python 3	101 Bytes	2022-1-29 17:53:28
AC	王晴萱	36ms	9 MiB	Python 3	62 Bytes	2023-7-4 9:49:49
AC	scallway	36ms	3.9 MiB	Python 3	137 Bytes	2022-2-19 17:28:32