ASCII码值最小的最多字符

状态	递交者	时间	内存	语言	代码	递交时间
AC	wangjun	3ms	6.7 MiB		359 Bytes	2023-11-15 14:50:08
AC	kin of kin (jojo)	12ms	392 KiB		354 Bytes	2022-6-12 18:45:21
AC	赵泳鑫 (zhaoyongxin)	12ms	384 KiB		310 Bytes	2022-7-12 16:50:11
AC	新壹街-张博涵 (张博涵)	12ms	7 MiB	C++11	405 Bytes	2024-6-28 21:59:48
AC	时代校区-刘臣原 (微笑王子)	12ms	392 KiB		537 Bytes	2022-9-11 18:41:47
AC	朱老师 (zyp)	12ms	392 KiB		312 Bytes	2023-5-17 19:43:08
AC	刘老师 (图书管理员)	13ms	384 KiB		346 Bytes	2022-5-25 12:09:00
AC	xflt_dyp	13ms	400 KiB		386 Bytes	2023-2-1 17:03:23
AC	冒牌陈杰晟【MOD】 (wed)	13ms	436 KiB		479 Bytes	2022-6-11 12:32:03
AC	teacher_ren	13ms	384 KiB		590 Bytes	2022-6-5 17:30:14
AC	南坪协信校区-叶钟阳 (yezhongyang23010)	13ms	392 KiB		322 Bytes	2023-5-17 19:47:03
AC	hxb	13ms	384 KiB		312 Bytes	2023-4-28 16:39:33
AC	无尽的想象 (谭仕高)	13ms	392 KiB		329 Bytes	2022-8-30 21:25:20
AC	Z.饮月君 (张皓南)	13ms	384 KiB		325 Bytes	2022-9-11 16:55:04
AC	wuqilin	13ms	384 KiB		393 Bytes	2023-2-1 17:06:09
AC	陈杰晟	13ms	420 KiB		363 Bytes	2022-5-29 10:30:16
AC	林子沫awa (linziyue)	13ms	392 KiB		347 Bytes	2022-9-11 16:55:45
AC	22029-zjs	13ms	408 KiB		380 Bytes	2023-5-19 21:03:59
AC	zlx (xiao)	13ms	384 KiB		374 Bytes	2022-5-29 18:56:39
AC	luosifu22006	13ms	384 KiB		275 Bytes	2022-8-19 18:16:44
AC	leisixian (22029-lyh)	13ms	392 KiB		346 Bytes	2023-5-17 19:44:51
AC	时代校区-刘臣原 (微笑王子)	13ms	384 KiB		348 Bytes	2023-2-4 19:04:59
AC	姚宏逸	13ms	384 KiB		625 Bytes	2022-5-25 18:54:29
AC	scallway	13ms	384 KiB		363 Bytes	2023-4-14 17:20:34
AC	xiangsiyu	13ms	384 KiB		270 Bytes	2022-8-11 10:57:23
AC	scallway	13ms	384 KiB		370 Bytes	2023-4-28 16:37:12
AC	wuqilin	13ms	392 KiB		393 Bytes	2023-2-1 17:05:36
AC	wuqilin	13ms	384 KiB		393 Bytes	2023-2-1 17:05:54
AC	. (Pig)	13ms	384 KiB		382 Bytes	2022-6-5 13:42:40
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	13ms	384 KiB		379 Bytes	2023-2-1 17:11:32
AC	zcx	13ms	428 KiB		378 Bytes	2023-4-8 11:56:36
AC	huyinuo	13ms	392 KiB		409 Bytes	2022-6-5 20:37:41
AC	86想要钱 (twt)	13ms	396 KiB		415 Bytes	2023-2-4 19:26:29
AC	微风将至 (李睿轩)	13ms	408 KiB		426 Bytes	2022-5-29 20:03:44
AC	朱老师 (zyp)	13ms	520 KiB		363 Bytes	2022-7-31 16:23:47
AC	时代一校林星宇 (lxy)	13ms	392 KiB		315 Bytes	2023-2-4 19:02:15
AC	luosifu22006	13ms	512 KiB		275 Bytes	2022-8-19 18:12:24
AC	scallway	13ms	384 KiB		369 Bytes	2023-4-28 16:39:21
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		495 Bytes	2023-4-14 17:47:48
AC	吴俊成 (wujuncheng)	14ms	448 KiB		291 Bytes	2022-6-7 17:32:06
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	384 KiB		333 Bytes	2022-8-10 16:50:55
AC	luosifu22006	14ms	384 KiB		275 Bytes	2022-8-16 18:31:44
AC	lch (凌昌瀚)	14ms	440 KiB		395 Bytes	2023-2-1 17:13:03
AC	时代校区-刘臣原 (微笑王子)	14ms	396 KiB		320 Bytes	2023-2-4 19:21:38
AC	LukeDid	14ms	444 KiB		318 Bytes	2023-4-21 22:44:58
AC	什蒂尔布 (吴东航)	14ms	440 KiB		323 Bytes	2023-5-7 7:59:03
AC	黄誉翔 (黄誉翔)	14ms	384 KiB		351 Bytes	2023-2-4 19:26:38
AC	文硕 (文硕1)	14ms	512 KiB		395 Bytes	2023-2-2 17:18:40
AC	wuqilin	14ms	392 KiB		393 Bytes	2023-2-1 17:06:26
AC	林小博	14ms	444 KiB		459 Bytes	2023-2-11 9:24:41
AC	陈雨泽1	14ms	392 KiB		409 Bytes	2023-2-1 17:10:07
AC	hxb	14ms	392 KiB		312 Bytes	2023-4-28 16:39:59
AC	11451254188 (22029-mjh)	14ms	428 KiB		395 Bytes	2023-2-8 21:26:47
AC	时代一校-赵彦博 (zyb)	14ms	436 KiB		320 Bytes	2023-2-7 14:39:08
AC	赵沛喆	14ms	392 KiB		320 Bytes	2022-10-23 11:30:10
AC	林靖明	14ms	512 KiB		372 Bytes	2023-2-1 19:10:39
AC	余彦瑞	14ms	436 KiB		305 Bytes	2023-1-31 12:00:34
AC	金沙—彭智宸 (彭智宸)	14ms	8 MiB		296 Bytes	2023-8-26 16:28:23
AC	ycy	14ms	384 KiB		345 Bytes	2022-12-8 20:05:49
AC	朱老师 (zyp)	14ms	440 KiB		324 Bytes	2022-8-10 16:44:11
AC	hxb	14ms	384 KiB		313 Bytes	2023-4-28 16:28:27
AC	黄梓桐 (HuangZiTong)	14ms	420 KiB		286 Bytes	2023-3-5 15:37:38
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	432 KiB		270 Bytes	2022-8-13 17:25:16
AC	时代一校-曾科智 (曾科智)	14ms	444 KiB		345 Bytes	2023-2-4 18:52:25
AC	朱老师 (zyp)	14ms	428 KiB		306 Bytes	2022-8-16 18:27:11
AC	scallway	14ms	384 KiB		369 Bytes	2023-4-28 16:39:49
AC	疯神芭芭脱丝 (李卓修)	15ms	512 KiB		289 Bytes	2022-7-12 17:29:27
AC	王晨志 (wangchenzhi)	15ms	512 KiB		695 Bytes	2022-8-6 15:57:05
AC	蒲梓勋 (puzixun)	15ms	392 KiB		343 Bytes	2022-12-8 20:06:04
AC	zhm123	15ms	384 KiB		311 Bytes	2022-12-22 17:22:43
AC	原著校区巫映秋 (巫映秋1a)	15ms	512 KiB		256 Bytes	2023-5-28 17:45:07
AC	经常消失 (小萝卜)	15ms	436 KiB		299 Bytes	2022-7-15 16:32:30
AC	缥 (王硕2012)	15ms	512 KiB		379 Bytes	2023-3-11 19:12:18
AC	章愉霖	15ms	7 MiB		279 Bytes	2023-6-18 17:29:37
AC	缥 (王硕2012)	16ms	512 KiB		379 Bytes	2023-3-11 18:29:38
AC	章愉霖	16ms	7 MiB		279 Bytes	2023-6-18 17:29:57
AC	时代一校-王宥量 (wangyouliang)	16ms	512 KiB		503 Bytes	2022-12-8 20:21:25
AC	ttt123	30ms	492 KiB		384 Bytes	2023-4-14 22:45:17
AC	zyl	68ms	764 KiB		427 Bytes	2024-1-25 10:23:59
AC	Error404sans (焦阳浩云)	68ms	764 KiB		537 Bytes	2024-3-17 19:08:53
AC	My name is Man (钟卓劭)	69ms	540 KiB		1.9 KiB	2024-3-24 11:06:04
AC	Corinna	193ms	8.9 MiB	Python 2	205 Bytes	2023-6-10 14:45:17
AC	cola	201ms	4.1 MiB	Python 3	193 Bytes	2022-12-23 17:19:54
AC	wzzjnb2012	201ms	3.9 MiB	Python 3	334 Bytes	2023-2-14 21:54:03
AC	Marvin	210ms	4 MiB	Python 3	448 Bytes	2023-5-31 14:34:39