数字识别

状态	递交者	时间	内存	语言	代码	递交时间
AC	无尽的想象 (谭仕高)	9ms	7.3 MiB		211 Bytes	2024-1-15 13:36:20
AC	黄立信	11ms	7 MiB		263 Bytes	2024-1-10 20:58:13
AC	不怎么聪明的家伙 (贺俊楠)	12ms	7.3 MiB		246 Bytes	2024-1-17 17:20:11
AC	dmh (丁墨涵)	12ms	384 KiB		236 Bytes	2022-5-8 16:08:28
AC	zhuqiwei22006	12ms	384 KiB		212 Bytes	2022-5-1 18:36:44
AC	陈风亦 (chenfengyi)	12ms	384 KiB		170 Bytes	2022-6-18 15:27:51
AC	hyc	12ms	384 KiB		192 Bytes	2023-4-8 11:31:12
AC	zzzrrrxxx	13ms	6.9 MiB	C++98	205 Bytes	2024-8-21 17:45:22
AC	ycy	13ms	436 KiB		270 Bytes	2022-6-24 0:25:07
AC	11111	13ms	444 KiB		214 Bytes	2022-6-15 18:19:05
AC	李晨希	13ms	384 KiB		218 Bytes	2023-4-8 11:23:00
AC	偽艺術家 (chenyanchi22006)	13ms	512 KiB		232 Bytes	2022-6-23 23:14:07
AC	爱琴海校区jzn (jzn)	13ms	384 KiB		183 Bytes	2023-4-8 11:30:12
AC	姚宏逸	13ms	432 KiB		184 Bytes	2022-6-2 22:31:22
AC	陈风亦 (chenfengyi)	13ms	420 KiB		170 Bytes	2022-6-18 15:27:43
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	13ms	384 KiB		255 Bytes	2022-9-24 23:12:29
AC	ywh	13ms	384 KiB		185 Bytes	2022-4-16 11:17:11
AC	hyh22031	13ms	384 KiB		268 Bytes	2022-12-4 9:45:40
AC	bvvd	13ms	7 MiB	C++98	281 Bytes	2024-6-12 16:09:25
AC	在煎鱼的肖大总铳 (肖宇航)	13ms	6.8 MiB		211 Bytes	2023-10-12 22:12:38
AC	向俊熙 (xiangjunxi23003)	13ms	512 KiB		265 Bytes	2023-4-12 18:03:54
AC	缥 (王硕2012)	13ms	384 KiB		297 Bytes	2022-12-4 9:38:21
AC	Tender. (05c05-zhou)	13ms	436 KiB		762 Bytes	2023-3-5 18:38:46
AC	huanglu	13ms	6.8 MiB		252 Bytes	2023-10-20 15:06:37
AC	yanxiaosong	13ms	384 KiB		192 Bytes	2022-6-18 15:30:40
AC	RanHao	13ms	7.2 MiB	C++98	237 Bytes	2024-4-29 0:19:49
AC	彭粤庭 (JJlinCN)	13ms	7.2 MiB	C++11	217 Bytes	2024-4-27 15:04:09
AC	陈于硕(我™的) (chenyu)	14ms	384 KiB		192 Bytes	2023-4-8 11:30:17
AC	爱情海校区—沙天一 (沙天一)	14ms	404 KiB		212 Bytes	2023-4-8 11:32:14
AC	LUKHE (LukeHu)	14ms	440 KiB		202 Bytes	2022-4-16 17:16: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)	14ms	440 KiB		232 Bytes	2023-5-20 11:53:43
AC	疯神芭芭脱丝 (李卓修)	14ms	440 KiB		213 Bytes	2022-7-16 16:27:14
AC	lch (凌昌瀚)	14ms	452 KiB		230 Bytes	2022-7-5 18:43:03
AC	wangzihang	14ms	428 KiB	C++	184 Bytes	2022-8-6 10:01:11
AC	李晨希	14ms	384 KiB		218 Bytes	2023-4-8 11:26:20
AC	叶哲宇 (yzy)	14ms	420 KiB		239 Bytes	2023-5-28 12:48:06
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	384 KiB		725 Bytes	2022-9-8 20:16:43
AC	时代二校-焦雨齐 (Angel)	14ms	384 KiB		204 Bytes	2023-5-27 18:33:21
AC	杜俊宏	14ms	512 KiB		744 Bytes	2022-7-4 20:37:18
AC	朱老师 (zyp)	14ms	384 KiB		296 Bytes	2022-12-4 9:36:04
AC	我很6 (zjj22031)	14ms	392 KiB		266 Bytes	2022-12-4 9:35:53
AC	colin1112 (墙凌可)	14ms	6.7 MiB		322 Bytes	2023-9-1 17:00:44
AC	jdy	14ms	392 KiB		192 Bytes	2023-4-8 11:22:36
AC	22016-ggs	14ms	384 KiB		273 Bytes	2022-8-17 16:47:03
AC	pandap&a王皓宸 (WANGHAOCHEN)	14ms	384 KiB		194 Bytes	2023-2-24 18:11:22
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	392 KiB		271 Bytes	2022-12-4 9:40:40
AC	李晨希	14ms	384 KiB		218 Bytes	2023-4-8 11:26:44
AC	李书翰 (lishuhan)	14ms	512 KiB		217 Bytes	2022-4-9 20:00:09
AC	罗元邑2	14ms	384 KiB		359 Bytes	2023-4-8 11:33:27
AC	朱老师 (zyp)	14ms	436 KiB		269 Bytes	2022-8-17 16:37:43
AC	詹宇航 (zyh7)	14ms	428 KiB		200 Bytes	2022-7-8 18:10:13
AC	魑归sama	14ms	512 KiB		200 Bytes	2022-7-12 16:55:57
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	384 KiB		240 Bytes	2023-5-27 21:36:55
AC	许嘉恩 (xje22031)	14ms	392 KiB		256 Bytes	2022-12-4 9:38:08
AC	邵冠铖 (shaoguancheng22031)	14ms	392 KiB		197 Bytes	2022-12-4 9:39:01
AC	曹埊睿 (caodirui)	14ms	444 KiB		251 Bytes	2023-4-19 22:21:38
AC	linjingming	14ms	432 KiB		205 Bytes	2022-8-10 18:30:34
AC	爱琴海校区-胡靖欢 (胡靖欢1)	14ms	384 KiB		361 Bytes	2023-4-8 11:31:48
AC	hyh22031	14ms	512 KiB		268 Bytes	2022-12-4 9:46:59
AC	呵呵呵 (陈思琦)	14ms	512 KiB		440 Bytes	2022-10-5 14:54:55
AC	没有此人 (akm)	15ms	7.2 MiB		266 Bytes	2023-7-4 16:38:01
AC	新壹街校区--税崇峻 (税崇峻)	15ms	8.2 MiB		211 Bytes	2023-8-22 19:39:32
AC	陈杰晟	15ms	428 KiB		199 Bytes	2022-4-16 11:15:58
AC	李晨希	15ms	384 KiB		218 Bytes	2023-4-8 11:26:40
AC	中岛敦 (黄麒瑞)	15ms	6.8 MiB		299 Bytes	2023-10-3 15:43:37
AC	wzzjnb2012	15ms	440 KiB		284 Bytes	2022-10-3 21:55:40
AC	liangyuntian	15ms	6.7 MiB		243 Bytes	2023-8-30 10:07:05
AC	CK (李弘毅)	15ms	512 KiB		612 Bytes	2022-10-2 13:33:13
AC	时代2校-程俊燃 (chengjunran)	15ms	392 KiB		216 Bytes	2023-5-27 18:33:46
AC	zhm123	15ms	512 KiB		217 Bytes	2023-2-6 18:20:26
AC	李晨希	15ms	392 KiB		218 Bytes	2023-4-8 11:26:42
AC	huyinuo	15ms	512 KiB		239 Bytes	2022-8-22 11:15:55
AC	蒲梓勋 (puzixun)	15ms	512 KiB		267 Bytes	2022-8-12 17:22:13
AC	时代校区-刘臣原 (微笑王子)	15ms	436 KiB		212 Bytes	2022-12-28 21:00:18
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	15ms	384 KiB		260 Bytes	2023-1-15 15:17:37
AC	zzl	16ms	440 KiB		227 Bytes	2023-1-6 11:44:09
AC	wangjun	16ms	6.7 MiB		204 Bytes	2023-11-22 13:45:48
AC	李晨希	16ms	420 KiB		218 Bytes	2023-4-8 11:26:40
AC	shenyushun2	16ms	440 KiB		238 Bytes	2022-12-17 14:14:43
AC	11451254188 (22029-mjh)	16ms	6.8 MiB		232 Bytes	2023-6-27 20:58:48
AC	Randy Marsh (杨子腾)	16ms	440 KiB		314 Bytes	2023-1-3 15:37:00
AC	周琪渃	16ms	6.7 MiB		607 Bytes	2023-9-8 23:35:07
AC	(张洛诚)	16ms	6.8 MiB		279 Bytes	2023-6-27 10:09:37
AC	许律天	38ms	7.2 MiB		204 Bytes	2023-11-30 19:51:22
AC	益布响完辣 (黄靖益1)	69ms	764 KiB		282 Bytes	2024-3-14 20:09:26
AC	杨博文05	72ms	548 KiB	C++98	219 Bytes	2024-9-1 13:04:34
AC	爱琴海校区-刁钲洋 (刁钲洋)	201ms	4 MiB	Python 3	64 Bytes	2022-5-6 21:04:10
AC	1396013295	208ms	3.9 MiB	Python 3	81 Bytes	2022-3-23 20:02:23
AC	谭红中 (不知道)	210ms	4.1 MiB	Python 3	77 Bytes	2022-4-3 11:05:48