poj 1012(TLE)

最新推荐文章于 2024-06-05 21:46:07 发布

原创最新推荐文章于 2024-06-05 21:46:07 发布 · 693 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#iterator #delete #数据结构 #include #class

本文介绍了一个使用循环链表实现特定算法的过程，虽然最终因效率问题未达到最优解，但展示了自定义数据结构的魅力。文章讨论了自定义数据结构的实际应用及其灵活性，并提到了析构函数的注意事项。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream> #include <vector> using namespace std; class Node { public: Node(int order1, bool save1 = 1, Node *next1 = 0) { order = order1; save = save1; next = next1; } int order; bool save; Node *next; }; class NodeList { public: NodeList() { head = tail = 0; } ~NodeList(); public: Node *head, *tail; }; NodeList::~NodeList() { Node *temp; while(head != tail) { temp = head; head = head->next; delete temp; } delete head; } int main() { vector<int> result; int k; cin>>k; while(k != 0) { NodeList *pList = new NodeList(); int t = 1; while(t <= 2*k) { if(pList->head == 0) { pList->head = pList->tail = new Node(t); ++t; } else { pList->tail->next = new Node(t); pList->tail = pList->tail->next; ++t; } } pList->tail->next = pList->head; int n = 0; while(true) { ++n; int z; for(int x = (2*n-1)*k+1; x <= 2*n*k; ++x) { Node *pNode = pList->head; for(int r = 1; r <= 2*k; ++r) { pNode->save = 1; pNode = pNode->next; } Node *pNode1 = pList->head; for(int y = 1; y < x; ++y) { if(pNode1->save == 0) { do { pNode1 = pNode1->next; }while(pNode1->save == 0); } else { pNode1 = pNode1->next; } } for(z = 1; z <= k; ++z) { if(1 <= pNode1->order && pNode1->order <= k) { break; } else { pNode1->save = 0; if(z == k) { result.push_back(x); continue; } for(int s = 1; s <= x; ++s) { pNode1 = pNode1->next; if(pNode1->save == 0) { do { pNode1 = pNode1->next; } while(pNode1->save == 0); } } } } if(z == k+1) { break; } } if(z == k+1) { break; } } delete pList; cin>>k; } for(vector<int>::iterator iter = result.begin(); iter != result.end(); ++iter) { cout<<*iter<<endl; } return 0; }

我的思路是利用循环链表，结果超时了，网上都直接暴力把表现准备好了然后直接查表搞定，算了，就这样吧~

平时很少用到自定义的数据结构，太繁杂了，大多用标准库，今天试了一下，其实自定义有个好处，灵活！以后要多试试~

析构函数很容易因为边界而出错，要重点关注~