判断数字的正负

状态	递交者	时间	内存	代码	递交时间
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)	15ms	424 KiB	197 Bytes	2023-5-13 9:19:03
AC	余晨浩 (yuchenhao)	15ms	7 MiB	318 Bytes	2023-8-31 14:50:18
AC	ganlin1	15ms	6.9 MiB	187 Bytes	2023-7-12 13:53:44
AC	杨皓宇 (杨浩宇)	15ms	436 KiB	222 Bytes	2022-8-2 17:10:47
AC	廖永亨	15ms	428 KiB	226 Bytes	2022-11-30 17:56:06
AC	六 (江智昕)	15ms	408 KiB	226 Bytes	2022-12-29 16:55:09
AC	zhangyouze (张佑泽)	15ms	6.8 MiB	210 Bytes	2023-10-26 22:31:47
AC	lao_ba	15ms	6.7 MiB	195 Bytes	2023-9-30 16:30:32
AC	zyp (wangjunling23010)	15ms	384 KiB	255 Bytes	2023-3-24 18:35:07
AC	中岛敦 (黄麒瑞)	15ms	436 KiB	258 Bytes	2023-2-3 10:22:37
AC	黄立信	15ms	6.8 MiB	202 Bytes	2023-10-10 22:02:37
AC	靳博然 (jbr)	15ms	384 KiB	224 Bytes	2023-3-26 18:02:45
AC	zhangheyi22006	15ms	436 KiB	176 Bytes	2022-12-7 17:42:33
AC	新壹街朱启航 (zhuqihang)	15ms	436 KiB	228 Bytes	2023-2-12 12:20:42
AC	zzl	15ms	6.8 MiB	236 Bytes	2023-11-6 20:57:28
AC	李旻轩	15ms	432 KiB	304 Bytes	2023-3-2 19:12:15
AC	UsMt1 (jiangyuan)	15ms	6.7 MiB	210 Bytes	2023-9-15 20:23:43
AC	钟元朗	15ms	512 KiB	189 Bytes	2022-9-10 9:17:05
AC	六 (江智昕)	15ms	448 KiB	226 Bytes	2022-12-29 16:55:00
AC	童艺涵	15ms	512 KiB	222 Bytes	2022-12-7 20:41:03
AC	伍芷函	15ms	432 KiB	226 Bytes	2022-11-16 20:58:10
AC	罗一鸣	15ms	6.9 MiB	236 Bytes	2023-10-15 17:57:53
AC	tyx_9192596	15ms	512 KiB	200 Bytes	2023-3-18 14:36:55
AC	印昭旭（412） (印昭旭)	15ms	6.7 MiB	177 Bytes	2023-6-9 15:46:56
AC	田信 (tianxincn1)	15ms	392 KiB	207 Bytes	2022-9-30 14:11:23
AC	六 (江智昕)	15ms	384 KiB	226 Bytes	2022-12-29 16:55:14
AC	yangbinyu	15ms	432 KiB	251 Bytes	2022-9-20 21:30:27
AC	重庆新壹街-钟政鑫 (钟政鑫)	15ms	6.8 MiB	179 Bytes	2023-10-10 21:12:13
AC	凌肯 (lingken22006)	15ms	512 KiB	200 Bytes	2022-7-31 18:52:37
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	384 KiB	162 Bytes	2023-4-1 19:38:54
AC	新壹街.曾祥睿 (zxr)	15ms	6.9 MiB	177 Bytes	2023-8-15 21:00:12
AC	林子沫awa (linziyue)	15ms	444 KiB	234 Bytes	2023-3-16 22:33:15
AC	yh1	15ms	7 MiB	206 Bytes	2023-7-13 9:08:09
AC	余晨浩 (yuchenhao)	15ms	6.7 MiB	347 Bytes	2023-8-31 14:40:55
AC	南坪校区-龙浩睿 (longhaorui)	15ms	436 KiB	207 Bytes	2023-2-18 11:36:38
AC	明哲瀚 (18580067605)	15ms	444 KiB	234 Bytes	2022-9-30 21:07:44
AC	任伊涵	15ms	6.9 MiB	222 Bytes	2023-7-28 16:44:20
AC	新壹街罗田雨 (罗田雨29)	15ms	6.9 MiB	198 Bytes	2023-11-28 23:19:18
AC	唐梓竣	15ms	512 KiB	411 Bytes	2023-4-9 9:32:01
AC	zhr	15ms	428 KiB	222 Bytes	2023-4-16 17:26:43
AC	pandap&a王皓宸 (WANGHAOCHEN)	15ms	440 KiB	199 Bytes	2022-11-5 11:17:48
AC	六 (江智昕)	15ms	384 KiB	226 Bytes	2022-12-29 16:55:15
AC	zhangzhixiong	15ms	432 KiB	216 Bytes	2022-12-4 15:31:10
AC	明哲瀚 (18580067605)	15ms	392 KiB	240 Bytes	2022-9-30 21:07:33
AC	曹埊睿 (caodirui)	15ms	512 KiB	199 Bytes	2023-3-22 21:50:17
AC	吴卓轩	15ms	384 KiB	250 Bytes	2022-9-10 15:14:48
AC	dengduxi	15ms	448 KiB	201 Bytes	2022-11-27 13:11:19
AC	吕一言	15ms	7.1 MiB	216 Bytes	2023-12-9 18:54:36
AC	余晨浩 (yuchenhao)	15ms	7 MiB	318 Bytes	2023-8-31 14:51:38
AC	余晨浩 (yuchenhao)	15ms	7 MiB	318 Bytes	2023-8-31 14:51:52
AC	朱老师 (zyp)	15ms	436 KiB	179 Bytes	2023-2-18 17:42:11
AC	罗莎莎	15ms	6.9 MiB	218 Bytes	2023-7-20 16:59:08
AC	六 (江智昕)	15ms	392 KiB	226 Bytes	2022-12-29 16:55:16
AC	zhangxs	15ms	6.8 MiB	216 Bytes	2023-6-11 16:30:21
AC	王彬羽 (wby)	15ms	7.2 MiB	245 Bytes	2023-6-24 11:18:05
AC	明哲瀚 (18580067605)	15ms	384 KiB	234 Bytes	2022-9-30 21:07:46
AC	余晨浩 (yuchenhao)	15ms	6.7 MiB	318 Bytes	2023-8-31 14:55:08
AC	何星震 (Jacob)	15ms	512 KiB	194 Bytes	2022-10-7 9:24:42
AC	六 (江智昕)	15ms	384 KiB	226 Bytes	2022-12-29 16:55:12
AC	刘致言	15ms	436 KiB	213 Bytes	2023-3-11 9:20:10
AC	许嘉恩 (xje22031)	15ms	512 KiB	217 Bytes	2022-11-10 22:11:17
AC	张承暄	15ms	6.9 MiB	184 Bytes	2023-7-2 19:03:10
AC	Nico	15ms	512 KiB	241 Bytes	2022-12-23 16:55:26
AC	colin1112 (墙凌可)	15ms	436 KiB	202 Bytes	2023-1-22 12:25:49
AC	金沙校区-李嘉齐 (李嘉齐)	15ms	7.3 MiB	242 Bytes	2024-1-20 20:08:32
AC	爱琴海校区-刁钲洋 (刁钲洋)	15ms	512 KiB	209 Bytes	2022-9-15 20:35:19
AC	yanglang	15ms	436 KiB	199 Bytes	2022-10-16 15:38:58
AC	wuqilin	15ms	512 KiB	198 Bytes	2022-10-22 23:26:08
AC	wangziji	16ms	440 KiB	178 Bytes	2023-4-15 9:38:13
AC	六 (江智昕)	16ms	392 KiB	226 Bytes	2022-12-29 16:55:16
AC	陈骏逸 (chenjunyi)	16ms	436 KiB	183 Bytes	2022-7-15 10:56:57
AC	OJ00001 (陈帅)	16ms	7.1 MiB	226 Bytes	2024-1-21 15:42:16
AC	444444444 (唐跃元)	16ms	6.7 MiB	209 Bytes	2023-8-24 15:54:44
AC	李彦臻	16ms	436 KiB	259 Bytes	2022-11-17 10:40:00
AC	司雨来 (siyulai)	16ms	384 KiB	198 Bytes	2022-10-6 16:34:18
AC	神印王座	16ms	384 KiB	230 Bytes	2022-9-17 15:43:47
AC	zzzrrrxxx	16ms	7 MiB	180 Bytes	2023-7-13 9:05:28
AC	韩思辰 (hansichen)	16ms	440 KiB	196 Bytes	2022-11-17 17:40:18
AC	余晨浩 (yuchenhao)	16ms	6.7 MiB	318 Bytes	2023-8-31 14:47:58
AC	叶雨昊 (yeyuhao22006)	16ms	512 KiB	192 Bytes	2022-10-23 19:39:48
AC	王瀚毅 (wanghanyi)	16ms	384 KiB	216 Bytes	2022-10-16 11:30:55
AC	炸鱼4000+ (dxc)	16ms	428 KiB	222 Bytes	2023-1-24 10:36:39
AC	车涌强	16ms	6.9 MiB	192 Bytes	2023-6-17 16:20:39
AC	胡澜之 (666hlz666)	16ms	7.1 MiB	274 Bytes	2023-7-3 16:24:14
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	16ms	424 KiB	231 Bytes	2022-10-2 11:15:50
AC	sb (吴振宇)	16ms	440 KiB	214 Bytes	2023-1-6 21:04:41
AC	SB (mfy01)	16ms	512 KiB	228 Bytes	2022-12-2 13:35:31
AC	xuniaoyin (徐袅音)	16ms	6.9 MiB	213 Bytes	2023-7-18 10:16:14
AC	龙思颖 (lsy)	16ms	436 KiB	219 Bytes	2023-3-6 20:08:33
AC	尹浩宁2077	16ms	6.8 MiB	216 Bytes	2023-6-8 20:26:59
AC	新壹街——陈学彬 (BUG)	16ms	6.8 MiB	188 Bytes	2023-6-24 9:48:53
AC	繁星 (05c35-zzm)	16ms	440 KiB	240 Bytes	2022-10-31 19:20:01
AC	谁陪訫牞（杀手） (22029-zys)	16ms	436 KiB	230 Bytes	2022-12-28 17:38:47
AC	jiangjc	16ms	6.8 MiB	186 Bytes	2023-6-11 16:07:05
AC	yxj	16ms	448 KiB	193 Bytes	2022-10-20 15:11:24
AC	RanHao	16ms	6.9 MiB	221 Bytes	2023-7-20 16:58:45
AC	杜是贤 (dushixian)	16ms	512 KiB	175 Bytes	2022-11-26 11:22:16
AC	新壹街陈科言 (cky)	16ms	6.9 MiB	202 Bytes	2023-7-19 11:27:50
AC	leisixian (22029-lyh)	16ms	440 KiB	246 Bytes	2023-3-23 18:43:47
AC	余晨浩 (yuchenhao)	16ms	6.7 MiB	318 Bytes	2023-8-31 14:48:28