交换 a 和 b 的值

状态	递交者	时间	内存	语言	代码	递交时间
AC	黎舒萱)：杜雨帆duyufan (杜雨帆)	13ms	7.3 MiB	C++11	122 Bytes	2024-6-28 16:56:19
AC	罗竣瀚	13ms	392 KiB		113 Bytes	2022-6-19 15:29:00
AC	傀儡师 (zhujingen)	13ms	6.9 MiB	C++11	112 Bytes	2024-6-20 16:57:36
AC	laoyang	13ms	384 KiB		130 Bytes	2022-1-26 19:32:58
AC	陈奕瑾 (shenxiulinyue)	13ms	384 KiB		133 Bytes	2022-4-8 17:45:54
AC	郭睿	13ms	6.9 MiB	C++98	195 Bytes	2024-5-25 13:05:29
AC	Steven (王梓丞)	13ms	512 KiB		118 Bytes	2022-7-6 15:51:51
AC	AV8D (yumingjie11)	13ms	6.8 MiB		111 Bytes	2023-10-17 19:23:35
AC	余晨浩 (yuchenhao)	13ms	384 KiB		118 Bytes	2022-8-24 15:18:40
AC	wuqi	13ms	392 KiB		117 Bytes	2022-1-25 20:16:59
AC	俞伏羲	13ms	7.3 MiB	C++98(O2)	110 Bytes	2024-6-22 11:15:53
AC	李华峻 (willy)	13ms	392 KiB		104 Bytes	2022-1-26 15:41:22
AC	黄俊皓	13ms	384 KiB		157 Bytes	2022-1-21 19:07:16
AC	傅博涛	13ms	392 KiB		135 Bytes	2022-1-22 9:46:46
AC	嗨害嗨 (CQ01_XYZ)	13ms	444 KiB		106 Bytes	2022-4-23 18:18:25
AC	陈嘉熠	13ms	392 KiB		159 Bytes	2022-11-27 17:04:11
AC	zjq	13ms	384 KiB		131 Bytes	2022-1-16 10:01:44
AC	liusihan	13ms	384 KiB		112 Bytes	2022-5-22 19:14:24
AC	<让我看看谁在皮>	13ms	384 KiB		212 Bytes	2022-3-3 18:23:42
AC	Guest	13ms	6.6 MiB	C++98(O2)	112 Bytes	2024-7-17 20:55:46
AC	queue	13ms	7 MiB	C++98(O2)	141 Bytes	2024-6-15 19:14:34
AC	zhangyuzhe	13ms	412 KiB		117 Bytes	2022-3-24 16:19:30
AC	我很6 (zjj22031)	13ms	384 KiB		164 Bytes	2023-3-5 10:14:51
AC	吴卓轩	13ms	384 KiB		117 Bytes	2022-9-17 22:25:07
AC	罗毅川 (scp-049)	13ms	384 KiB		173 Bytes	2022-2-19 9:34:45
AC	wuqi	14ms	384 KiB		117 Bytes	2022-1-25 20:17:01
AC	chen (peter)	14ms	384 KiB		120 Bytes	2022-2-20 18:42:39
AC	曾龙兮	14ms	392 KiB		120 Bytes	2022-9-11 17:03:12
AC	yubowen	14ms	7 MiB	C++98	101 Bytes	2024-5-25 21:03:21
AC	王玺懿 (wxy)	14ms	452 KiB		121 Bytes	2022-7-21 17:48:28
AC	LDE__113 (逯典恩)	14ms	392 KiB		121 Bytes	2022-1-23 17:33:51
AC	赵浚言	14ms	6.7 MiB		120 Bytes	2023-9-24 12:59:00
AC	zhuziyu	14ms	392 KiB		151 Bytes	2022-2-19 9:43:47
AC	Guest	14ms	6.9 MiB	C++98(O2)	126 Bytes	2024-5-25 13:36:27
AC	wuqi	14ms	392 KiB		117 Bytes	2022-1-25 20:17:00
AC	wuqi	14ms	384 KiB		117 Bytes	2022-1-25 20:16:58
AC	许峻浩	14ms	384 KiB		179 Bytes	2023-3-29 22:17:44
AC	wuqi	14ms	452 KiB		117 Bytes	2022-1-25 20:16:57
AC	王义苇 (wangyiwei)	14ms	384 KiB		107 Bytes	2023-4-1 22:12:03
AC	某某 (xuhaotian)	14ms	384 KiB		152 Bytes	2022-2-19 15:51:25
AC	303	14ms	384 KiB		102 Bytes	2022-3-13 10:11:29
AC	wuqi	14ms	392 KiB		117 Bytes	2022-1-25 20:17:02
AC	田世瑞	14ms	6.8 MiB		121 Bytes	2023-10-26 14:41:58
AC	微风将至 (李睿轩)	14ms	384 KiB		158 Bytes	2022-4-8 20:12:09
AC	LukeDid	14ms	436 KiB		144 Bytes	2023-4-22 18:49:20
AC	李信 (朱子龙)	14ms	6.6 MiB	C++11	113 Bytes	2024-7-30 10:43:57
AC	李某人	14ms	384 KiB		123 Bytes	2022-1-21 17:29:42
AC	chenyifei	14ms	384 KiB		140 Bytes	2022-1-22 18:58:51
AC	龍小燚 (lqj)	14ms	392 KiB		121 Bytes	2022-1-22 14:21:59
AC	江科毅 (jky)	14ms	392 KiB		117 Bytes	2023-4-2 13:45:05
AC	yuchenyi23017	14ms	7.2 MiB		125 Bytes	2023-11-25 22:33:19
AC	王梓烨	14ms	384 KiB		128 Bytes	2022-1-26 20:11:10
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)	14ms	412 KiB		123 Bytes	2023-3-25 10:35:34
AC	wuqi	14ms	392 KiB		117 Bytes	2022-1-25 20:16:56
AC	韦孟巡_1	14ms	384 KiB		118 Bytes	2023-4-16 17:15:38
AC	赵彬鸿	14ms	392 KiB		108 Bytes	2022-8-12 14:20:52
AC	zhuqiwei22006	14ms	392 KiB		111 Bytes	2022-3-20 19:10:21
AC	stehpen_zuo	14ms	7.2 MiB	C++98	179 Bytes	2024-5-10 16:43:43
AC	某某某	14ms	384 KiB		113 Bytes	2022-4-15 21:56:14
AC	史继来	14ms	6.8 MiB		113 Bytes	2023-10-13 18:17:12
AC	hzm	14ms	460 KiB		111 Bytes	2022-8-11 16:02:05
AC	明哲瀚 (18580067605)	14ms	384 KiB		122 Bytes	2022-10-2 21:09:15
AC	许嘉恩 (xje22031)	14ms	384 KiB		134 Bytes	2022-11-8 22:42:04
AC	l;k (陈彬宾)	14ms	384 KiB		132 Bytes	2022-3-10 19:41:46
AC	huyinuo	14ms	444 KiB		120 Bytes	2022-2-14 22:00:27
AC	(-v-)ikun ((-v-))	14ms	428 KiB		117 Bytes	2022-9-11 11:44:35
AC	wuqi	14ms	384 KiB		117 Bytes	2022-1-25 20:17:00
AC	SYH.邵允涵 (Zoe邵)	14ms	6.7 MiB		128 Bytes	2023-3-20 14:38:00
AC	郑隽霖	14ms	7 MiB	C++17	111 Bytes	2024-5-28 15:35:05
AC	kin of kin (jojo)	14ms	384 KiB		135 Bytes	2022-3-11 20:51:25
AC	wuqi	14ms	384 KiB		117 Bytes	2022-1-25 20:16:58
AC	yanglang	14ms	436 KiB		116 Bytes	2022-10-15 19:43:28
AC	Yin2009	14ms	392 KiB		116 Bytes	2022-9-12 20:53:48
AC	wuqi	14ms	384 KiB		117 Bytes	2022-1-25 20:16:58
AC	BJ6180C8CTD (Fan)	14ms	6.7 MiB		147 Bytes	2023-9-17 8:28:08
AC	余龙恩---来自额嘛瑞卡 (yulongenshijieshangzuishuai)	14ms	384 KiB		140 Bytes	2022-1-22 8:39:07
AC	张泰凌 (ztl)	14ms	388 KiB		119 Bytes	2022-1-24 15:29:13
AC	dengfeng	14ms	384 KiB		142 Bytes	2022-2-10 14:34:44
AC	21035-wyf	14ms	384 KiB		134 Bytes	2022-3-4 18:04:04
AC	疯神芭芭脱丝 (李卓修)	14ms	392 KiB		128 Bytes	2022-1-21 17:15:54
AC	蒲梓勋 (puzixun)	14ms	384 KiB		130 Bytes	2022-6-26 10:24:16
AC	杨淇瑞 (杨淇瑞29)	14ms	384 KiB		156 Bytes	2023-5-29 21:11:48
AC	我是个s* (lijinze)	14ms	384 KiB		116 Bytes	2023-5-27 14:22:15
AC	强奸肾[冷漠] (05c41-zjb)	14ms	420 KiB		118 Bytes	2022-8-7 13:37:51
AC	qinyi	14ms	384 KiB		173 Bytes	2022-2-19 17:26:28
AC	叶哲宇 (yzy)	14ms	436 KiB		138 Bytes	2023-4-8 17:59:49
AC	yuzk	14ms	6.6 MiB	C++11	115 Bytes	2024-7-10 18:57:27
AC	xuaonan	14ms	424 KiB		123 Bytes	2022-2-20 9:55:07
AC	詹宇航 (zyh7)	14ms	432 KiB		107 Bytes	2022-4-20 21:05:53
AC	邬文博 (wwb)	14ms	392 KiB		124 Bytes	2023-4-17 22:08:00
AC	wuqi	14ms	388 KiB		117 Bytes	2022-1-25 20:17:01
AC	chenxiyu	14ms	384 KiB		121 Bytes	2022-10-23 12:37:19
AC	王康瑞	14ms	6.8 MiB		166 Bytes	2023-9-30 11:39:25
AC	你爹 (郭铠嘉)	14ms	512 KiB		123 Bytes	2022-1-25 20:15:13
AC	Ronnie	14ms	512 KiB		149 Bytes	2022-1-19 16:29:43
AC	周功杭	14ms	512 KiB		117 Bytes	2022-4-30 13:11:34
AC	ttt123	14ms	6.9 MiB		111 Bytes	2023-7-8 18:01:03
AC	wky	14ms	392 KiB		120 Bytes	2022-4-4 18:09:18
AC	GYZ	14ms	392 KiB		133 Bytes	2022-3-9 18:59:25
AC	金沙校区-王俊元 (王俊元)	14ms	6.7 MiB		157 Bytes	2023-9-9 22:00:43