判断是否为两位数

状态	递交者	时间	内存	语言	代码	递交时间
AC	wangshuo	13ms	392 KiB		161 Bytes	2022-10-2 12:21:42
AC	强奸肾[冷漠] (05c41-zjb)	13ms	448 KiB		147 Bytes	2022-2-27 16:40:57
AC	苏庭毅	13ms	512 KiB		157 Bytes	2023-2-25 20:25:04
AC	经常消失 (小萝卜)	13ms	444 KiB		176 Bytes	2022-3-12 22:33:22
AC	邹曜丞 (13983097018)	13ms	512 KiB		144 Bytes	2023-4-21 20:24:13
AC	城市之光	13ms	392 KiB		181 Bytes	2023-2-18 11:57:34
AC	何锦宸熙	13ms	6.9 MiB		143 Bytes	2023-10-28 20:21:05
AC	wuqilin	13ms	420 KiB		152 Bytes	2023-2-2 14:48:14
AC	张梓浩 (zhangzihao)	13ms	436 KiB		168 Bytes	2023-3-29 21:07:47
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	512 KiB		161 Bytes	2023-5-15 18:50:22
AC	icwy (zuolun)	13ms	384 KiB		166 Bytes	2022-4-16 15:04:30
AC	邹曜丞 (13983097018)	13ms	384 KiB		144 Bytes	2023-4-21 20:24:15
AC	强愉堃 (强愉堃1)	13ms	420 KiB		160 Bytes	2023-2-25 20:02:55
AC	王瀚毅 (wanghanyi)	13ms	384 KiB		137 Bytes	2022-10-2 12:38:42
AC	ylc	13ms	392 KiB		170 Bytes	2022-9-2 19:02:48
AC	张祖名	13ms	7.4 MiB		211 Bytes	2024-1-21 18:34:53
AC	11451254188 (22029-mjh)	13ms	384 KiB		178 Bytes	2022-11-13 11:11:05
AC	拥抱幸福小熊(吴沛篪)	13ms	7 MiB		151 Bytes	2023-11-4 11:44:56
AC	zzl	13ms	6.8 MiB		163 Bytes	2023-11-7 0:16:37
AC	时代校区-刘臣原 (微笑王子)	13ms	540 KiB		149 Bytes	2022-11-17 21:20:11
AC	任远宁 (renyuanning)	13ms	444 KiB		172 Bytes	2022-8-13 21:00:28
AC	苏庭毅	13ms	384 KiB		157 Bytes	2023-2-25 20:25:01
AC	刘昱辰	13ms	384 KiB		168 Bytes	2022-9-2 19:06:46
AC	Cristiano·Ronaldo (05c41-gmz)	13ms	432 KiB		143 Bytes	2022-7-27 13:38:21
AC	aoyu22003	13ms	384 KiB		183 Bytes	2023-3-11 17:47:21
AC	苏庭毅	13ms	512 KiB		157 Bytes	2023-2-25 20:24:57
AC	AC[谭赫奕] (tanheyi)	13ms	512 KiB		167 Bytes	2023-1-19 13:43:16
AC	源著校区-宋昊成 (马冬梅)	13ms	432 KiB		150 Bytes	2023-2-25 18:02:00
AC	爱琴海校区jzn (jzn)	13ms	384 KiB		149 Bytes	2023-2-4 11:40:42
AC	Noah (mwx)	13ms	7.2 MiB	C++98	1.3 KiB	2024-5-6 19:09:37
AC	李山水	13ms	388 KiB		191 Bytes	2022-1-29 13:17:44
AC	CK (李弘毅)	13ms	440 KiB		159 Bytes	2022-8-14 11:21:44
AC	Him神	13ms	6.8 MiB		185 Bytes	2023-10-6 12:36:46
AC	05c41-hzs	13ms	436 KiB		185 Bytes	2022-2-28 21:05:26
AC	明哲瀚 (18580067605)	13ms	384 KiB		180 Bytes	2022-10-1 13:43:50
AC	陈致远Lynn	13ms	7.1 MiB	C++11	176 Bytes	2024-8-25 11:02:51
AC	向俊熙 (xiangjunxi23003)	13ms	400 KiB		135 Bytes	2023-3-11 17:45:30
AC	Tang	13ms	512 KiB		148 Bytes	2022-2-19 10:09:26
AC	呵呵呵 (陈思琦)	13ms	416 KiB		135 Bytes	2022-9-3 16:53:21
AC	六 (江智昕)	13ms	436 KiB		170 Bytes	2023-2-25 12:02:23
AC	yangyutong22003	13ms	384 KiB		184 Bytes	2023-3-11 17:46:01
AC	王晴萱	13ms	7.4 MiB		162 Bytes	2023-7-14 13:55:33
AC	明哲瀚 (18580067605)	13ms	384 KiB		180 Bytes	2022-10-1 13:43:51
AC	zhanglianjie	13ms	392 KiB		169 Bytes	2023-3-11 17:46:07
AC	在煎鱼的肖大总铳 (肖宇航)	13ms	6.8 MiB		183 Bytes	2023-9-24 10:58:05
AC	苏庭毅	13ms	392 KiB		157 Bytes	2023-2-25 20:25:08
AC	时代一校-曾科智 (曾科智)	13ms	432 KiB		154 Bytes	2023-2-25 19:35:04
AC	罗元邑	13ms	396 KiB		175 Bytes	2023-2-4 11:37:01
AC	苏庭毅	13ms	384 KiB		157 Bytes	2023-2-25 20:25:01
AC	关博源	13ms	512 KiB		151 Bytes	2023-3-5 15:38:32
AC	我全家SB！！！我没母！！！ (baijinlin)	13ms	392 KiB		164 Bytes	2023-3-11 17:34:42
AC	陈于硕	13ms	392 KiB		165 Bytes	2023-2-5 17:00:19
AC	xieyubei	13ms	512 KiB		163 Bytes	2022-10-15 12:32:32
AC	李金珂	13ms	440 KiB		159 Bytes	2022-8-12 13:40:07
AC	zenghaoran	13ms	6.7 MiB		166 Bytes	2023-8-27 10:21:50
AC	时代一校林星宇 (lxy)	13ms	424 KiB		151 Bytes	2022-11-26 23:25:30
AC	蒋帅辉	13ms	436 KiB		197 Bytes	2022-2-21 15:26:27
AC	贾博涵	13ms	6.8 MiB		130 Bytes	2023-11-7 14:39:26
AC	火爆肥肠（杨弘毅） (火爆肥肠)	13ms	440 KiB		178 Bytes	2022-3-4 22:25:43
AC	胡程禹	13ms	440 KiB		160 Bytes	2023-2-25 20:24:49
AC	xiongxinyao	13ms	440 KiB		261 Bytes	2022-11-17 19:53:30
AC	希蒙 (zhengxingya)	13ms	6.9 MiB		140 Bytes	2023-8-20 17:22:21
AC	苏庭毅	13ms	384 KiB		157 Bytes	2023-2-25 20:24:56
AC	唐彬献	13ms	7.2 MiB		132 Bytes	2023-11-4 11:38:28
AC	许徐非凡 (非同凡响)	13ms	384 KiB		136 Bytes	2022-10-7 19:06:40
AC	苏庭毅	13ms	384 KiB		157 Bytes	2023-2-25 20:25:06
AC	苏庭毅	13ms	392 KiB		157 Bytes	2023-2-25 20:25:02
AC	新壹街校区--税崇峻 (税崇峻)	13ms	6.9 MiB		149 Bytes	2023-7-27 19:56:06
AC	quzhibo	13ms	384 KiB		153 Bytes	2022-9-3 17:05:19
AC	huyunyi23003	13ms	384 KiB		185 Bytes	2023-3-11 17:49:03
AC	(张洛诚)	13ms	436 KiB		196 Bytes	2023-4-19 19:16:47
AC	K517	13ms	7 MiB		167 Bytes	2023-12-17 16:19:50
AC	ganlin1	13ms	7.1 MiB		128 Bytes	2023-7-13 16:21:05
AC	罗翌珂 (dangdang)	13ms	440 KiB		147 Bytes	2022-8-27 10:31:27
AC	廖永亨	13ms	436 KiB		176 Bytes	2022-12-4 20:04:08
AC	22029-lyh	13ms	384 KiB		161 Bytes	2023-3-23 18:51:31
AC	我全家SB！！！我没母！！！ (baijinlin)	13ms	396 KiB		164 Bytes	2023-3-11 17:34:44
AC	zzzrrrxxx	13ms	6.9 MiB		143 Bytes	2023-7-18 11:15:59
AC	一片落叶 (yeyuhao)	13ms	6.7 MiB		140 Bytes	2023-8-28 20:19:17
AC	曹烜豪	13ms	428 KiB		156 Bytes	2023-3-1 18:37:33
AC	王祎辰 (wangyichen)	13ms	7 MiB		190 Bytes	2023-6-29 20:40:57
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	13ms	440 KiB		143 Bytes	2022-8-31 19:01:26
AC	86想要钱 (twt)	13ms	392 KiB		168 Bytes	2022-10-2 11:03:21
AC	pandap&a王皓宸 (WANGHAOCHEN)	13ms	512 KiB		159 Bytes	2022-11-12 11:26:21
AC	罗竣瀚	13ms	384 KiB		134 Bytes	2022-11-17 21:42:20
AC	新壹街——陈学彬 (BUG)	13ms	6.9 MiB		140 Bytes	2023-6-30 10:25:13
AC	U城校区-董思羽 (董思羽)	13ms	6.9 MiB		150 Bytes	2023-9-3 18:37:16
AC	周琪渃	13ms	384 KiB		159 Bytes	2022-10-7 20:43:55
AC	Error404sans (焦阳浩云)	13ms	384 KiB		155 Bytes	2023-1-16 13:56:36
AC	苏庭毅	13ms	392 KiB		157 Bytes	2023-2-25 20:25:07
AC	新壹街校区-郭老师-陈品烨 (陈品烨)	13ms	6.7 MiB		160 Bytes	2023-10-1 11:25:28
AC	杜是贤 (dushixian)	13ms	440 KiB		136 Bytes	2022-11-26 11:14:42
AC	李树崑 (lishukun)	13ms	432 KiB		233 Bytes	2022-11-5 12:43:29
AC	李禹衡 (liyuheng22006)	13ms	412 KiB		151 Bytes	2022-6-10 20:30:34
AC	徐正旺 (xzw)	13ms	384 KiB		148 Bytes	2022-11-24 17:47:41
AC	曲奇饼干	13ms	384 KiB		142 Bytes	2023-1-10 17:14:14
AC	明哲瀚 (18580067605)	13ms	512 KiB		180 Bytes	2022-10-1 13:43:48
AC	田开蕊	14ms	6.9 MiB		151 Bytes	2023-11-4 11:36:05
AC	yixingyou	14ms	384 KiB		140 Bytes	2022-11-12 16:15:06
AC	yanglang	14ms	512 KiB		139 Bytes	2022-10-21 23:00:17