2个数字的排列

状态	递交者	时间	内存	语言	代码	递交时间
AC	LUKHE (LukeHu)	165ms	436 KiB		203 Bytes	2022-1-25 19:53:31
AC	在煎鱼的肖大总铳 (肖宇航)	166ms	7.1 MiB		190 Bytes	2023-9-24 11:08:37
AC	吃小孩的viv_	167ms	452 KiB		240 Bytes	2023-2-9 20:26:45
AC	小翔的粉丝	167ms	6.9 MiB		240 Bytes	2023-7-2 9:18:27
AC	叶哲宇 (yzy)	169ms	7.2 MiB	C++11	190 Bytes	2024-5-5 13:44:25
AC	陈家齐 (陈家齐1)	169ms	7 MiB		245 Bytes	2023-7-4 16:21:36
AC	yangbinyu	169ms	544 KiB		218 Bytes	2022-11-13 15:01:25
AC	希蒙 (zhengxingya)	169ms	6.8 MiB		243 Bytes	2023-10-11 17:48:55
AC	AG.一诺	169ms	512 KiB		229 Bytes	2022-2-27 11:27:12
AC	伍行念 (wuxingnian)	170ms	6.8 MiB		213 Bytes	2023-10-8 15:34:45
AC	xuniaoyin (徐袅音)	171ms	6.7 MiB		188 Bytes	2023-9-3 14:36:33
AC	新壹街校区-杨轩懿 (杨轩懿1)	171ms	6.9 MiB		179 Bytes	2023-7-25 10:54:41
AC	tsc_ (杨悦堃)	171ms	6.8 MiB		212 Bytes	2023-6-28 14:33:11
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	172ms	512 KiB		249 Bytes	2023-3-26 9:58:58
AC	杨瀚霖 (yanghanlin)	172ms	452 KiB		276 Bytes	2023-3-11 11:18:01
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	172ms	440 KiB		266 Bytes	2022-9-30 20:12:47
AC	zzl	173ms	6.8 MiB		212 Bytes	2023-11-7 1:17:08
AC	miku (阳沐珊)	173ms	6.7 MiB		257 Bytes	2023-9-10 15:36:12
AC	colin1112 (墙凌可)	174ms	6.7 MiB		276 Bytes	2023-9-4 21:18:39
AC	新壹街-曾浩坤 (曾浩坤)	174ms	6.8 MiB		224 Bytes	2023-6-27 16:59:11
AC	牟淳雅	175ms	6.7 MiB		241 Bytes	2023-9-27 22:01:10
AC	曾龙兮	175ms	516 KiB		226 Bytes	2022-11-13 20:53:34
AC	wangzihang	175ms	6.8 MiB		272 Bytes	2023-11-6 17:01:06
AC	黄立信	176ms	6.8 MiB		288 Bytes	2023-10-26 19:22:04
AC	ganlin1	176ms	6.9 MiB		188 Bytes	2023-7-28 13:43:50
AC	杜是贤 (dushixian)	176ms	432 KiB		195 Bytes	2022-2-27 11:05:01
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)	176ms	6.9 MiB		217 Bytes	2023-6-30 10:12:25
AC	maobohan	176ms	6.8 MiB		213 Bytes	2023-7-1 9:34:17
AC	chen (peter)	177ms	444 KiB		227 Bytes	2022-10-5 14:22:40
AC	科比.布莱恩特 (董浩琰)	177ms	7.9 MiB		259 Bytes	2023-7-20 19:22:27
AC	huanglu	177ms	488 KiB		277 Bytes	2022-12-17 17:37:55
AC	时代二校-陈天成 (鸭缩毛巾)	177ms	6.8 MiB		247 Bytes	2023-7-1 22:55:59
AC	你猜呀	177ms	6.7 MiB		214 Bytes	2023-6-4 10:28:19
AC	RanHao	177ms	6.9 MiB		285 Bytes	2023-7-22 19:18:27
AC	草\|\|草 (陈星佑)	177ms	512 KiB		239 Bytes	2022-9-27 19:15:05
AC	小忙果 (王昱杰)	178ms	6.8 MiB		238 Bytes	2023-6-28 13:46:18
AC	Randy Marsh (杨子腾)	179ms	444 KiB		244 Bytes	2023-1-10 13:33:04
AC	胡程禹	179ms	7.1 MiB		251 Bytes	2023-7-7 9:25:14
AC	李龙腾 (llt)	179ms	7 MiB		208 Bytes	2023-6-29 20:55:41
AC	时代一校-王宥量 (wangyouliang)	180ms	512 KiB		195 Bytes	2022-11-13 10:39:47
AC	黄梓轩 (huangzixuan)	180ms	6.8 MiB		182 Bytes	2023-11-2 16:36:12
AC	22029-lyh	180ms	512 KiB		223 Bytes	2023-3-19 9:58:15
AC	谢靳骁 (XJX)	180ms	6.9 MiB		200 Bytes	2023-8-12 11:50:38
AC	杨瀚霖 (yanghanlin)	180ms	456 KiB		276 Bytes	2023-3-11 11:18:00
AC	徐康景 (dcm)	180ms	456 KiB		266 Bytes	2022-9-30 17:22:00
AC	漆星语 (qixingyu)	181ms	6.8 MiB		183 Bytes	2023-7-1 9:24:39
AC	杨瀚霖 (yanghanlin)	181ms	452 KiB		276 Bytes	2023-3-11 11:17:59
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	181ms	496 KiB		239 Bytes	2022-9-30 20:12:07
AC	时代1校-杨宇轩 (杨宇轩)	181ms	6.7 MiB		187 Bytes	2023-8-22 12:51:45
AC	新壹街校区-陈琬舒 (空空大师)	182ms	7.1 MiB		209 Bytes	2023-7-14 11:59:45
AC	我很6 (zjj22031)	182ms	512 KiB		249 Bytes	2023-3-26 9:03:07
AC	周琪渃	182ms	452 KiB		267 Bytes	2023-3-18 18:47:23
AC	cupy战士 (05c05-dkf)	183ms	6.9 MiB		216 Bytes	2023-9-24 11:30:16
AC	^_^ (ctc)	183ms	512 KiB		184 Bytes	2022-11-2 20:38:36
AC	时代二校-焦雨齐 (Angel)	183ms	6.9 MiB		201 Bytes	2023-7-16 9:46:52
AC	刘锦航	184ms	444 KiB		190 Bytes	2022-9-30 14:23:54
AC	草\|\|草 (陈星佑)	184ms	440 KiB		239 Bytes	2022-9-27 19:15:08
AC	坤坤荔枝小黑子 (zhonghaotian22006)	185ms	512 KiB		222 Bytes	2022-10-2 9:09:01
AC	曹元明	185ms	440 KiB		255 Bytes	2022-11-4 20:28:10
AC	刘昊臻 (liuhaozhen)	186ms	6.8 MiB		208 Bytes	2023-6-28 13:54:53
AC	曹元明	186ms	512 KiB		255 Bytes	2022-11-4 20:27:14
AC	杨瀚霖 (yanghanlin)	187ms	460 KiB		276 Bytes	2023-3-11 11:17:45
AC	刘致言	187ms	448 KiB		201 Bytes	2023-3-11 9:36:07
AC	Jack	189ms	440 KiB		188 Bytes	2023-3-23 19:17:37
AC	郑岐蔚	189ms	436 KiB		241 Bytes	2023-1-26 14:44:45
AC	李哲 (lizhe)	191ms	512 KiB		214 Bytes	2022-10-27 23:14:19
AC	马渝杭 (mayuhang)	192ms	512 KiB		246 Bytes	2023-1-8 13:31:38
AC	chaikexu	194ms	532 KiB		193 Bytes	2022-12-11 9:58:32
AC	陈风亦 (chenfengyi)	197ms	448 KiB		189 Bytes	2022-12-15 18:06:03
AC	Jack	199ms	512 KiB		206 Bytes	2023-1-11 9:26:34
AC	新壹街朱启航 (zhuqihang)	211ms	808 KiB	C++98	217 Bytes	2024-9-7 17:53:58
AC	谭红中 (不知道)	220ms	7.3 MiB		177 Bytes	2024-1-17 17:00:21
AC	爱情海校区—沙天一 (沙天一)	232ms	6.9 MiB		188 Bytes	2023-11-27 20:48:42
AC	许律天	245ms	7 MiB		205 Bytes	2024-1-6 17:36:43
AC	AI创客	250ms	7.2 MiB		217 Bytes	2023-12-30 11:06:28
AC	煞笔笔	261ms	7 MiB		177 Bytes	2024-1-19 12:27:53
AC	wangjun	283ms	7.1 MiB		197 Bytes	2023-12-21 9:44:07
AC	贾博涵	308ms	6.9 MiB		232 Bytes	2023-11-23 15:03:07
AC	fcxin	438ms	9.9 MiB	Python 3	129 Bytes	2024-8-14 9:41:51
AC	高俊	540ms	9.2 MiB	Python 3	114 Bytes	2023-10-27 14:05:31
AC	爱琴海校区-刁钲洋 (刁钲洋)	547ms	4.5 MiB	Python 3	104 Bytes	2022-6-25 9:57:52
AC	19598	574ms	9.2 MiB	Python 3	117 Bytes	2023-9-20 14:41:21
AC	xxteacher	582ms	9.1 MiB	Python 3	120 Bytes	2023-7-25 15:04:12
AC	cola	589ms	4.5 MiB	Python 3	163 Bytes	2022-12-21 17:07:55
AC	梨冻亿 (wiueh)	599ms	4.5 MiB	Python 3	194 Bytes	2022-1-23 18:12:48
AC	kongql	612ms	4.5 MiB	Python 3	131 Bytes	2022-7-22 15:34:45
AC	My name is Man (钟卓劭)	906ms	608 KiB		248 Bytes	2024-3-31 10:57:25
AC	hyh	923ms	792 KiB		187 Bytes	2024-3-2 9:33:33
AC	杨骏逸	927ms	792 KiB		176 Bytes	2024-2-2 17:57:33
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	937ms	764 KiB		208 Bytes	2024-3-30 15:43:03
AC	JOKER (hhy)	957ms	588 KiB		185 Bytes	2024-2-18 17:10:53
AC	ReFly (NKZKY)	958ms	604 KiB		240 Bytes	2024-2-1 16:57:22
AC	陈诺	964ms	792 KiB		220 Bytes	2024-2-7 11:34:01
AC	唐一航	1027ms	592 KiB	C++11	203 Bytes	2024-9-25 18:40:57
AC	王义苇 (wangyiwei)	1052ms	792 KiB	C++98	242 Bytes	2024-9-6 11:21:54
AC	时代2校+施皓宬 (shihaocheng)	1058ms	580 KiB	C++11	222 Bytes	2024-10-27 11:27:45
AC	老六在此	1078ms	580 KiB	C++20	246 Bytes	2024-9-25 18:40:41
AC	Qinxiu	1483ms	4 MiB	Python 3	115 Bytes	2024-2-18 21:53:44
AC	Qinxiu	1517ms	4 MiB	Python 3	134 Bytes	2024-2-13 13:15:03