caicai____的博客

template <class T> class Stack { public: Stack(int size) { elements = new T[size]; MaxSize = size; topp =0; } ~Stack() { delete []elements; } void OverStack() { T* NewArray=NULL; int size = MaxSize; if (topp >= 0.5 * size) {

双向链表 struct node { int val; node* next; node* pre; }; class stack { public: stack() { head=new node;//带头节点 head->next = nullptr;//建立的时候要指向空 tail = head; } void push(int x) { p = new node; p->val = x; tail->next = p; p-&gt