整数去重

状态	递交者	时间	内存	语言	代码	递交时间
AC	胡宸华 (huchenhua)	2ms	296 KiB		232 Bytes	2022-11-12 22:33:41
AC	tad (OP AI)	3ms	7 MiB	C++11	366 Bytes	2024-6-28 22:49:51
AC	zlx (xiao)	3ms	384 KiB		445 Bytes	2022-5-25 19:53:52
AC	wangzihang	4ms	436 KiB		239 Bytes	2022-8-1 15:40:19
AC	张祖名	4ms	6.9 MiB	C++98(O2)	238 Bytes	2024-6-9 11:22:18
AC	我推的乱破 (贺俊楠)	4ms	7.1 MiB	C++98(O2)	385 Bytes	2024-5-6 21:53:38
AC	曾御城（现用名） (Jason)	4ms	384 KiB		262 Bytes	2022-6-1 18:50:59
AC	孙烽轶 (sfy)	4ms	7.3 MiB	C++98	284 Bytes	2024-5-18 14:54:52
AC	杜俊宏	4ms	384 KiB		447 Bytes	2022-5-19 20:07:33
AC	杜俊宏	4ms	384 KiB		447 Bytes	2022-5-19 20:07:33
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	4ms	6.5 MiB	C++98	258 Bytes	2024-7-30 18:41:32
AC	17779	4ms	384 KiB		407 Bytes	2022-3-10 13:09:40
AC	maomao	4ms	392 KiB		257 Bytes	2022-5-25 17:56:39
AC	MoonLight ( aaa)	4ms	384 KiB		200 Bytes	2022-1-8 9:46:19
AC	郑思远	4ms	384 KiB		353 Bytes	2022-7-17 12:08:50
AC	时代2校-程俊燃 (chengjunran)	4ms	6.8 MiB		469 Bytes	2023-10-24 19:39:16
AC	坤坤荔枝小黑子 (zhonghaotian22006)	4ms	384 KiB		381 Bytes	2022-11-7 10:07:12
AC	huangpucwx	4ms	7 MiB	C++11	470 Bytes	2024-6-16 17:27:44
AC	李树崑 (lishukun)	4ms	392 KiB		445 Bytes	2022-6-11 13:38:40
AC	^_^ (ctc)	4ms	384 KiB		369 Bytes	2023-2-20 20:35:07
AC	黄梓桐 (HuangZiTong)	4ms	524 KiB		429 Bytes	2022-6-17 21:47:24
AC	huyinuo	4ms	512 KiB		377 Bytes	2022-5-23 21:43:15
AC	zhm123	4ms	524 KiB		331 Bytes	2022-11-23 18:13:05
AC	wangruibo20xh	4ms	6.8 MiB		254 Bytes	2023-11-7 11:50:09
AC	qwerty	4ms	384 KiB		351 Bytes	2022-3-11 19:38:54
AC	何洋名 (heyangming)	4ms	384 KiB		368 Bytes	2022-5-28 8:21:46
AC	huanglu	4ms	384 KiB		243 Bytes	2023-5-27 8:43:36
AC	朱老师 (zyp)	4ms	384 KiB		311 Bytes	2023-4-26 20:32:21
AC	时代校区-孔令皓 (konglinghao)	4ms	7.2 MiB	C++98	1.2 KiB	2024-4-23 21:59:29
AC	炸鱼4000+ (dxc)	4ms	7.2 MiB	C++14(O2)	317 Bytes	2024-4-28 22:05:24
AC	陈杰晟	4ms	384 KiB		251 Bytes	2022-3-1 18:36:14
AC	王晨志 (wangchenzhi)	4ms	384 KiB		448 Bytes	2022-5-28 22:46:25
AC	星野光 (Hoshino Hikari)	4ms	6.8 MiB		370 Bytes	2023-10-24 18:16:43
AC	luoluonuoya	4ms	432 KiB		417 Bytes	2022-5-22 11:16:39
AC	zhm123	4ms	512 KiB		248 Bytes	2022-11-23 18:14:47
AC	Accepted (周芷乐)	4ms	6.9 MiB	C++14	288 Bytes	2024-8-17 15:15:58
AC	10255	4ms	388 KiB		400 Bytes	2023-2-20 20:33:05
AC	冒牌陈杰晟【MOD】 (wed)	4ms	480 KiB		257 Bytes	2022-3-13 17:06:33
AC	李彭宋代诗人 (ljy123456)	4ms	516 KiB		341 Bytes	2023-4-11 21:01:22
AC	zzl	4ms	6.8 MiB		377 Bytes	2023-11-7 0:39:34
AC	朱泽晟	4ms	384 KiB		198 Bytes	2022-2-13 12:06:36
AC	疯神芭芭脱丝 (李卓修)	4ms	448 KiB		488 Bytes	2022-7-14 9:59:44
AC	蒲梓勋 (puzixun)	4ms	384 KiB		257 Bytes	2023-1-30 13:16:47
AC	张玉坚 (zhangyuian)	4ms	384 KiB		314 Bytes	2022-11-27 15:02:00
AC	繁星 (05c35-zzm)	4ms	448 KiB		307 Bytes	2022-11-26 10:10:53
AC	曹埊睿 (caodirui)	4ms	436 KiB		301 Bytes	2023-5-2 23:08:46
AC	NJL (NJlL)	4ms	444 KiB		204 Bytes	2022-6-26 16:24:48
AC	stehpen_zuo	4ms	6.4 MiB	C++20	579 Bytes	2024-7-6 0:24:37
AC	文硕 (文硕1)	4ms	428 KiB		352 Bytes	2023-2-1 8:38:28
AC	樊竣熠 (lft1114)	4ms	384 KiB		280 Bytes	2022-4-5 19:04:37
AC	梨冻亿 (wiueh)	4ms	384 KiB		418 Bytes	2022-1-27 18:38:39
AC	Qinxiu	4ms	7 MiB	C++11	547 Bytes	2024-5-4 17:08:16
AC	朱老师 (zyp)	4ms	432 KiB		266 Bytes	2022-8-6 11:12:08
AC	赵沛喆	4ms	444 KiB		411 Bytes	2022-9-3 10:55:18
AC	赵奕铭	4ms	7.2 MiB	C++98	230 Bytes	2024-5-6 21:37:24
AC	22029-hqh	4ms	384 KiB		455 Bytes	2022-12-24 11:41:38
AC	SB (mfy01)	4ms	448 KiB		367 Bytes	2023-2-3 17:37:44
AC	明轩 (吕同学)	4ms	6.6 MiB	C++14(O2)	680 Bytes	2024-7-17 10:14:26
AC	wuzhenghan	4ms	436 KiB		328 Bytes	2022-11-5 20:15:54
AC	huangpucwx	4ms	7.1 MiB	C++11	776 Bytes	2024-6-16 17:21:30
AC	没有此人 (akm)	4ms	7.1 MiB	C++14	498 Bytes	2024-4-21 22:17:31
AC	chen (peter)	4ms	512 KiB		404 Bytes	2022-6-5 17:23:15
AC	luozixi	4ms	384 KiB		446 Bytes	2022-11-27 14:39:03
AC	huangpucwx	4ms	7 MiB	C++14	470 Bytes	2024-6-16 17:30:04
AC	余晨浩 (yuchenhao)	4ms	512 KiB		446 Bytes	2022-11-27 14:40:24
AC	谭懿轩 (yanyixuan)	4ms	452 KiB		272 Bytes	2022-2-15 18:01:45
AC	况奕辛 (KYX_yyds)	4ms	440 KiB		383 Bytes	2022-3-8 20:47:19
AC	希蒙 (zhengxingya)	4ms	7 MiB		417 Bytes	2023-12-20 17:22:07
AC	吴俊成 (wujuncheng)	4ms	444 KiB		339 Bytes	2022-7-10 10:24:31
AC	马渝杭 (mayuhang)	4ms	532 KiB		341 Bytes	2022-8-10 16:48:09
AC	蓝色妖姬 (jiangpeiyu)	4ms	428 KiB		488 Bytes	2022-11-7 9:56:07
AC	x0l0x	4ms	6.8 MiB		252 Bytes	2023-10-18 11:07:26
AC	德克萨斯做的到吗 (liyangbao)	4ms	444 KiB		370 Bytes	2022-11-15 20:47:14
AC	郑尧 (zhengyao)	4ms	7 MiB	C++98	229 Bytes	2024-5-26 14:55:26
AC	dengfeng	4ms	444 KiB		495 Bytes	2022-7-9 15:48:05
AC	22029-hqh	4ms	384 KiB		455 Bytes	2022-12-24 11:41:30
AC	Nico	4ms	384 KiB		251 Bytes	2023-5-21 15:18:39
AC	汪致卉 (wangzh)	4ms	512 KiB		468 Bytes	2022-1-28 23:39:15
AC	谭红中 (不知道)	4ms	400 KiB		358 Bytes	2023-1-13 9:42:53
AC	yanglang	4ms	512 KiB		240 Bytes	2022-10-22 21:42:32
AC	黄立信	4ms	6.8 MiB		272 Bytes	2023-10-15 11:57:54
AC	无尽的想象 (谭仕高)	4ms	436 KiB		402 Bytes	2022-7-27 17:55:43
AC	22029-hqh	4ms	384 KiB		455 Bytes	2022-12-24 11:41:37
AC	heyi	4ms	6.8 MiB	C++98(O2)	425 Bytes	2024-8-10 14:04:39
AC	王乐仪	4ms	384 KiB		207 Bytes	2022-2-17 20:17:26
AC	赵泳鑫 (zhaoyongxin)	4ms	444 KiB		510 Bytes	2022-7-14 14:26:10
AC	dengduxi	4ms	384 KiB		313 Bytes	2022-11-27 14:42:46
AC	SYC0226	4ms	436 KiB		304 Bytes	2022-3-20 11:43:12
AC	姚宏逸	4ms	384 KiB		568 Bytes	2022-1-30 20:20:51
AC	黄梓轩 (huangzixuan)	4ms	6.9 MiB		321 Bytes	2023-7-27 16:50:09
AC	1396013295	4ms	428 KiB		498 Bytes	2022-3-23 20:22:03
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	528 KiB		343 Bytes	2023-5-14 19:15:38
AC	洛阳锦程 (郭思利)	4ms	7 MiB	C++98	308 Bytes	2024-5-26 10:45:17
AC	爱琴海校区-刁钲洋 (刁钲洋)	4ms	6.9 MiB		648 Bytes	2023-8-4 19:49:22
AC	谭懿轩 (yanyixuan)	4ms	384 KiB		272 Bytes	2022-11-5 22:12:40
AC	Erin	4ms	7.2 MiB	C++98	302 Bytes	2024-5-4 19:07:12
AC	22029-hqh	5ms	392 KiB		455 Bytes	2022-12-24 11:41:35
AC	叶雨昊 (yeyuhao22006)	5ms	436 KiB		300 Bytes	2022-10-23 20:04:03
AC	RanHao	5ms	6.9 MiB		480 Bytes	2023-7-22 11:25:00
AC	zzzrrrxxx	5ms	6.9 MiB		233 Bytes	2023-8-11 11:36:48