后缀表达式

状态	递交者	时间	内存	语言	代码	递交时间
AC	CK (李弘毅)	-	7 MiB		797 Bytes	2023-12-2 16:32:34
AC	小忙果 (王昱杰)	4ms	6.9 MiB		679 Bytes	2023-11-25 17:32:22
AC	huanglinyi	4ms	7.2 MiB		701 Bytes	2023-11-25 18:04:09
AC	zzzrrrxxx	4ms	7.3 MiB		835 Bytes	2023-11-19 18:54:28
AC	scallway	4ms	7 MiB		595 Bytes	2024-1-14 15:35:03
AC	樊竣熠 (lft1114)	4ms	312 KiB		551 Bytes	2022-8-22 16:20:32
AC	李樊駁	4ms	7 MiB		562 Bytes	2024-1-14 15:34:51
AC	牟淳雅	4ms	7.1 MiB		572 Bytes	2023-12-31 10:34:39
AC	Nico	5ms	7.1 MiB	C++11	658 Bytes	2024-6-29 11:17:20
AC	芒苒忧 (廖迦南)	6ms	392 KiB		537 Bytes	2022-9-3 20:58:13
AC	21035-wyf	6ms	392 KiB		777 Bytes	2022-7-4 16:46:00
AC	huanglu	6ms	7 MiB	C++98	658 Bytes	2024-6-14 15:28:10
AC	文硕 (文硕1)	6ms	420 KiB		720 Bytes	2022-7-12 13:57:50
AC	zhangyh (张育菡)	6ms	420 KiB		796 Bytes	2022-9-4 21:15:37
AC	赵沛喆	6ms	412 KiB		724 Bytes	2022-9-4 11:28:45
AC	赵泳鑫 (zhaoyongxin)	6ms	440 KiB		720 Bytes	2022-7-12 11:39:56
AC	金沙—彭智宸 (彭智宸)	6ms	6.7 MiB		632 Bytes	2023-8-27 14:40:28
AC	LUKHE (LukeHu)	7ms	420 KiB		631 Bytes	2022-4-16 16:34:19
AC	luoluonuoya	7ms	432 KiB		715 Bytes	2022-8-17 12:38:53
AC	曾御城（现用名） (Jason)	7ms	436 KiB		694 Bytes	2022-7-23 20:17:58
AC	cheers 戴 (daizhuorun)	7ms	392 KiB		656 Bytes	2022-4-16 18:07:27
AC	wangjunhan	7ms	412 KiB		687 Bytes	2022-4-16 18:08:01
AC	汪致卉 (wangzh)	7ms	496 KiB		1.5 KiB	2022-4-22 19:50:58
AC	希蒙 (zhengxingya)	7ms	7.4 MiB		838 Bytes	2023-10-28 11:18:17
AC	huyinuo	7ms	440 KiB		786 Bytes	2022-7-15 19:41:35
AC	谢雨贝	7ms	6.7 MiB		592 Bytes	2023-8-27 14:35:51
AC	dengduxi	7ms	384 KiB		603 Bytes	2023-3-19 18:15:06
AC	姚宏逸	7ms	448 KiB		618 Bytes	2022-5-29 9:40:29
AC	1396013295	7ms	512 KiB		875 Bytes	2022-2-25 20:01:26
AC	赵沛喆	7ms	440 KiB		782 Bytes	2022-9-4 11:25:01
AC	renqiumo	7ms	444 KiB		752 Bytes	2022-11-13 13:45:27
AC	wangzihang	7ms	444 KiB		663 Bytes	2022-11-12 16:31:46
AC	刘煜轩	7ms	6.7 MiB		588 Bytes	2023-8-27 14:30:17
AC	可爱的小花狗	7ms	7 MiB	C++11	587 Bytes	2024-5-5 9:45:48
AC	吾头飞至珠峰，甚痛！ (Starry)	7ms	512 KiB		797 Bytes	2022-9-17 18:56: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)	7ms	7 MiB		623 Bytes	2023-6-29 11:23:03
AC	刘昊臻 (liuhaozhen)	7ms	7 MiB		666 Bytes	2023-11-25 17:36:41
AC	zzy	7ms	512 KiB		920 Bytes	2023-4-8 16:24:01
AC	代尚函笛卡尔 (daishanghan)	7ms	384 KiB		730 Bytes	2023-3-12 16:09:44
AC	疯神芭芭脱丝 (李卓修)	7ms	440 KiB		676 Bytes	2022-4-10 18:00:24
AC	新壹街朱启航 (zhuqihang)	7ms	7.2 MiB		653 Bytes	2023-11-25 17:32:09
AC	22029-lsl	8ms	7 MiB		615 Bytes	2023-6-29 11:20:47
AC	11451254188 (22029-mjh)	8ms	7 MiB		560 Bytes	2023-6-29 11:22:42
AC	吴攸 (wuyou)	8ms	7 MiB		554 Bytes	2024-1-14 15:35:13
AC	周琪渃	8ms	6.8 MiB		949 Bytes	2023-6-30 22:54:44
AC	RanHao	8ms	6.7 MiB		592 Bytes	2023-9-12 17:07:26
AC	lihaotian	8ms	6.7 MiB		578 Bytes	2023-8-27 14:34:02
AC	何定谦 (hdq)	8ms	6.8 MiB		795 Bytes	2023-6-28 12:17:27
AC	李树崑 (lishukun)	8ms	512 KiB		1 KiB	2022-9-30 19:48:14
AC	ycy	8ms	448 KiB		664 Bytes	2022-11-12 16:04:40
AC	ttt123	8ms	6.8 MiB		623 Bytes	2023-6-30 13:52:53
AC	zcx	8ms	7 MiB		566 Bytes	2023-6-29 11:19:08
AC	zlx (xiao)	8ms	476 KiB		1.2 KiB	2022-11-26 20:28:08
AC	11451254188 (22029-mjh)	8ms	7 MiB		560 Bytes	2023-6-29 11:23:38
AC	zhm123	8ms	440 KiB		803 Bytes	2023-3-10 15:41:50
AC	爱琴海校区-刁钲洋 (刁钲洋)	8ms	6.9 MiB		701 Bytes	2023-8-19 15:26:30
AC	jdy	9ms	440 KiB		611 Bytes	2023-1-14 10:48:26
AC	在煎鱼的肖大总铳 (肖宇航)	9ms	7.1 MiB		573 Bytes	2023-12-24 11:14:43
AC	张梓浩 (zhangzihao)	11ms	6.9 MiB		1.1 KiB	2023-12-16 9:27:16
AC	新壹街罗田雨 (罗田雨29)	11ms	7.2 MiB		658 Bytes	2023-11-25 17:35:41
AC	tsc_ (杨悦堃)	11ms	7.2 MiB		689 Bytes	2023-11-25 17:40:32
AC	新壹街校区-杨轩懿 (杨轩懿1)	12ms	7.1 MiB		605 Bytes	2023-12-3 11:36:00
AC	时代二校-王盼兮 (wangpanxi)	15ms	7.2 MiB		588 Bytes	2023-12-24 11:13:17
AC	三差学生(尘埃蓝莓) (白佳睿)	18ms	7 MiB		584 Bytes	2023-11-25 11:10:44
AC	Jose (反恐皮蛋)	18ms	7.2 MiB		706 Bytes	2023-11-25 17:30:43
AC	孙烽轶 (sfy)	30ms	708 KiB		595 Bytes	2024-3-4 20:07:22
AC	cj66	32ms	532 KiB	C++11(O2)	696 Bytes	2024-10-11 16:04:50
AC	LittleHair	35ms	532 KiB	C++11	794 Bytes	2024-10-12 20:56:36
AC	张祖名	35ms	764 KiB		953 Bytes	2024-2-25 22:20:03
AC	张瑞博	36ms	764 KiB	C++11	793 Bytes	2024-11-10 16:38:42
AC	这是非常▦▦▦的 (段秉辰)	36ms	764 KiB	C++17	637 Bytes	2024-11-23 16:41:28
AC	新壹街校区-冉睦阳 (冉睦阳)	36ms	532 KiB	C++98	584 Bytes	2024-9-24 19:08:17
AC	zyl	37ms	536 KiB	C++11(O2)	768 Bytes	2024-9-19 14:15:56
AC	张月恒	37ms	552 KiB	C++11(O2)	772 Bytes	2024-11-17 17:54:14
AC	梨冻亿 (wiueh)	95ms	3.9 MiB	Python 3	631 Bytes	2022-1-23 20:35:24