年龄与疾病

状态	递交者	时间	内存	语言	代码	递交时间
AC	姚宏逸	13ms	256 KiB	C	377 Bytes	2022-3-21 10:13:44
AC	汪致卉 (wangzh)	16ms	316 KiB		355 Bytes	2022-6-24 20:23:40
AC	heyue	25ms	388 KiB		429 Bytes	2022-5-29 10:02:08
AC	高子轩 (gaozixuan)	25ms	384 KiB		349 Bytes	2022-5-29 9:49:27
AC	杜俊宏	26ms	392 KiB		569 Bytes	2022-6-19 17:49:10
AC	郑淇予 (macabaca)	26ms	396 KiB		417 Bytes	2022-5-29 9:49:20
AC	303	26ms	384 KiB		510 Bytes	2022-5-29 10:05:04
AC	heyue	26ms	392 KiB		429 Bytes	2022-5-29 10:02:18
AC	刘沐僖太逊了 (lmxasgy1314)	26ms	384 KiB		624 Bytes	2022-5-29 10:34:05
AC	heyue	27ms	392 KiB		429 Bytes	2022-5-29 10:02:00
AC	wangjun	27ms	6.9 MiB		470 Bytes	2023-12-2 16:30:32
AC	秦维希 (qinweixi)	27ms	444 KiB		459 Bytes	2022-5-29 9:30:35
AC	1396013295	27ms	384 KiB		545 Bytes	2022-3-22 20:38:48
AC	徐子恩 (Cow)	27ms	384 KiB		489 Bytes	2022-3-27 9:23:14
AC	阮 (媚狐不吃道旁李)	28ms	7.2 MiB	C++98	607 Bytes	2024-5-18 16:07:43
AC	神秘黑客	28ms	384 KiB		452 Bytes	2022-4-9 17:00:42
AC	LUKHE (LukeHu)	28ms	384 KiB		465 Bytes	2022-4-16 17:14:24
AC	贾鑫豪 (Mr Sam)	29ms	428 KiB		411 Bytes	2022-4-16 15:14:12
AC	蒲梓勋 (puzixun)	29ms	384 KiB		462 Bytes	2022-11-27 10:29:02
AC	李卓燃 (李卓燃1)	29ms	488 KiB		530 Bytes	2023-4-14 17:53:15
AC	坤坤荔枝小黑子 (zhonghaotian22006)	29ms	444 KiB		616 Bytes	2022-11-15 11:07:12
AC	张梓辰 (DiaoDesi屌德斯)	30ms	448 KiB		488 Bytes	2022-9-15 19:51:12
AC	huyinuo	30ms	436 KiB		688 Bytes	2022-8-28 9:50:44
AC	李树崑 (lishukun)	30ms	512 KiB		861 Bytes	2022-9-3 17:36:30
AC	黄梓轩 (huangzixuan)	30ms	512 KiB		610 Bytes	2023-2-11 13:59:51
AC	疯神芭芭脱丝 (李卓修)	30ms	436 KiB		457 Bytes	2022-7-14 16:36:46
AC	huanglu	30ms	512 KiB		587 Bytes	2022-11-12 17:31:28
AC	时代一校-赵彦博 (zyb)	30ms	6.9 MiB		449 Bytes	2023-7-26 15:37:41
AC	zhm123	31ms	512 KiB		417 Bytes	2023-4-26 15:10:08
AC	关博源	31ms	392 KiB		624 Bytes	2023-3-25 10:27:53
AC	黄梓桐 (HuangZiTong)	32ms	384 KiB		311 Bytes	2023-1-15 17:27:49
AC	呵呵呵 (陈思琦)	33ms	512 KiB		489 Bytes	2022-12-31 16:35:49
AC	yiqiuyu23002	33ms	6.9 MiB		461 Bytes	2023-7-29 10:59:15
AC	樊竣熠 (lft1114)	33ms	452 KiB		948 Bytes	2022-8-23 22:16:34
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)	33ms	6.9 MiB		553 Bytes	2023-8-10 18:32:42
AC	陈杰晟	35ms	6.9 MiB		394 Bytes	2023-8-2 10:20:46
AC	胡澜之 (666hlz666)	50ms	7.2 MiB		657 Bytes	2023-12-11 18:48:40