求个位

状态	递交者	时间	内存	语言	代码	递交时间
AC	姚宏逸	13ms	384 KiB	C	144 Bytes	2022-3-21 10:12:32
AC	樊竣熠 (lft1114)	17ms	312 KiB		137 Bytes	2022-8-26 11:48:56
AC	王韵淮	25ms	392 KiB		90 Bytes	2022-5-31 21:55:49
AC	Randy Marsh (杨子腾)	25ms	384 KiB		130 Bytes	2022-5-26 18:50:23
AC	雷诺伊尔 (崔金鹏)	25ms	6.8 MiB	C++17	97 Bytes	2024-8-9 20:17:05
AC	林小博	26ms	420 KiB		103 Bytes	2022-6-3 12:30:39
AC	傅博涛	26ms	384 KiB		118 Bytes	2022-5-29 10:16:03
AC	徐子恩 (Cow)	26ms	384 KiB		303 Bytes	2022-3-27 9:25:19
AC	GYZ	26ms	512 KiB		125 Bytes	2022-5-25 18:52:00
AC	疯神芭芭脱丝 (李卓修)	26ms	384 KiB		111 Bytes	2022-5-15 16:49:03
AC	肖添宇	26ms	384 KiB		127 Bytes	2022-5-14 17:48:40
AC	杜俊宏	27ms	512 KiB		138 Bytes	2022-6-13 20:25:40
AC	luoluonuoya	27ms	384 KiB		196 Bytes	2022-5-8 15:09:01
AC	赵泳鑫 (zhaoyongxin)	27ms	428 KiB		118 Bytes	2022-7-12 11:47:18
AC	张瑞博	27ms	7 MiB	C++11	114 Bytes	2024-5-31 20:21:58
AC	LUKHE (LukeHu)	27ms	512 KiB		118 Bytes	2022-4-16 17:13:23
AC	kkksc03 (彭士锋)	27ms	384 KiB		554 Bytes	2022-4-23 14:20:46
AC	阮 (媚狐不吃道旁李)	27ms	7.2 MiB	C++98	118 Bytes	2024-5-18 16:06:46
AC	曹埊睿 (caodirui)	27ms	420 KiB		153 Bytes	2023-5-14 14:07:55
AC	huyinuo	28ms	436 KiB		117 Bytes	2022-5-7 21:31:08
AC	坤坤荔枝小黑子 (zhonghaotian22006)	28ms	440 KiB		115 Bytes	2022-6-25 9:46:53
AC	zhuqiwei22006	28ms	512 KiB		100 Bytes	2022-5-1 18:37:44
AC	xiangsiyu	28ms	436 KiB		103 Bytes	2022-6-26 17:19:08
AC	孙烽轶 (sfy)	28ms	6.8 MiB	C++98	98 Bytes	2024-8-11 20:33:28
AC	zcx	28ms	512 KiB		107 Bytes	2023-5-18 19:59:18
AC	王晨志 (wangchenzhi)	28ms	512 KiB		343 Bytes	2022-7-17 3:39:01
AC	chen (peter)	28ms	436 KiB		524 Bytes	2022-7-19 15:13:32
AC	吴俊成 (wujuncheng)	29ms	512 KiB		139 Bytes	2022-7-11 20:11:22
AC	李廷旭 (litingxu)	29ms	512 KiB		117 Bytes	2023-4-23 21:20:20
AC	(张洛诚)	29ms	440 KiB		118 Bytes	2023-4-29 8:13:44
AC	ycy	29ms	512 KiB		113 Bytes	2022-7-1 13:48:28
AC	周琪渃	29ms	384 KiB		126 Bytes	2022-12-4 16:10:22
AC	李树崑 (lishukun)	30ms	408 KiB		145 Bytes	2022-8-24 12:08:33
AC	赵沛喆	30ms	436 KiB		155 Bytes	2022-8-15 15:25:17
AC	罗翌珂 (dangdang)	31ms	440 KiB		121 Bytes	2022-8-28 10:37:44
AC	zzzrrrxxx	31ms	6.7 MiB		95 Bytes	2023-9-10 17:26:04
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	31ms	7.1 MiB		111 Bytes	2023-11-11 18:44:21
AC	11451254188 (22029-mjh)	31ms	432 KiB		128 Bytes	2022-11-17 18:11:01
AC	zlx (xiao)	32ms	424 KiB		128 Bytes	2022-11-26 21:22:30
AC	tsc_ (杨悦堃)	32ms	448 KiB		94 Bytes	2023-3-11 21:26:24
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	32ms	512 KiB		109 Bytes	2022-11-26 9:31:35
AC	李哲 (lizhe)	33ms	392 KiB		91 Bytes	2022-11-21 21:06:15
AC	邹曜丞 (13983097018)	33ms	6.9 MiB		112 Bytes	2023-7-23 17:10:20
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)	33ms	6.5 MiB		111 Bytes	2023-6-3 20:27:46
AC	colin1112 (墙凌可)	33ms	6.7 MiB		170 Bytes	2023-9-7 19:08:59
AC	黄梓桐 (HuangZiTong)	34ms	424 KiB		102 Bytes	2023-1-15 17:18:32
AC	杜是贤 (dushixian)	35ms	436 KiB		105 Bytes	2023-5-28 10:49:08
AC	赵奕铭	130ms	768 KiB		448 Bytes	2024-3-17 21:05:44
AC	My name is Man (钟卓劭)	134ms	540 KiB		101 Bytes	2024-3-23 21:25:33
AC	majinhui	405ms	3.9 MiB	Python 3	27 Bytes	2022-7-9 10:27:09
AC	源著校区-宋昊成 (马冬梅)	409ms	4 MiB	Python 3	30 Bytes	2022-4-23 18:35:57
AC	爱琴海校区-刁钲洋 (刁钲洋)	411ms	3.9 MiB	Python 3	50 Bytes	2022-3-22 21:20:01
AC	郭益豪（帅哥） (guoyihao)	411ms	3.9 MiB	Python 3	32 Bytes	2022-4-23 18:36:07
AC	11111	419ms	3.9 MiB	Python 3	36 Bytes	2022-4-3 9:34:43
AC	不怎么聪明的家伙 (贺俊楠)	428ms	4 MiB	Python 3	26 Bytes	2023-1-4 11:11:56
AC	1396013295	433ms	3.9 MiB	Python 3	40 Bytes	2022-3-22 20:37:17