奇数单增序列

状态	递交者	时间	内存	语言	代码	递交时间
AC	缥 (王硕2012)	17ms	512 KiB		349 Bytes	2023-3-11 19:13:29
AC	蒲梓勋 (puzixun)	17ms	436 KiB		348 Bytes	2022-12-8 19:10:09
AC	乐瀚阳 (yuehanyang)	17ms	440 KiB		330 Bytes	2023-5-27 17:36:19
AC	李哲 (lizhe)	17ms	436 KiB		582 Bytes	2022-10-16 10:24:13
AC	https://www.minecraft.net/zh-hans (王振西)	17ms	6.8 MiB		556 Bytes	2023-6-18 22:50:02
AC	22029-hqh	17ms	384 KiB		319 Bytes	2023-4-15 12:13:41
AC	陈骏逸 (chenjunyi)	17ms	384 KiB		486 Bytes	2022-12-8 19:30:01
AC	李林峰 (金克拉)	17ms	436 KiB		318 Bytes	2022-9-14 20:08:38
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)	17ms	7 MiB		381 Bytes	2023-6-17 11:40:55
AC	kql1	18ms	7.1 MiB	C++98	484 Bytes	2024-5-9 13:43:10
AC	游智棋	18ms	392 KiB		509 Bytes	2022-12-8 19:30:08
AC	ttt123	18ms	384 KiB		426 Bytes	2023-4-14 23:04:22
AC	zhm123	18ms	384 KiB		505 Bytes	2023-5-10 19:06:21
AC	时代一校-曾科智 (曾科智)	18ms	444 KiB		341 Bytes	2023-3-11 19:01:32
AC	坤坤荔枝小黑子 (zhonghaotian22006)	18ms	384 KiB		471 Bytes	2022-10-1 13:24:44
AC	ycy	19ms	384 KiB		581 Bytes	2022-12-8 19:21:28
AC	坤坤荔枝小黑子 (zhonghaotian22006)	19ms	436 KiB		471 Bytes	2022-12-31 19:05:25
AC	樊竣熠 (lft1114)	19ms	432 KiB		336 Bytes	2022-8-23 12:52:36
AC	wangjun	20ms	6.7 MiB		325 Bytes	2023-11-15 16:01:32
AC	22029-hqh	20ms	384 KiB		319 Bytes	2023-4-15 12:13:41
AC	11451254188 (22029-mjh)	22ms	392 KiB		261 Bytes	2023-4-15 12:11:54
AC	欧俊阳	27ms	7.3 MiB		424 Bytes	2024-1-6 15:40:38
AC	张梓浩 (zhangzihao)	28ms	7 MiB		410 Bytes	2024-1-8 19:20:18
AC	zyl	34ms	7.3 MiB		466 Bytes	2024-1-5 14:39:18
AC	江子墨	73ms	768 KiB		357 Bytes	2024-3-5 17:25:36
AC	zhy123	75ms	764 KiB		270 Bytes	2024-2-1 16:13:36
AC	yuchenyi23017	76ms	764 KiB		263 Bytes	2024-1-28 16:05:08
AC	不怎么聪明的家伙 (贺俊楠)	76ms	532 KiB		377 Bytes	2024-2-5 18:58:47
AC	廖梓棋23025	76ms	536 KiB		286 Bytes	2024-2-1 16:12:33
AC	朱老师 (zyp)	77ms	548 KiB		321 Bytes	2024-2-1 16:11:05
AC	Marvin	189ms	9.1 MiB	Python 3	191 Bytes	2023-6-23 11:33:43
AC	Corinna	193ms	9.2 MiB	Python 2	180 Bytes	2023-6-10 17:43:45
AC	cola	205ms	3.9 MiB	Python 3	152 Bytes	2022-12-23 18:26:34