|
|
朱老师 (zyp)
|
8ms |
384 KiB |
|
205 Bytes |
2022-12-18 10:44:42 |
|
|
缥 (王硕2012)
|
8ms |
384 KiB |
|
237 Bytes |
2022-12-18 10:46:37 |
|
|
田开蕊
|
8ms |
7.1 MiB |
|
220 Bytes |
2024-1-13 11:30:16 |
|
|
11451254188 (22029-mjh)
|
8ms |
384 KiB |
|
278 Bytes |
2022-12-11 18:11:38 |
|
|
郑岐蔚
|
8ms |
444 KiB |
|
215 Bytes |
2023-5-12 19:35:30 |
|
|
手搓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)
|
8ms |
436 KiB |
|
270 Bytes |
2022-12-13 18:33:40 |
|
|
zhangzhimo
|
8ms |
384 KiB |
|
272 Bytes |
2022-12-3 15:47:12 |
|
|
贺睿林
|
8ms |
6.7 MiB |
|
215 Bytes |
2023-6-4 11:44:53 |
|
|
AC[谭赫奕] (tanheyi)
|
8ms |
512 KiB |
|
238 Bytes |
2023-4-17 10:39:52 |
|
|
唐良瑞 (22016-tlr01)
|
8ms |
6.8 MiB |
|
224 Bytes |
2023-8-22 14:57:05 |
|
|
wjx
|
8ms |
384 KiB |
|
195 Bytes |
2022-9-11 9:25:40 |
|
|
杨坤霖 (steven)
|
8ms |
444 KiB |
|
406 Bytes |
2023-1-15 15:34:57 |
|
|
没有此人 (akm)
|
8ms |
7.2 MiB |
|
233 Bytes |
2023-12-30 14:22:24 |
|
|
廖海宇在追杀马牌痞 (liaohaiyu22031)
|
8ms |
392 KiB |
|
245 Bytes |
2022-12-14 16:17:21 |
|
|
梅子楠 (22016-mzn)
|
8ms |
512 KiB |
|
234 Bytes |
2022-9-11 9:09:10 |
|
|
^_^ (ctc)
|
8ms |
436 KiB |
|
254 Bytes |
2022-12-19 16:23:19 |
|
|
黄立信
|
8ms |
7 MiB |
|
502 Bytes |
2024-1-10 22:19:15 |
|
|
我是个s* (lijinze)
|
8ms |
6.8 MiB |
|
225 Bytes |
2023-6-28 13:56:45 |
|
|
zry
|
8ms |
444 KiB |
|
343 Bytes |
2022-11-6 9:56:35 |
|
|
邵冠铖 (shaoguancheng22031)
|
8ms |
384 KiB |
|
167 Bytes |
2022-12-18 10:52:31 |
|
|
chenxiyu
|
8ms |
416 KiB |
|
246 Bytes |
2023-4-15 16:16:45 |
|
|
右边的右边的人是SB (22016-hjy)
|
8ms |
384 KiB |
|
219 Bytes |
2022-9-11 9:30:52 |
|
|
ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)
|
8ms |
7.1 MiB |
|
237 Bytes |
2024-1-20 15:52:10 |
|
|
Error404sans (焦阳浩云)
|
8ms |
7 MiB |
|
227 Bytes |
2023-6-18 15:15:05 |
|
|
22029-zjs
|
8ms |
384 KiB |
|
274 Bytes |
2022-12-11 18:47:22 |
|
|
王彬羽 (wby)
|
8ms |
432 KiB |
|
275 Bytes |
2023-5-10 16:35:02 |
|
|
zhangzhixiong
|
8ms |
6.9 MiB |
|
227 Bytes |
2023-6-18 14:43:25 |
|
|
Z.饮月君 (张皓南)
|
8ms |
440 KiB |
|
204 Bytes |
2022-10-30 17:13:58 |
|
|
江科毅 (jky)
|
8ms |
436 KiB |
|
216 Bytes |
2023-3-30 19:44:09 |
|
|
luosifu22006
|
8ms |
384 KiB |
|
231 Bytes |
2022-11-3 20:07:04 |
|
|
高国瑞
|
8ms |
6.9 MiB |
|
408 Bytes |
2023-7-30 10:18:05 |
|
|
86想要钱 (twt)
|
8ms |
512 KiB |
|
252 Bytes |
2022-12-4 16:57:06 |
|
|
22016-oyc
|
8ms |
396 KiB |
|
185 Bytes |
2022-9-11 9:29:14 |
|
|
叶雨昊 (yeyuhao22006)
|
8ms |
428 KiB |
|
231 Bytes |
2022-10-23 20:18:37 |
|
|
王瀚毅 (wanghanyi)
|
8ms |
428 KiB |
|
207 Bytes |
2023-1-15 12:02:01 |
|
|
无尽的想象 (谭仕高)
|
8ms |
444 KiB |
|
227 Bytes |
2022-8-25 17:47:13 |
|
|
葛琮扬
|
8ms |
6.9 MiB |
|
240 Bytes |
2023-7-21 12:13:39 |
|
|
陈雨泽1
|
8ms |
436 KiB |
|
528 Bytes |
2022-10-1 15:32:23 |
|
|
明轩 (吕同学)
|
8ms |
512 KiB |
|
272 Bytes |
2023-1-8 9:51:14 |
|
|
三差学生(尘埃蓝莓) (白佳睿)
|
8ms |
8.4 MiB |
|
211 Bytes |
2023-7-10 17:57:23 |
|
|
马兴宇 (mxy01)
|
8ms |
440 KiB |
|
247 Bytes |
2022-10-1 19:18:14 |
|
|
廖海宇在追杀马牌痞 (liaohaiyu22031)
|
8ms |
440 KiB |
|
245 Bytes |
2022-12-17 11:12:07 |
|
|
huanglu
|
8ms |
436 KiB |
|
283 Bytes |
2022-11-25 15:34:15 |
|
|
朱老师 (zyp)
|
8ms |
440 KiB |
|
206 Bytes |
2022-12-18 10:44:25 |
|
|
SYH.邵允涵 (Zoe邵)
|
8ms |
444 KiB |
|
219 Bytes |
2023-3-17 20:16:16 |
|
|
https://www.minecraft.net/zh-hans (王振西)
|
8ms |
6.9 MiB |
|
230 Bytes |
2023-6-18 14:37:25 |
|
|
22029-lyh
|
8ms |
384 KiB |
|
417 Bytes |
2022-12-11 18:28:43 |
|
|
ttt123
|
8ms |
440 KiB |
|
247 Bytes |
2022-12-11 18:27:30 |
|
|
手搓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)
|
8ms |
440 KiB |
|
270 Bytes |
2022-12-11 18:10:01 |
|
|
scallway
|
8ms |
420 KiB |
|
201 Bytes |
2023-1-11 15:45:51 |
|
|
靳博然 (jbr)
|
8ms |
512 KiB |
|
245 Bytes |
2023-5-28 17:31:39 |
|
|
ChongqingGroup (Donce)
|
8ms |
7.2 MiB |
|
232 Bytes |
2023-11-12 16:02:33 |
|
|
龙湖时代C馆-邹镇宇 (邹镇宇)
|
9ms |
512 KiB |
|
210 Bytes |
2022-9-6 20:20:13 |
|
|
hrz
|
9ms |
7.3 MiB |
|
239 Bytes |
2023-11-12 15:39:21 |
|
|
Guest
|
9ms |
7.1 MiB |
|
220 Bytes |
2024-1-13 11:26:22 |
|
|
重庆龙湖源著校区+杨聆暄 (杨聆暄)
|
9ms |
512 KiB |
|
228 Bytes |
2023-1-17 15:27:13 |
|
|
laiyouming22031
|
9ms |
436 KiB |
|
204 Bytes |
2022-12-18 10:06:36 |
|
|
廖海宇在追杀马牌痞 (liaohaiyu22031)
|
9ms |
436 KiB |
|
207 Bytes |
2022-12-14 16:16:52 |
|
|
wangzihang
|
9ms |
7.1 MiB |
|
237 Bytes |
2023-11-25 16:24:40 |
|
|
200800
|
9ms |
7.2 MiB |
|
242 Bytes |
2023-11-12 16:00:44 |
|
|
Tender. (05c05-zhou)
|
9ms |
512 KiB |
|
225 Bytes |
2022-10-18 11:58:40 |
|
|
朱泽晟
|
9ms |
448 KiB |
|
244 Bytes |
2022-8-30 12:49:49 |
|
|
谭懿轩 (yanyixuan)
|
9ms |
448 KiB |
|
156 Bytes |
2022-8-23 18:02:17 |
|
|
新壹街校区--税崇峻 (税崇峻)
|
9ms |
6.9 MiB |
|
228 Bytes |
2023-8-8 15:30:35 |
|
|
时代一校-曾科智 (曾科智)
|
10ms |
512 KiB |
|
337 Bytes |
2022-9-10 20:37:32 |
|
|
ttt123
|
10ms |
436 KiB |
|
258 Bytes |
2022-12-3 22:40:37 |
|
|
昌文迪 (05c05-cwd2)
|
10ms |
512 KiB |
|
232 Bytes |
2022-11-4 21:14:24 |
|
|
朱老师 (zyp)
|
10ms |
512 KiB |
|
243 Bytes |
2022-11-3 19:54:59 |
|
|
高彬月
|
10ms |
7.2 MiB |
|
230 Bytes |
2023-11-12 15:55:49 |
|
|
Guest
|
11ms |
7.1 MiB |
|
220 Bytes |
2024-1-13 11:27:01 |
|
|
xqc125
|
12ms |
7.2 MiB |
|
238 Bytes |
2023-11-25 17:23:47 |
|
|
zyl
|
12ms |
7 MiB |
|
185 Bytes |
2024-1-6 14:14:49 |
|
|
刘昊臻 (liuhaozhen)
|
12ms |
7.3 MiB |
|
217 Bytes |
2023-12-16 16:47:37 |
|
|
李彦臻
|
12ms |
7 MiB |
|
280 Bytes |
2023-12-3 20:57:47 |
|
|
田开朗
|
12ms |
7.1 MiB |
|
220 Bytes |
2024-1-13 11:30:15 |
|
|
周振豪
|
12ms |
6.9 MiB |
|
224 Bytes |
2023-11-25 17:24:24 |
|
|
王康瑞
|
12ms |
7.2 MiB |
|
243 Bytes |
2024-1-13 11:33:14 |
|
|
小柒冉欧
|
14ms |
7.2 MiB |
|
270 Bytes |
2023-11-25 17:32:07 |
|
|
金海童1
|
14ms |
7 MiB |
|
241 Bytes |
2023-12-31 15:15:52 |
|
|
小码王高新校区—刘晨皓 (shishen)
|
15ms |
7 MiB |
|
228 Bytes |
2023-11-25 17:21:39 |
|
|
徐子恩 (Cow)
|
15ms |
444 KiB |
|
234 Bytes |
2022-3-20 9:22:54 |
|
|
新壹街—熊轩杭 (xiongxuanhang)
|
15ms |
7 MiB |
|
249 Bytes |
2023-12-23 16:38:57 |
|
|
Guest
|
16ms |
7 MiB |
|
220 Bytes |
2024-1-13 11:29:06 |
|
|
张雯皓 (zhangwenhao)
|
17ms |
7.1 MiB |
|
261 Bytes |
2023-12-23 11:28:34 |
|
|
拥抱幸福小熊(吴沛篪)
|
18ms |
7.3 MiB |
|
283 Bytes |
2024-1-13 11:14:00 |
|
|
ganlin1
|
20ms |
6.8 MiB |
|
237 Bytes |
2023-11-24 16:17:11 |
|
|
Guest
|
20ms |
7.1 MiB |
|
220 Bytes |
2024-1-13 11:20:43 |
|
|
liushiqi
|
28ms |
552 KiB |
C++11(O2) |
225 Bytes |
2024-9-3 15:50:19 |
|
|
陈家熠
|
31ms |
532 KiB |
C++98 |
242 Bytes |
2024-11-17 17:17:39 |
|
|
这是非常▦▦▦的 (段秉辰)
|
32ms |
532 KiB |
C++17 |
224 Bytes |
2024-9-30 17:33:40 |
|
|
xzf
|
32ms |
532 KiB |
|
322 Bytes |
2024-4-14 15:48:05 |
|
|
李浩然
|
33ms |
532 KiB |
C++98 |
194 Bytes |
2024-11-17 16:02:18 |
|
|
杨淇瑞 (杨淇瑞29)
|
33ms |
764 KiB |
|
276 Bytes |
2024-2-17 20:51:35 |
|
|
许徐非凡 (非同凡响)
|
33ms |
764 KiB |
C++98 |
222 Bytes |
2024-10-27 18:58:06 |
|
|
邱越
|
33ms |
532 KiB |
|
227 Bytes |
2024-2-2 21:11:32 |
|
|
¿¿¿??? (李睿瞳)
|
33ms |
764 KiB |
|
250 Bytes |
2024-2-2 17:53:34 |
|
|
褚博艺
|
34ms |
764 KiB |
|
229 Bytes |
2024-3-30 16:35:29 |
|
|
Him神
|
35ms |
532 KiB |
|
199 Bytes |
2024-3-1 15:05:22 |
|
|
赵奕铭
|
35ms |
552 KiB |
|
204 Bytes |
2024-3-8 21:16:46 |
|
|
贾博涵
|
35ms |
532 KiB |
|
223 Bytes |
2024-3-5 14:43:01 |
超级管理员 (root)
