一维数组排序

状态	递交者	时间	内存	语言	代码	递交时间
AC	小根哥	1459ms	512 KiB		371 Bytes	2022-8-30 18:31:36
AC	胡宸瑞	1460ms	1020 KiB		327 Bytes	2024-3-1 20:21:36
AC	A小涂	1462ms	768 KiB		329 Bytes	2024-3-2 7:34:20
AC	谭懿轩 (yanyixuan)	1496ms	512 KiB		315 Bytes	2022-5-28 14:18:13
AC	1396013295	1524ms	384 KiB		553 Bytes	2022-2-25 20:07:58
AC	ttt123	1530ms	548 KiB		418 Bytes	2022-12-4 16:00:49
AC	伍芷函	1568ms	500 KiB		368 Bytes	2023-1-31 11:15:21
AC	何晟瑞 (hsr01)	1581ms	6.7 MiB		375 Bytes	2023-9-23 19:06:51
AC	liushenhao	1584ms	344 KiB		364 Bytes	2022-3-25 20:46:08
AC	05c05-zzx	1642ms	464 KiB		348 Bytes	2022-10-3 11:25:58
AC	22016-lyj	1690ms	464 KiB		455 Bytes	2022-12-4 16:05:18
AC	zhangyh (张育菡)	1715ms	512 KiB		397 Bytes	2022-6-27 21:34:15
AC	王晨志 (wangchenzhi)	1743ms	460 KiB		420 Bytes	2022-6-19 13:42:02
AC	新壹街——陈学彬 (BUG)	1840ms	512 KiB		298 Bytes	2022-6-11 19:53:18
AC	huanglu	1842ms	452 KiB		364 Bytes	2022-6-14 13:28:44
AC	蒲梓勋 (puzixun)	1844ms	512 KiB		433 Bytes	2022-12-7 19:56:19
AC	时代一校 - 冯隆浩 (冯隆浩)	1859ms	556 KiB		329 Bytes	2022-12-3 21:48:06
AC	U城校区-邓皓月 (邓皓月)	2122ms	820 KiB		418 Bytes	2024-4-6 12:51:38
AC	阮 (媚狐不吃道旁李)	2156ms	7.7 MiB	C++98	341 Bytes	2024-5-4 11:39:49
AC	黄彦熹 (AK-203)	2192ms	540 KiB		356 Bytes	2023-2-26 19:56:53
AC	张雯皓 (zhangwenhao)	2240ms	7.4 MiB		486 Bytes	2023-12-30 10:54:01
AC	新壹街校区-杨轩懿 (杨轩懿1)	2241ms	6.7 MiB		296 Bytes	2023-8-30 11:25:28
AC	CK (李弘毅)	2285ms	6.9 MiB		364 Bytes	2023-11-4 12:12:38
AC	许律天	2295ms	576 KiB		405 Bytes	2024-2-21 16:12:35
AC	许律天	2327ms	804 KiB		396 Bytes	2024-2-21 16:15:45
AC	没有此人 (akm)	2363ms	6.9 MiB		329 Bytes	2023-7-3 8:21:00
AC	冒牌陈杰晟【MOD】 (wed)	2434ms	464 KiB		267 Bytes	2022-3-20 18:02:50
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	2444ms	512 KiB		370 Bytes	2022-1-23 18:42:17
AC	文硕 (文硕1)	2465ms	512 KiB		364 Bytes	2022-2-6 14:13:24
AC	美术猫映画 (mkh)	2565ms	6.9 MiB		426 Bytes	2023-8-12 14:09:12
AC	在煎鱼的肖大总铳 (肖宇航)	2582ms	6.8 MiB		330 Bytes	2023-10-12 22:00:45
AC	李禹衡 (liyuheng22006)	2605ms	580 KiB		322 Bytes	2022-9-26 18:34:07
AC	彭嘉豪 (pengjiahao)	2633ms	6.8 MiB		355 Bytes	2023-6-30 16:11:10
AC	爱琴海校区-黄辰浩 (huangchenhao)	2635ms	512 KiB		486 Bytes	2023-5-19 21:40:44
AC	zhanghaoran	2636ms	512 KiB		371 Bytes	2022-4-30 11:12:47
AC	时代二校-王盼兮 (wangpanxi)	2659ms	6.7 MiB		362 Bytes	2023-8-25 15:11:29
AC	张峻尘 (zjc)	2669ms	464 KiB		394 Bytes	2022-5-8 10:59:08
AC	LittleHair	2672ms	7.2 MiB	C++11	327 Bytes	2024-5-8 10:35:35
AC	ttt123	2683ms	464 KiB		377 Bytes	2023-4-8 12:25:15
AC	杨皓宇 (yanghaoyu)	2685ms	6.8 MiB		319 Bytes	2023-6-10 9:51:56
AC	杨瀚霖 (yanghanlin)	2703ms	6.8 MiB		369 Bytes	2023-6-10 9:51:33
AC	乐瀚阳 (yuehanyang)	2717ms	504 KiB		307 Bytes	2023-4-18 21:55:03
AC	zhaohaotong	2718ms	460 KiB		361 Bytes	2022-10-16 20:24:29
AC	ttt123	2727ms	456 KiB		377 Bytes	2023-4-8 12:25:13
AC	陈红恺 (chk)	2750ms	504 KiB		284 Bytes	2022-8-11 15:08:28
AC	三差学生(尘埃蓝莓) (白佳睿)	2752ms	6.9 MiB		317 Bytes	2023-9-9 10:57:47
AC	王祎辰 (wangyichen)	2770ms	6.7 MiB		376 Bytes	2023-8-31 11:50:51
AC	ttt123	2790ms	468 KiB		377 Bytes	2023-4-8 12:25:14
AC	杜是贤 (dushixian)	2791ms	504 KiB		319 Bytes	2022-5-8 10:51:12
AC	ttt123	2813ms	596 KiB		362 Bytes	2022-8-11 14:02:34
AC	黄俊皓	2816ms	512 KiB		427 Bytes	2022-3-5 19:00:26
AC	张梓浩 (zhangzihao)	2840ms	6.8 MiB		342 Bytes	2023-10-7 22:11:29
AC	CPL	2848ms	512 KiB		330 Bytes	2022-4-30 14:17:17
AC	什蒂尔布 (吴东航)	2850ms	564 KiB		310 Bytes	2022-7-27 17:51:19
AC	霍弈丞小号	2855ms	460 KiB		368 Bytes	2023-4-16 17:14:04
AC	黄梓轩 (huangzixuan)	2858ms	448 KiB		298 Bytes	2023-2-25 16:27:52
AC	ttt123	2868ms	468 KiB		377 Bytes	2023-4-8 12:25:15
AC	芒苒忧 (廖迦南)	2902ms	560 KiB		402 Bytes	2022-2-26 10:15:49
AC	彭嘉豪 (pengjiahao)	2908ms	6.8 MiB		355 Bytes	2023-6-30 16:20:10
AC	ttt123	2908ms	512 KiB		377 Bytes	2023-4-8 12:25:09
AC	ywh	2912ms	520 KiB		339 Bytes	2022-4-30 10:58:18
AC	ttt123	2935ms	512 KiB		377 Bytes	2023-4-8 12:25:14
AC	ttt123	2937ms	468 KiB		377 Bytes	2023-4-8 12:25:14
AC	李禹衡 (liyuheng22006)	2946ms	492 KiB		322 Bytes	2022-9-25 18:58:20
AC	xiongxinyao	2953ms	512 KiB		371 Bytes	2022-4-30 11:13:47
AC	你猜呀	2973ms	6.8 MiB		268 Bytes	2023-6-30 13:57:56
AC	(张洛诚)	2995ms	540 KiB		438 Bytes	2023-5-13 10:58:49
AC	在线销售陈杰晟	3031ms	456 KiB		440 Bytes	2022-4-30 11:04:02
AC	张泰凌 (ztl)	3107ms	512 KiB		359 Bytes	2022-4-30 11:15:21
AC	司雨来 (siyulai)	3108ms	584 KiB		370 Bytes	2023-1-4 19:19:17
AC	huyinuo	3151ms	512 KiB		401 Bytes	2022-4-30 21:52:31
AC	新一街校区Jason_LuoYouZheng (罗友峥)	3186ms	472 KiB		297 Bytes	2022-4-30 11:06:47
AC	22029-zjs	3191ms	548 KiB		392 Bytes	2023-4-7 18:09:06
AC	新一街校区Jason_LuoYouZheng (罗友峥)	3233ms	460 KiB		297 Bytes	2022-4-30 11:06:37
AC	zcx	3523ms	484 KiB		308 Bytes	2023-5-23 19:40:46
AC	李树崑 (lishukun)	3632ms	464 KiB		600 Bytes	2022-4-30 14:20:39
AC	(金沙天街)严皓月 (严皓月)	3632ms	512 KiB		337 Bytes	2023-5-15 19:23:25
AC	爱琴海校区-刁钲洋 (刁钲洋)	3645ms	512 KiB		462 Bytes	2023-5-15 20:38:14
AC	yuzk	3673ms	7 MiB	C++11	341 Bytes	2024-8-24 16:29:12
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)	3676ms	504 KiB		328 Bytes	2023-4-1 18:16:21
AC	小翔的粉丝	3701ms	7.5 MiB		276 Bytes	2023-7-3 9:30:49
AC	小翔的粉丝	3719ms	6.7 MiB		276 Bytes	2023-9-6 21:51:30
AC	11451254188 (22029-mjh)	3752ms	540 KiB		344 Bytes	2023-5-18 19:31:08
AC	李树崑 (lishukun)	3885ms	464 KiB		600 Bytes	2022-4-30 14:20:44
AC	zhangxiushi	3973ms	504 KiB		404 Bytes	2022-3-5 19:05:25
AC	赵一嵘 (zhaoyirong)	3991ms	512 KiB		397 Bytes	2022-4-30 14:18:37
AC	许律天	4510ms	584 KiB		349 Bytes	2024-2-21 16:28:23
AC	老六在此	5177ms	576 KiB	C++20	378 Bytes	2024-9-11 18:06:41
AC	许律天	5730ms	584 KiB		333 Bytes	2024-2-21 16:27:18