整数奇偶排序

状态	递交者	时间	内存	语言	代码	递交时间
AC	汪致卉 (wangzh)	5ms	256 KiB		1.7 KiB	2022-5-21 22:17:41
AC	杜俊宏	6ms	256 KiB		613 Bytes	2022-5-21 8:42:19
AC	李树崑 (lishukun)	6ms	256 KiB		1.3 KiB	2022-4-30 14:31:01
AC	魏楚浔 (shawn)	6ms	264 KiB		461 Bytes	2022-3-27 18:33:13
AC	11111	6ms	264 KiB	C	613 Bytes	2022-6-30 16:21:13
AC	ddz	7ms	272 KiB		428 Bytes	2022-3-27 18:37:26
AC	赵鑫宸 (xiaoxiao721)	7ms	300 KiB		613 Bytes	2022-3-26 18:43:25
AC	张子轩 (zhangzixuana)	7ms	6.8 MiB		511 Bytes	2023-11-24 18:00:31
AC	胡宸华 (huchenhua)	7ms	308 KiB		921 Bytes	2022-2-12 19:29:14
AC	liujingxing(我要李毛川!) (liujingxing)	10ms	7.1 MiB		481 Bytes	2024-1-24 16:50:01
AC	欧俊阳	12ms	7.3 MiB		570 Bytes	2024-1-6 15:20:22
AC	NJL (NJlL)	12ms	420 KiB		318 Bytes	2022-6-12 16:39:15
AC	德意志第三帝国 (陈远桥)	12ms	384 KiB		371 Bytes	2022-6-12 17:02:08
AC	冒牌陈杰晟【MOD】 (wed)	12ms	384 KiB		306 Bytes	2022-3-27 18:31:13
AC	huanglu	12ms	420 KiB		364 Bytes	2022-6-14 13:51:26
AC	李山水	12ms	384 KiB		545 Bytes	2022-6-12 18:05:37
AC	秦子越 (13883322087)	12ms	384 KiB		410 Bytes	2022-6-12 21:48:24
AC	新一街校区Jason_LuoYouZheng (罗友峥)	12ms	384 KiB		449 Bytes	2022-6-11 19:44:01
AC	朱泓屹 (ZYH)	12ms	512 KiB		355 Bytes	2022-6-12 19:45:42
AC	86想要钱 (twt)	12ms	384 KiB		451 Bytes	2023-2-17 19:10:38
AC	kin of kin (jojo)	12ms	448 KiB		475 Bytes	2022-6-12 17:29:26
AC	徐子恩 (Cow)	12ms	384 KiB		328 Bytes	2022-6-12 20:04:40
AC	杜是贤 (dushixian)	12ms	384 KiB		608 Bytes	2022-5-17 20:34:36
AC	huyinuo	12ms	384 KiB		759 Bytes	2022-6-12 17:30:22
AC	luoluonuoya	12ms	384 KiB		572 Bytes	2022-3-27 15:03:20
AC	l;k (陈彬宾)	12ms	384 KiB		327 Bytes	2022-6-12 20:07:31
AC	朱昱丞	13ms	384 KiB		367 Bytes	2022-6-12 19:48:04
AC	关博源	13ms	384 KiB		391 Bytes	2023-5-20 10:09:13
AC	CMG	13ms	384 KiB		342 Bytes	2022-6-12 19:46:04
AC	wuzhenghan	13ms	384 KiB		380 Bytes	2023-2-15 21:45:40
AC	wuzhenghan	13ms	440 KiB		380 Bytes	2023-2-15 21:45:12
AC	wuzhenghan	13ms	384 KiB		380 Bytes	2023-2-15 21:45:13
AC	陈杰晟	13ms	384 KiB		679 Bytes	2022-4-30 15:16:53
AC	Zongzi1	13ms	6.6 MiB	C++17(O2)	522 Bytes	2024-7-24 17:35:41
AC	张玉坚 (zhangyuian)	13ms	436 KiB		325 Bytes	2023-3-5 16:41:42
AC	不怎么聪明的家伙 (贺俊楠)	13ms	7 MiB	C++98(O2)	523 Bytes	2024-5-13 20:58:04
AC	Error404sans (焦阳浩云)	13ms	6.9 MiB	C++20(O2)	1.6 KiB	2024-6-12 21:12:52
AC	yu (赵子瑜)	13ms	412 KiB		422 Bytes	2022-3-27 18:55:31
AC	霍弈丞小号	13ms	384 KiB		525 Bytes	2023-3-5 16:38:48
AC	张泰凌 (ztl)	13ms	384 KiB		612 Bytes	2022-6-11 9:26:58
AC	刘锦航	13ms	384 KiB		394 Bytes	2022-6-8 20:23:40
AC	zlx (xiao)	13ms	512 KiB		429 Bytes	2022-6-5 19:42:15
AC	赵泳鑫 (zhaoyongxin)	13ms	384 KiB		504 Bytes	2022-6-12 17:04:20
AC	陈杰晟	13ms	392 KiB		362 Bytes	2022-6-11 20:14:01
AC	wuzhenghan	13ms	384 KiB		380 Bytes	2023-2-15 22:00:51
AC	CPL	13ms	384 KiB		612 Bytes	2022-4-30 14:47:33
AC	wuzhenghan	13ms	400 KiB		380 Bytes	2023-2-15 21:45:44
AC	wuzhenghan	13ms	384 KiB		380 Bytes	2023-2-15 21:45:43
AC	伍芷函	13ms	384 KiB		487 Bytes	2023-3-5 16:37:23
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	13ms	444 KiB		440 Bytes	2022-6-11 19:22:57
AC	Tang	13ms	384 KiB		1.2 KiB	2022-6-4 9:46:55
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)	13ms	384 KiB		411 Bytes	2023-5-20 11:09:45
AC	姚宏逸	13ms	384 KiB		486 Bytes	2022-1-30 21:00:56
AC	yu (赵子瑜)	13ms	384 KiB		422 Bytes	2022-3-27 18:55:31
AC	拥抱幸福小熊(吴沛篪)	13ms	6.9 MiB	C++98	659 Bytes	2024-6-22 10:20:21
AC	你爹 (郭铠嘉)	13ms	392 KiB		644 Bytes	2022-3-27 10:04:46
AC	Chter	13ms	512 KiB		675 Bytes	2023-5-21 11:42:37
AC	熊奕博 (Mothefuck)	13ms	384 KiB		318 Bytes	2023-3-5 16:51:55
AC	孟子轩 (km老冯)	13ms	384 KiB		360 Bytes	2022-3-27 18:39:58
AC	伍芷函	13ms	388 KiB		487 Bytes	2023-3-5 16:37:12
AC	贾鑫豪 (Mr Sam)	13ms	392 KiB		476 Bytes	2022-4-30 14:34:38
AC	yu (赵子瑜)	13ms	384 KiB		422 Bytes	2022-3-27 18:55:32
AC	wangjunhan	13ms	384 KiB		449 Bytes	2022-6-11 19:38:40
AC	314	13ms	384 KiB		533 Bytes	2023-5-16 20:07:41
AC	wuzhenghan	13ms	440 KiB		380 Bytes	2023-2-15 21:42:55
AC	chen (peter)	13ms	384 KiB		292 Bytes	2022-3-27 18:32:06
AC	chenyifei	13ms	512 KiB		481 Bytes	2022-6-12 17:37:08
AC	zhangyh (张育菡)	13ms	384 KiB		695 Bytes	2022-6-27 21:31:56
AC	yu (赵子瑜)	13ms	392 KiB		422 Bytes	2022-3-27 18:55:31
AC	wangruibo20xh	13ms	512 KiB		344 Bytes	2022-2-14 13:54:57
AC	scallway	13ms	416 KiB		660 Bytes	2023-2-24 23:09:26
AC	leisixian (22029-lyh)	13ms	384 KiB		509 Bytes	2023-4-2 10:04:14
AC	yu (赵子瑜)	13ms	392 KiB		422 Bytes	2022-3-27 18:55:30
AC	jonsylee	13ms	6.9 MiB		377 Bytes	2023-11-10 23:28:04
AC	李彭宋代诗人 (ljy123456)	13ms	384 KiB		705 Bytes	2023-4-6 21:10:24
AC	1396013295	13ms	392 KiB		564 Bytes	2022-1-23 18:51:19
AC	zhanghaoran	13ms	384 KiB		571 Bytes	2022-5-14 9:22:48
AC	05c05-scl	13ms	384 KiB		424 Bytes	2022-10-6 18:36:55
AC	sqmyb	13ms	384 KiB		342 Bytes	2023-3-5 16:39:52
AC	肖添宇	13ms	384 KiB		521 Bytes	2022-3-26 18:44:19
AC	yu (赵子瑜)	14ms	384 KiB		422 Bytes	2022-3-27 18:55:28
AC	经常消失 (小萝卜)	14ms	384 KiB		618 Bytes	2022-4-30 14:53:03
AC	wuzhenghan	14ms	384 KiB		380 Bytes	2023-2-15 21:45:44
AC	陈杰晟	14ms	392 KiB		462 Bytes	2022-3-27 18:49:39
AC	陈雨泽1	14ms	384 KiB		458 Bytes	2023-2-1 17:17:52
AC	Guest	14ms	7.2 MiB	C++98	592 Bytes	2024-4-27 17:51:30
AC	疯神芭芭脱丝 (李卓修)	14ms	436 KiB		532 Bytes	2022-3-13 18:39:41
AC	龙沁均 (我是S神)	14ms	384 KiB		440 Bytes	2022-6-11 19:25:11
AC	wuzhenghan	14ms	392 KiB		380 Bytes	2023-2-15 21:45:49
AC	我谢谢你全家	14ms	384 KiB		306 Bytes	2022-3-27 18:32:32
AC	scallway	14ms	384 KiB		619 Bytes	2023-2-24 21:53:45
AC	zhm123	14ms	436 KiB		664 Bytes	2023-5-8 18:54:37
AC	郑岐蔚	14ms	384 KiB		293 Bytes	2023-2-18 12:21:40
AC	wuzhenghan	14ms	384 KiB		380 Bytes	2023-2-15 21:45:50
AC	Tender. (05c05-zhou)	14ms	420 KiB		529 Bytes	2022-12-8 18:50:15
AC	11451254188 (22029-mjh)	14ms	428 KiB		509 Bytes	2023-4-9 15:09:53
AC	chen (peter)	14ms	384 KiB		306 Bytes	2022-3-27 18:35:54
AC	曾御城（现用名） (Jason)	14ms	512 KiB		668 Bytes	2022-1-24 16:16:57
AC	MoonLight ( aaa)	14ms	428 KiB		344 Bytes	2022-4-28 21:00:01
AC	My name is Man (钟卓劭)	14ms	7.3 MiB	C++98	428 Bytes	2024-4-26 19:22:40