受欢迎度调查

状态	递交者	时间	内存	语言	代码	递交时间
AC	tongxiao	82ms	6.9 MiB	C++20(O2)	347 Bytes	2024-6-10 20:33:59
AC	姚宏逸	84ms	864 KiB		361 Bytes	2022-3-25 10:43:54
AC	zlx (xiao)	90ms	864 KiB		287 Bytes	2022-11-26 19:34:39
AC	kql1	91ms	7.1 MiB	C++98	360 Bytes	2024-5-9 13:23:36
AC	没有此人 (akm)	111ms	6.9 MiB	C++14	231 Bytes	2024-6-24 22:22:07
AC	阮 (媚狐不吃道旁李)	111ms	7.3 MiB	C++98	258 Bytes	2024-5-4 11:45:52
AC	在煎鱼的肖大总铳 (肖宇航)	121ms	6.8 MiB		292 Bytes	2023-10-12 22:03:49
AC	tongxiao	122ms	6.9 MiB	C++20(O2)	227 Bytes	2024-6-10 20:29:50
AC	pandap&a王皓宸 (WANGHAOCHEN)	131ms	936 KiB		341 Bytes	2023-4-6 18:28:49
AC	MoonLight ( aaa)	132ms	820 KiB		318 Bytes	2022-4-28 21:01:49
AC	杨皓宇 (yanghaoyu)	134ms	7.3 MiB		311 Bytes	2023-6-17 11:24:13
AC	xiongxinyao	136ms	880 KiB		283 Bytes	2022-6-30 10:31:43
AC	cupy战士 (05c05-dkf)	138ms	6.8 MiB		281 Bytes	2023-10-22 10:19:09
AC	杨瀚霖 (yanghanlin)	138ms	6.9 MiB		327 Bytes	2023-6-17 9:41:54
AC	RanHao	140ms	6.9 MiB		316 Bytes	2023-8-9 10:22:01
AC	Tender. (05c05-zhou)	140ms	828 KiB		281 Bytes	2022-10-23 13:48:13
AC	在线销售陈杰晟	140ms	512 KiB		405 Bytes	2022-5-28 9:08:49
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)	141ms	880 KiB		318 Bytes	2023-5-27 16:29:28
AC	huanglu	142ms	800 KiB		297 Bytes	2022-6-14 16:14:23
AC	zhangheyi22006	143ms	420 KiB		244 Bytes	2022-10-16 18:26:15
AC	(张洛诚)	143ms	6.8 MiB		352 Bytes	2023-6-15 19:15:57
AC	1396013295	143ms	488 KiB		277 Bytes	2022-1-23 18:54:03
AC	冒牌陈杰晟【MOD】 (wed)	145ms	480 KiB		249 Bytes	2022-3-2 18:23:40
AC	wangjun	147ms	7 MiB		510 Bytes	2023-12-22 9:56:24
AC	李禹衡 (liyuheng22006)	147ms	484 KiB		236 Bytes	2022-10-16 18:24:48
AC	谢博文	148ms	472 KiB		269 Bytes	2022-5-28 9:10:52
AC	Tang	149ms	512 KiB		235 Bytes	2022-5-28 9:11:16
AC	叶雨昊 (yeyuhao22006)	150ms	472 KiB		230 Bytes	2023-1-3 18:38:42
AC	你猜呀	154ms	6.9 MiB		293 Bytes	2023-6-30 15:12:36
AC	李倾城的忠实假粉 (向熠可)	155ms	496 KiB		245 Bytes	2022-3-29 21:11:58
AC	凌肯 (lingken22006)	156ms	428 KiB		300 Bytes	2022-10-16 18:26:18
AC	_PXY_	156ms	436 KiB		292 Bytes	2022-1-22 15:43:37
AC	凌肯 (lingken22006)	157ms	460 KiB		300 Bytes	2022-10-16 18:26:25
AC	ywh	158ms	464 KiB		269 Bytes	2022-5-24 21:24:31
AC	偽艺術家 (chenyanchi22006)	158ms	464 KiB		249 Bytes	2022-10-16 18:27:46
AC	朱老师 (zyp)	158ms	476 KiB		316 Bytes	2022-10-16 18:22:29
AC	叶雨昊 (yeyuhao22006)	159ms	500 KiB		230 Bytes	2023-1-3 18:37:34
AC	无尽的想象 (谭仕高)	160ms	824 KiB		265 Bytes	2023-4-14 14:32:16
AC	zhm123	161ms	428 KiB		281 Bytes	2023-5-25 15:16:43
AC	wangjun	161ms	7 MiB		511 Bytes	2023-12-22 9:55:48
AC	张瑞博	161ms	6.7 MiB	C++11	237 Bytes	2024-8-3 13:34:44
AC	希蒙 (zhengxingya)	164ms	6.9 MiB		426 Bytes	2023-12-16 10:26:53
AC	爱情海校区—沙天一 (沙天一)	164ms	7 MiB		268 Bytes	2023-12-30 9:31:45
AC	luosifu22006	169ms	432 KiB		289 Bytes	2022-10-16 18:23:30
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	169ms	6.7 MiB		207 Bytes	2023-9-5 20:16:15
AC	叶雨昊 (yeyuhao22006)	170ms	512 KiB		230 Bytes	2022-10-16 18:22:58
AC	坤坤荔枝小黑子 (zhonghaotian22006)	170ms	484 KiB		300 Bytes	2022-10-16 18:22:38
AC	colin1112 (墙凌可)	170ms	6.7 MiB		310 Bytes	2023-9-5 20:51:40
AC	枉哲锐	171ms	900 KiB		275 Bytes	2022-1-26 20:19:27
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	172ms	432 KiB		290 Bytes	2023-4-9 10:36:16
AC	不怎么聪明的家伙 (贺俊楠)	173ms	6.7 MiB		248 Bytes	2023-9-3 10:10:16
AC	zhuqiwei22006	176ms	476 KiB		228 Bytes	2022-10-16 18:29:04
AC	我很6 (zjj22031)	177ms	848 KiB		256 Bytes	2023-4-16 9:20:48
AC	陈家齐 (陈家齐1)	182ms	6.8 MiB		288 Bytes	2023-9-30 20:07:45
AC	时代二校-陈天成 (鸭缩毛巾)	182ms	7 MiB		203 Bytes	2023-10-14 15:59:15
AC	yang	184ms	1.2 MiB		260 Bytes	2022-9-4 10:04:57
AC	朱老师 (zyp)	185ms	868 KiB		270 Bytes	2022-9-29 10:20:11
AC	ycy	186ms	1.2 MiB		297 Bytes	2022-8-31 16:48:06
AC	罗伟杰 (13308275065)	190ms	816 KiB		261 Bytes	2022-8-31 17:02:30
AC	huyinuo	191ms	1.2 MiB		236 Bytes	2023-1-10 20:26:34
AC	疯神芭芭脱丝 (李卓修)	191ms	1.2 MiB		200 Bytes	2022-7-18 9:32:30
AC	李树崑 (lishukun)	194ms	800 KiB		310 Bytes	2022-8-20 11:53:53
AC	徐康景 (dcm)	195ms	916 KiB		207 Bytes	2022-11-5 11:54:45
AC	胡瀚文	196ms	1.2 MiB		209 Bytes	2022-7-17 17:07:01
AC	杜俊宏	196ms	820 KiB		245 Bytes	2022-7-16 14:21:38
AC	杜启苇1	196ms	812 KiB		262 Bytes	2022-8-31 17:14:12
AC	余龙恩---来自额嘛瑞卡 (yulongenshijieshangzuishuai)	197ms	856 KiB		239 Bytes	2022-1-23 10:41:23
AC	葛琮扬	198ms	7 MiB		299 Bytes	2023-7-18 15:06:12
AC	scallway	209ms	1.3 MiB		368 Bytes	2024-3-19 11:29:10
AC	zyl	213ms	1.3 MiB		607 Bytes	2024-2-18 10:32:04
AC	A小涂	221ms	1.1 MiB		286 Bytes	2024-3-8 22:24:26
AC	Nico	224ms	856 KiB		263 Bytes	2024-2-24 17:14:15
AC	Nico	225ms	860 KiB		268 Bytes	2024-2-24 17:11:09
AC	潘弈帆	225ms	840 KiB		300 Bytes	2024-3-1 21:01:23
AC	陈廷恩	225ms	844 KiB		352 Bytes	2024-3-8 20:09:41
AC	jdy	226ms	832 KiB		271 Bytes	2024-3-14 16:50:41
AC	Nico	227ms	936 KiB		282 Bytes	2024-2-24 17:16:09
AC	胡宸瑞	227ms	824 KiB		329 Bytes	2024-3-8 20:28:26
AC	lao_ba	228ms	828 KiB		278 Bytes	2024-3-9 19:38:06
AC	Nico	228ms	872 KiB		272 Bytes	2024-2-24 17:15:16
AC	Nico	228ms	920 KiB		263 Bytes	2024-2-24 17:14:49
AC	hyh	235ms	852 KiB		265 Bytes	2024-3-2 10:05:40