统计字符信息

状态	递交者	时间	内存	语言	代码	递交时间
AC	胡宸华 (huchenhua)	7ms	308 KiB		404 Bytes	2022-2-20 12:57:00
AC	姚宏逸	7ms	316 KiB		507 Bytes	2022-6-2 22:26:48
AC	wangruibo20xh	7ms	384 KiB		507 Bytes	2022-2-12 18:56:04
AC	小柒冉欧	7ms	7.2 MiB		454 Bytes	2023-11-25 18:17:06
AC	wanghuaiying	8ms	7.3 MiB		378 Bytes	2024-1-18 19:14:27
AC	周振豪	8ms	7.2 MiB		407 Bytes	2023-11-25 17:51:47
AC	小码王高新校区—刘晨皓 (shishen)	11ms	7.1 MiB		454 Bytes	2023-11-25 17:51:32
AC	原著校区巫映秋 (巫映秋1a)	12ms	7 MiB	C++98	393 Bytes	2024-6-28 22:57:20
AC	李树崑 (lishukun)	12ms	392 KiB		470 Bytes	2022-8-3 18:24:46
AC	张瑞博	12ms	6.7 MiB	C++11	332 Bytes	2024-7-13 14:45:19
AC	不怎么聪明的家伙 (贺俊楠)	13ms	392 KiB		520 Bytes	2023-5-21 14:47:30
AC	1396013295	13ms	384 KiB		568 Bytes	2022-1-23 19:55:45
AC	汪致卉 (wangzh)	13ms	388 KiB		628 Bytes	2022-1-29 0:34:39
AC	杜俊宏	13ms	512 KiB		392 Bytes	2022-6-5 12:29:08
AC	ywh	13ms	512 KiB		398 Bytes	2022-6-18 19:45:42
AC	Accepted (周芷乐)	13ms	6.7 MiB	C++14	443 Bytes	2024-7-20 12:31:49
AC	杨军方 (lyx2000)	13ms	444 KiB		422 Bytes	2022-3-13 11:05:00
AC	李哲 (lizhe)	14ms	444 KiB		428 Bytes	2022-8-15 19:07:16
AC	疯神芭芭脱丝 (李卓修)	14ms	436 KiB		366 Bytes	2022-7-12 11:41:05
AC	源著校区-宋昊成 (马冬梅)	14ms	432 KiB		467 Bytes	2023-2-26 19:47:24
AC	LukeDid	14ms	432 KiB		534 Bytes	2023-4-22 13:32:35
AC	yuqihao	14ms	7.1 MiB		522 Bytes	2024-1-13 12:27:32
AC	Randy Marsh (杨子腾)	14ms	464 KiB		478 Bytes	2022-6-12 18:42:26
AC	芒苒忧 (廖迦南)	14ms	444 KiB		434 Bytes	2022-8-3 15:18:15
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		545 Bytes	2023-10-21 7:56:45
AC	zhm123	14ms	444 KiB		407 Bytes	2023-5-5 16:15:43
AC	qinlang	14ms	6.8 MiB		415 Bytes	2023-10-19 21:00:43
AC	徐子恩 (Cow)	14ms	452 KiB		473 Bytes	2022-3-20 9:28:41
AC	许炜铭 (xuweiming)	14ms	7.4 MiB		458 Bytes	2023-6-10 20:26:18
AC	经常消失 (小萝卜)	14ms	512 KiB		534 Bytes	2022-3-13 18:18:29
AC	赵泳鑫 (zhaoyongxin)	15ms	440 KiB		366 Bytes	2022-4-16 19:50:26
AC	胡澜之 (666hlz666)	15ms	6.7 MiB		586 Bytes	2023-6-7 21:26:41
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	6.5 MiB		416 Bytes	2023-6-3 20:20:07
AC	时代1校-杨宇轩 (杨宇轩)	15ms	7.9 MiB		356 Bytes	2023-8-22 12:07:20
AC	huyinuo	15ms	440 KiB		496 Bytes	2022-12-23 11:52:32
AC	zlx (xiao)	15ms	440 KiB		541 Bytes	2022-11-27 12:12:32
AC	RanHao	16ms	6.9 MiB		563 Bytes	2023-8-18 17:48:43
AC	wyc	16ms	7.2 MiB		431 Bytes	2023-11-25 17:50:30
AC	luoluonuoya	16ms	428 KiB		425 Bytes	2022-9-24 11:19:23
AC	朱老师 (zyp)	16ms	512 KiB		390 Bytes	2022-10-28 16:21:16
AC	王晴萱	16ms	7.1 MiB		462 Bytes	2023-7-16 16:20:37
AC	ganlin1	16ms	6.8 MiB		417 Bytes	2023-11-24 16:33:04
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	512 KiB		402 Bytes	2022-10-13 18:29:39
AC	吴佳智 (AWM)	17ms	6.7 MiB		586 Bytes	2023-6-7 21:26:00
AC	朱老师 (zyp)	18ms	448 KiB		348 Bytes	2023-1-9 15:16:04
AC	kql1	20ms	7.2 MiB		342 Bytes	2023-11-25 17:39:51
AC	xqc125	25ms	7.1 MiB		422 Bytes	2023-11-25 17:50:20
AC	拥抱幸福小熊(吴沛篪)	31ms	7.1 MiB		456 Bytes	2024-1-13 11:34:34
AC	褚博艺	66ms	772 KiB		384 Bytes	2024-3-30 16:39:12
AC	爱琴海校区-刁钲洋 (刁钲洋)	202ms	3.9 MiB	Python 3	234 Bytes	2022-4-12 21:57:58
AC	梨冻亿 (wiueh)	210ms	3.9 MiB	Python 3	452 Bytes	2022-1-23 23:05:32