有几声蛙叫

状态	递交者	时间	内存	语言	代码	递交时间
AC	田信 (tianxincn1)	2ms	440 KiB		144 Bytes	2022-2-19 10:09:35
AC	zhuqiwei22006	2ms	384 KiB		136 Bytes	2022-4-13 20:27:33
AC	傀儡师 (zhujingen)	2ms	6.9 MiB	C++11	147 Bytes	2024-6-20 17:28:04
AC	时代一校-赵彦博 (zyb)	2ms	6.6 MiB		146 Bytes	2023-9-17 21:40:43
AC	大马猴 (周琳竣)	2ms	6.8 MiB		163 Bytes	2023-8-9 10:13:59
AC	一片落叶 (yeyuhao)	2ms	6.7 MiB		140 Bytes	2023-8-24 14:40:54
AC	草\|\|草 (陈星佑)	2ms	384 KiB		140 Bytes	2022-8-20 16:29:18
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)	2ms	512 KiB		151 Bytes	2023-4-23 19:58:48
AC	詹宇航 (zyh7)	2ms	392 KiB		132 Bytes	2022-3-27 20:52:07
AC	hrz923	2ms	6.9 MiB		193 Bytes	2023-8-14 10:20:11
AC	朱泽晟	2ms	384 KiB		146 Bytes	2022-1-24 11:07:21
AC	HIMMZXC	2ms	384 KiB		208 Bytes	2022-3-5 14:57:05
AC	dafu	2ms	384 KiB		147 Bytes	2023-4-5 10:21:22
AC	李林峰 (金克拉)	2ms	384 KiB		193 Bytes	2022-12-9 18:58:55
AC	坤坤荔枝小黑子 (zhonghaotian22006)	2ms	436 KiB		165 Bytes	2022-9-6 20:27:05
AC	江子墨	2ms	6.8 MiB	C++98	151 Bytes	2024-6-7 15:34:32
AC	Ruler (05c35-hjs)	2ms	384 KiB		176 Bytes	2022-5-8 8:58:36
AC	Jose (反恐皮蛋)	2ms	384 KiB		310 Bytes	2023-4-22 9:41:45
AC	朱老师 (zyp)	2ms	384 KiB		168 Bytes	2023-2-25 17:16:20
AC	enen	2ms	384 KiB		152 Bytes	2023-4-8 11:35:11
AC	芒苒忧 (廖迦南)	2ms	384 KiB		162 Bytes	2022-1-25 14:30:10
AC	yixingyou	2ms	412 KiB		141 Bytes	2022-7-2 17:36:33
AC	王科睿 (鲨凋的小鲨鱼)	2ms	384 KiB		281 Bytes	2022-4-12 16:59:37
AC	连弘锐	2ms	380 KiB		141 Bytes	2022-7-7 20:29:10
AC	JOKER (hhy)	3ms	384 KiB		122 Bytes	2023-4-8 12:15:46
AC	一个小黑	3ms	6.8 MiB		140 Bytes	2023-9-24 15:23:58
AC	SMIK	3ms	432 KiB		164 Bytes	2022-1-19 14:13:47
AC	程子杰 (05c41-czj)	3ms	432 KiB		149 Bytes	2022-6-4 19:02:56
AC	苏庭毅	3ms	420 KiB		151 Bytes	2023-2-11 19:52:48
AC	牟淳雅	3ms	6.6 MiB		165 Bytes	2023-9-17 19:33:39
AC	杨洋	3ms	7.2 MiB	C++98	143 Bytes	2024-4-21 14:13:11
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	3ms	384 KiB		152 Bytes	2022-7-7 18:42:39
AC	CK (李弘毅)	3ms	384 KiB		162 Bytes	2022-6-30 8:02:49
AC	时代2校-程俊燃 (chengjunran)	3ms	440 KiB		140 Bytes	2023-4-19 18:22:50
AC	sb (吴振宇)	3ms	512 KiB		154 Bytes	2022-12-3 16:38:01
AC	郭睿	3ms	6.9 MiB	C++98	151 Bytes	2024-5-25 13:15:39
AC	王星皓	3ms	384 KiB		148 Bytes	2022-3-6 10:59:42
AC	暗蛆突围 (lzh)	3ms	6.8 MiB		160 Bytes	2023-10-28 23:58:08
AC	wzzjnb2012	3ms	392 KiB		167 Bytes	2022-9-20 22:16:30
AC	huanghaoming	3ms	436 KiB		155 Bytes	2022-8-18 21:17:24
AC	我是蔡徐坤 (任晋辉)	3ms	6.8 MiB		139 Bytes	2023-10-4 12:06:16
AC	魏楚浔 (shawn)	3ms	384 KiB		141 Bytes	2022-5-15 20:30:11
AC	鲜榨大肠汁	3ms	380 KiB		168 Bytes	2022-3-9 21:06:22
AC	王科睿 (鲨凋的小鲨鱼)	3ms	384 KiB		281 Bytes	2022-4-12 16:59:42
AC	xzf	3ms	6.9 MiB		168 Bytes	2023-7-17 20:14:28
AC	Ronnie	3ms	440 KiB		166 Bytes	2022-2-27 9:44:33
AC	Steven (王梓丞)	3ms	392 KiB		155 Bytes	2022-6-4 14:06:36
AC	zxccv	3ms	384 KiB		202 Bytes	2022-1-22 18:15:05
AC	叶雨昊 (yeyuhao22006)	3ms	384 KiB		185 Bytes	2022-11-15 14:32:31
AC	灿灿 (CAN)	3ms	384 KiB		156 Bytes	2022-5-14 18:39:22
AC	金锦泽 (jinjinze)	3ms	6.8 MiB		169 Bytes	2023-10-4 13:00:31
AC	熊瑾瑜	3ms	428 KiB		131 Bytes	2023-2-25 12:11:19
AC	梨冻亿 (wiueh)	3ms	392 KiB		161 Bytes	2022-1-22 19:37:50
AC	朱老师 (zyp)	3ms	384 KiB		148 Bytes	2023-2-25 17:29:02
AC	He Yiqi (和平精英)	3ms	392 KiB		161 Bytes	2022-2-11 19:25:47
AC	advent259	3ms	7.2 MiB	C++14(O2)	200 Bytes	2024-5-16 16:52:19
AC	彭崇鑫	3ms	412 KiB		154 Bytes	2022-7-9 17:26:43
AC	chenyifei	3ms	368 KiB		162 Bytes	2022-3-26 17:43:59
AC	苏庭毅	3ms	444 KiB		151 Bytes	2023-3-30 18:33:13
AC	游智棋	3ms	6.9 MiB		148 Bytes	2023-7-12 8:36:09
AC	wuqilin	3ms	384 KiB		160 Bytes	2022-11-27 15:59:26
AC	时代一校林星宇 (lxy)	3ms	384 KiB		154 Bytes	2022-7-2 19:38:13
AC	陈家熠	3ms	6.9 MiB	C++98	161 Bytes	2024-5-21 17:10:39
AC	朱老师 (zyp)	3ms	384 KiB		151 Bytes	2023-2-25 17:31:04
AC	明轩 (吕同学)	3ms	384 KiB		149 Bytes	2022-9-9 23:07:20
AC	傅博涛	3ms	384 KiB		131 Bytes	2022-1-24 11:15:30
AC	陈年保宁醋 (dengboren)	3ms	384 KiB		137 Bytes	2022-1-15 20:21:50
AC	陈玺宇	3ms	6.7 MiB		168 Bytes	2023-8-27 17:57:38
AC	李彭宋代诗人 (ljy123456)	3ms	384 KiB		146 Bytes	2023-4-3 20:58:20
AC	雷承翰1	3ms	368 KiB		137 Bytes	2023-2-11 19:53:27
AC	李书翰 (lishuhan)	3ms	444 KiB		141 Bytes	2022-7-31 10:12:09
AC	WangXi	3ms	384 KiB		171 Bytes	2022-9-17 19:06:42
AC	x0l0x	3ms	6.8 MiB		146 Bytes	2023-10-9 17:02:45
AC	郭睿	3ms	6.6 MiB	C++98	151 Bytes	2024-7-9 22:13:34
AC	stehpen_zuo	3ms	7.2 MiB	C++98	283 Bytes	2024-5-11 20:03:53
AC	科比.布莱恩特 (董浩琰)	3ms	384 KiB		135 Bytes	2023-2-11 20:12:49
AC	许子衿	3ms	7.1 MiB	C++98(O2)	142 Bytes	2024-5-17 21:32:20
AC	周米骐 (zsb)	3ms	6.9 MiB		134 Bytes	2023-7-18 10:53:38
AC	吴沛宸	3ms	7 MiB	C++11	247 Bytes	2024-6-15 14:06:51
AC	qwertyuiop	3ms	384 KiB		141 Bytes	2022-2-18 19:23:17
AC	向俊熙 (xiangjunxi23003)	3ms	384 KiB		172 Bytes	2023-2-25 17:13:30
AC	许嘉恩 (xje22031)	3ms	384 KiB		153 Bytes	2022-10-17 21:48:40
AC	陈秋石	3ms	384 KiB		173 Bytes	2022-3-6 10:54:46
AC	11111	3ms	440 KiB		292 Bytes	2022-2-22 19:51:29
AC	陈骏逸 (chenjunyi)	3ms	384 KiB		136 Bytes	2022-7-15 19:49:22
AC	05c05-lyx	3ms	392 KiB		162 Bytes	2022-6-5 16:15:56
AC	My name is Man (钟卓劭)	3ms	7 MiB	C++98	142 Bytes	2024-6-23 14:18:49
AC	郭益豪（帅哥） (guoyihao)	3ms	6.9 MiB	C++98	147 Bytes	2024-5-21 17:14:25
AC	呵呵呵 (陈思琦)	3ms	384 KiB		149 Bytes	2022-7-2 17:22:51
AC	纪承熙 (jcx001)	3ms	436 KiB		173 Bytes	2023-4-22 19:23:28
AC	ttt123	3ms	388 KiB		148 Bytes	2023-4-19 22:49:11
AC	呵呵呵 (陈思琦)	3ms	392 KiB		149 Bytes	2022-7-2 17:22:53
AC	Tang	3ms	384 KiB		156 Bytes	2022-7-2 20:28:56
AC	陈杰晟	3ms	440 KiB		154 Bytes	2022-2-17 15:26:41
AC	李睿杰	3ms	384 KiB		151 Bytes	2022-9-11 20:04:53
AC	曾龙兮	3ms	392 KiB		142 Bytes	2023-2-19 17:15:18
AC	wangxingyue	3ms	384 KiB		156 Bytes	2022-6-12 14:32:44
AC	许嘉恩 (xje22031)	3ms	384 KiB		153 Bytes	2022-10-17 21:48:39
AC	伍芷函	3ms	400 KiB		158 Bytes	2022-3-12 13:20:20
AC	Error404sans (焦阳浩云)	3ms	6.9 MiB		147 Bytes	2023-8-17 11:08:46