求列表和

状态	递交者	时间	内存	语言	代码	递交时间
AC	时代一校石博文 (shibowen)	-	7 MiB		89 Bytes	2023-12-30 21:25:02
AC	没有此人 (akm)	-	6.9 MiB		75 Bytes	2023-12-30 13:35:05
AC	(张洛诚)	-	7.3 MiB		87 Bytes	2024-1-17 16:59:19
AC	贾博涵	-	6.8 MiB		151 Bytes	2023-11-10 13:47:36
AC	xuniaoyin (徐袅音)	-	7.2 MiB		69 Bytes	2024-1-22 14:48:03
AC	胡宸华 (huchenhua)	1ms	256 KiB		62 Bytes	2022-2-18 19:34:21
AC	无尽的想象 (谭仕高)	1ms	384 KiB		161 Bytes	2022-7-28 13:39:31
AC	maomao	1ms	384 KiB		92 Bytes	2022-5-25 19:26:38
AC	赵泳鑫 (zhaoyongxin)	1ms	384 KiB		88 Bytes	2022-7-12 11:22:10
AC	谢延灏 (xeiyanhao---a handsome boy)	1ms	384 KiB		89 Bytes	2022-3-4 19:06:17
AC	chaikexu	1ms	384 KiB		77 Bytes	2022-12-4 8:53:50
AC	Tender. (05c05-zhou)	1ms	384 KiB		79 Bytes	2022-10-17 20:54:07
AC	TBB (杜昊燃)	1ms	384 KiB		152 Bytes	2022-4-30 11:26:11
AC	qwerty	1ms	384 KiB		216 Bytes	2022-3-11 22:10:39
AC	汪筱淞	1ms	384 KiB		81 Bytes	2022-9-24 19:31:44
AC	周琪渃	1ms	384 KiB		83 Bytes	2023-3-19 21:27:37
AC	曹埊睿 (caodirui)	1ms	384 KiB		80 Bytes	2023-5-2 23:12:18
AC	Nico	1ms	384 KiB		135 Bytes	2023-5-21 15:25: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)	1ms	384 KiB		91 Bytes	2023-5-13 12:12:57
AC	樊竣熠 (lft1114)	1ms	384 KiB		80 Bytes	2022-8-19 15:27:30
AC	luoluonuoya	1ms	384 KiB		182 Bytes	2022-3-21 19:08:57
AC	铁牛杰哥官方频道	1ms	384 KiB		70 Bytes	2022-3-9 20:34:23
AC	Iodef (OP AI)	1ms	6.8 MiB	C++11	76 Bytes	2024-6-29 13:54:48
AC	heyi	1ms	6.8 MiB	C++98(O2)	184 Bytes	2024-8-10 13:28:50
AC	马渝杭 (mayuhang)	1ms	384 KiB		106 Bytes	2023-4-7 10:58:29
AC	繁星 (05c35-zzm)	1ms	384 KiB		89 Bytes	2022-11-26 10:17:30
AC	konglinghao(算法战神) (konglinghao)	1ms	7.2 MiB	C++98	950 Bytes	2024-4-22 21:43:19
AC	杜俊宏	1ms	384 KiB		87 Bytes	2022-5-17 20:13:54
AC	yanglang	1ms	384 KiB		87 Bytes	2022-10-23 8:28:15
AC	Zongzi1	1ms	6.6 MiB	C++17(O2)	156 Bytes	2024-7-18 0:11:09
AC	77777777	1ms	6.2 MiB	C++17	84 Bytes	2024-7-21 22:22:55
AC	孙烽轶 (sfy)	1ms	6.8 MiB	C++98	80 Bytes	2024-5-25 13:34:04
AC	杜俊宏	1ms	384 KiB		82 Bytes	2022-5-17 20:13:31
AC	朱老师 (zyp)	1ms	384 KiB		88 Bytes	2022-8-6 11:29:44
AC	伍行念 (wuxingnian)	1ms	6.7 MiB		180 Bytes	2023-9-27 19:43:30
AC	zzl	1ms	6.8 MiB		91 Bytes	2023-11-7 0:43:40
AC	zlx (xiao)	1ms	384 KiB		90 Bytes	2022-5-25 19:56:14
AC	张祖名	1ms	6.8 MiB	C++98(O2)	89 Bytes	2024-6-9 11:33:51
AC	黄梓桐 (HuangZiTong)	1ms	384 KiB		138 Bytes	2022-7-11 19:27:56
AC	中岛敦 (黄麒瑞)	1ms	6.8 MiB		129 Bytes	2023-10-6 9:07:22
AC	GYZ	1ms	384 KiB		119 Bytes	2022-5-22 20:36:27
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	1ms	380 KiB		87 Bytes	2022-11-26 19:55:54
AC	Accepted (周芷乐)	1ms	6.8 MiB	C++14	139 Bytes	2024-8-17 15:23:13
AC	wuzhenghan	1ms	384 KiB		69 Bytes	2023-2-3 15:02:46
AC	wangzihang	1ms	384 KiB	C++	94 Bytes	2022-8-3 16:27:05
AC	李树崑 (lishukun)	1ms	384 KiB		157 Bytes	2022-8-3 17:55:43
AC	李山水	1ms	384 KiB		168 Bytes	2022-3-24 19:02:06
AC	leisixian (22029-lyh)	1ms	384 KiB		185 Bytes	2023-4-18 19:01:46
AC	冒牌陈杰晟【MOD】 (wed)	1ms	384 KiB		68 Bytes	2022-2-28 19:04:59
AC	dmh (丁墨涵)	1ms	384 KiB		106 Bytes	2022-2-14 20:25:20
AC	时代一校-赵彦博 (zyb)	1ms	6.7 MiB		176 Bytes	2023-8-24 14:08:13
AC	杜俊宏	1ms	392 KiB		87 Bytes	2022-5-17 20:12:08
AC	时代一校 - 冯隆浩 (冯隆浩)	1ms	384 KiB		80 Bytes	2022-9-24 19:28:49
AC	Randy Marsh (杨子腾)	1ms	384 KiB		107 Bytes	2022-5-10 19:02:19
AC	谭懿轩 (yanyixuan)	1ms	384 KiB		86 Bytes	2022-2-15 18:17:24
AC	疯神芭芭脱丝 (李卓修)	1ms	384 KiB		88 Bytes	2022-1-24 17:45:29
AC	姚宏逸	1ms	384 KiB		87 Bytes	2022-5-12 18:45:33
AC	xiangsiyu	1ms	384 KiB		87 Bytes	2022-6-26 9:24:16
AC	李廷旭 (litingxu)	1ms	6.9 MiB		91 Bytes	2023-7-15 13:39:44
AC	huanglu	1ms	7.1 MiB		95 Bytes	2023-7-18 9:10:43
AC	爱琴海校区-黄辰浩 (huangchenhao)	1ms	6.8 MiB		135 Bytes	2023-6-11 12:48:04
AC	yuhaodi	1ms	436 KiB		90 Bytes	2023-5-13 11:24:56
AC	chen (peter)	1ms	384 KiB		88 Bytes	2023-2-25 18:53:36
AC	MoonLight ( aaa)	1ms	384 KiB		102 Bytes	2022-1-8 9:49:03
AC	不怎么聪明的家伙 (贺俊楠)	1ms	344 KiB		129 Bytes	2023-3-26 15:13:33
AC	王韵淮	1ms	384 KiB		71 Bytes	2022-6-5 9:01:46
AC	17779	1ms	384 KiB		168 Bytes	2022-3-10 20:48:50
AC	况奕辛 (KYX_yyds)	1ms	384 KiB		78 Bytes	2022-3-8 20:55:03
AC	偽艺術家 (chenyanchi22006)	1ms	384 KiB		84 Bytes	2022-8-15 22:28:10
AC	wangruibo20xh	1ms	384 KiB		94 Bytes	2022-2-9 21:28:50
AC	longhao	1ms	384 KiB		96 Bytes	2022-1-25 10:13:09
AC	黄梓轩 (huangzixuan)	1ms	384 KiB		154 Bytes	2023-5-21 14:00:52
AC	新壹街陈科言 (cky)	1ms	6.8 MiB		240 Bytes	2023-7-20 14:12:34
AC	赵志陶 (zztzzt)	1ms	384 KiB		67 Bytes	2022-8-1 15:39:50
AC	ywh	1ms	384 KiB		94 Bytes	2022-6-17 20:23:28
AC	huyinuo	1ms	384 KiB		91 Bytes	2022-4-17 9:52:32
AC	曾御城（现用名） (Jason)	1ms	384 KiB		124 Bytes	2022-1-26 16:51:53
AC	朱泽晟	1ms	384 KiB		101 Bytes	2022-2-13 12:51:44
AC	heyi	1ms	6.8 MiB	C++98(O2)	154 Bytes	2024-8-10 13:29:40
AC	李彭宋代诗人 (ljy123456)	1ms	384 KiB		106 Bytes	2023-4-11 21:04:42
AC	德克萨斯做的到吗 (liyangbao)	1ms	384 KiB		103 Bytes	2022-11-18 23:17:19
AC	陈骏逸 (chenjunyi)	1ms	7.3 MiB		101 Bytes	2023-7-6 11:31:21
AC	陈杰晟	1ms	384 KiB		92 Bytes	2022-3-1 19:16:53
AC	傅博涛	1ms	384 KiB		69 Bytes	2022-2-27 13:16:33
AC	ganlin1	1ms	6.9 MiB		138 Bytes	2023-7-20 11:38:35
AC	李山水	1ms	384 KiB		168 Bytes	2022-3-24 19:02:06
AC	蒲梓勋 (puzixun)	1ms	6.6 MiB		98 Bytes	2023-6-9 19:30:13
AC	RanHao	1ms	6.9 MiB		83 Bytes	2023-7-22 11:36:02
AC	Jack	1ms	384 KiB		81 Bytes	2023-3-15 19:19:28
AC	时代一校-王宥量 (wangyouliang)	1ms	384 KiB		80 Bytes	2022-11-27 21:04:13
AC	文硕 (文硕1)	1ms	412 KiB		88 Bytes	2022-7-12 11:35:03
AC	火爆肥肠（杨弘毅） (火爆肥肠)	1ms	400 KiB		87 Bytes	2022-3-20 11:31:57
AC	zzzrrrxxx	1ms	6.7 MiB		73 Bytes	2023-8-19 19:06:09
AC	不怎么聪明的家伙 (贺俊楠)	1ms	384 KiB		129 Bytes	2023-3-26 15:13:31
AC	周琪渃	1ms	384 KiB		83 Bytes	2023-3-19 21:27:42
AC	11451254188 (22029-mjh)	1ms	384 KiB		84 Bytes	2022-11-15 14:11:42
AC	陈红恺 (chk)	2ms	384 KiB		86 Bytes	2022-8-29 15:20:39
AC	吕同学是傻逼 (黄立信)	2ms	6.8 MiB		82 Bytes	2023-10-15 13:22:51
AC	AC[谭赫奕] (tanheyi)	2ms	384 KiB		100 Bytes	2023-4-16 10:00:31
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	2ms	392 KiB		93 Bytes	2022-1-27 20:32:34