希蒙统统计字母频率-1

状态	递交者	时间	内存	语言	代码	递交时间
AC	源著校区-老师：刘扬-张博涵 (张博涵)	33ms	6.9 MiB		1.4 KiB	2023-8-10 14:48:37
AC	朱老师 (zyp)	33ms	436 KiB		345 Bytes	2022-10-18 19:59:29
AC	yxj	34ms	528 KiB		341 Bytes	2023-1-19 18:47:33
AC	马渝杭 (mayuhang)	34ms	392 KiB		337 Bytes	2023-4-14 19:50:22
AC	三差学生(尘埃蓝莓) (白佳睿)	34ms	7.1 MiB		334 Bytes	2024-1-2 13:40:49
AC	zhangyouze (张佑泽)	34ms	7.3 MiB		364 Bytes	2024-1-6 18:35:04
AC	wangjun	35ms	7 MiB		503 Bytes	2023-12-22 10:06:55
AC	马渝杭 (mayuhang)	35ms	420 KiB		337 Bytes	2023-4-14 20:03:35
AC	马渝杭 (mayuhang)	35ms	384 KiB		337 Bytes	2023-4-14 19:50:21
AC	RanHao	35ms	6.9 MiB		368 Bytes	2023-8-2 10:54:59
AC	Nico	36ms	6.9 MiB		407 Bytes	2023-8-10 14:30:29
AC	新壹街陈科言 (cky)	36ms	6.9 MiB		413 Bytes	2023-7-19 16:15:05
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)	36ms	6.9 MiB		401 Bytes	2023-8-9 17:05:52
AC	李禹衡 (liyuheng22006)	37ms	392 KiB		302 Bytes	2022-10-18 20:05:42
AC	U城校区-郭旻哲 (郭旻哲)	37ms	7.3 MiB		356 Bytes	2024-1-20 15:20:55
AC	临时账户（dangdang）	38ms	512 KiB		400 Bytes	2023-1-25 11:58:59
AC	U城校区-唐晗 (tanghan)	38ms	7.3 MiB		398 Bytes	2024-1-20 15:22:25
AC	许徐非凡 (非同凡响)	38ms	7.2 MiB		365 Bytes	2023-12-30 10:25:58
AC	陈杰晟	38ms	408 KiB		418 Bytes	2023-3-11 19:07:18
AC	马渝杭 (mayuhang)	41ms	392 KiB		337 Bytes	2023-4-14 20:03:41
AC	我推的乱破 (贺俊楠)	41ms	7 MiB		381 Bytes	2024-1-14 10:07:11
AC	jighghjkfkhfdhdfdfdsfsdfsafvmnkbnkbmnlvnmkbvnvb;,.m;,;.;,;kbvlmkbnlmkblnvkmlbnkmlbvkmlbvklmbkmlkblmbnm;,l.,.;,'.,';.[',;.[,kjkoihgfhfgiohifgohifgohiofgihgofhiofgihofgihofgihofgiho;''[;.',m;.',m.;',.;'m,.;';'cv;x'cb'cx;b'cv;b'xc;b'c;b'cvbvc.'bv.//,/vb./vcb./cvbv,c.b,cv.,b.cv,b.vc,bg;hgl;hgl;hg;h;hfg;hl;lf;l;lxc;cln;bvln;vcln;vnl;vbl;vbln;vlv;blnvb;plnp;lplhfljpjh;nlvb;nv;bn;vcvl;nlv;nlv;g;hjhchl;ghfghl;fghl;ltlh;l;hlf;lg;bnlc;;nlv;nbv;nbv;nvb;nlvcnl;xc;blxcb;ll;hg;lhgl;dfl;t;ldy;l;lyl;rewlt493;l;dl;dsflg;lsdlpbpcxobpocvbpopopopreopotpreotertertretert (litingxu)	42ms	7 MiB		408 Bytes	2024-1-14 17:53:02
AC	zhs23017	43ms	6.9 MiB		328 Bytes	2023-12-12 13:33:35
AC	时代二校-王盼兮 (wangpanxi)	43ms	7.4 MiB		317 Bytes	2023-12-31 11:28:24
AC	金沙—彭智宸 (彭智宸)	43ms	7 MiB		316 Bytes	2023-11-11 11:48:40
AC	爱情海校区—沙天一 (沙天一)	43ms	7 MiB		371 Bytes	2023-12-30 9:29:56
AC	刘煜轩	43ms	7.3 MiB		446 Bytes	2023-11-11 11:42:06
AC	张雯皓 (zhangwenhao)	47ms	7.2 MiB		377 Bytes	2023-12-23 11:32:08
AC	岳鑫正	51ms	7.2 MiB		331 Bytes	2023-12-30 10:27:19
AC	杨颂恩 (yangsongen)	54ms	6.9 MiB		363 Bytes	2023-8-19 19:21:48
AC	zyl	59ms	7.2 MiB		326 Bytes	2024-1-13 11:06:02
AC	朱老师 (zyp)	126ms	764 KiB		564 Bytes	2024-2-2 14:52:38
AC	zhy123	128ms	764 KiB		306 Bytes	2024-2-2 14:52:58
AC	juyuxuan	133ms	768 KiB		321 Bytes	2024-2-2 14:55:30
AC	( ) (李恺伦)	133ms	556 KiB	C++11	294 Bytes	2024-9-25 21:17:03
AC	jdy	133ms	536 KiB		349 Bytes	2024-3-10 14:24:41
AC	张梓浩 (zhangzihao)	134ms	548 KiB		339 Bytes	2024-3-24 11:04:05
AC	孙烽轶 (sfy)	134ms	532 KiB		316 Bytes	2024-3-4 20:25:33
AC	My name is Man (钟卓劭)	134ms	764 KiB		1.5 KiB	2024-3-20 15:47:20
AC	test921	135ms	536 KiB	C++11	288 Bytes	2024-9-22 20:51:06
AC	My name is Man (钟卓劭)	136ms	764 KiB		1.5 KiB	2024-4-4 13:36:39
AC	姜皓允	137ms	764 KiB		265 Bytes	2024-3-26 21:22:45
AC	yuchenyi23017	137ms	768 KiB		316 Bytes	2024-1-28 15:35:39
AC	A小涂	137ms	764 KiB		373 Bytes	2024-3-9 9:09:17
AC	蔡蕊池	141ms	540 KiB		438 Bytes	2024-3-16 21:40:29
AC	爱琴海校区-刁钲洋 (刁钲洋)	141ms	544 KiB		368 Bytes	2024-3-10 11:50:50
AC	小忙果 (王昱杰)	143ms	532 KiB	C++98	1.5 KiB	2024-9-5 10:46:28
AC	伍行念 (wuxingnian)	322ms	9.2 MiB	Python 3	193 Bytes	2023-11-10 14:00:17
AC	安闵煜 (anzai)	369ms	9.2 MiB	Python 3	307 Bytes	2023-11-10 14:12:26
AC	Jose (反恐皮蛋)	376ms	9.2 MiB	Python 3	259 Bytes	2023-11-10 12:47:34
AC	cola	384ms	9.2 MiB	Python 3	389 Bytes	2023-11-10 14:14:53
AC	猫不理包子	389ms	9.2 MiB	Python 3	253 Bytes	2023-11-14 14:18:21
AC	kongql	406ms	8.9 MiB	Python 3	261 Bytes	2023-7-23 19:31:33
AC	梨冻亿 (wiueh)	407ms	3.9 MiB	Python 3	2.2 KiB	2022-1-23 18:52:41
AC	谭红中 (不知道)	421ms	3.9 MiB	Python 3	414 Bytes	2022-4-4 14:39:31
AC	高俊	1042ms	3.8 MiB	Python 3	348 Bytes	2024-2-22 16:36:29
AC	LittleHair	1078ms	3.8 MiB	Python 3	101 Bytes	2024-2-22 15:29:56
AC	17383018494	1093ms	4 MiB	Python 3	270 Bytes	2024-3-23 15:08:35
AC	Qinxiu	1149ms	4 MiB	Python 3	1.5 KiB	2024-2-22 15:45:43