Question

这段代码运行时候老出问题，一直找不出哪错了，求大神帮看一下

#ifndef LSTACK_H
#define LSTACK_H
template<class T>
class Node
{
private:
Node<T> *next;
public:
T data;
Node(T data,Node<T> *next=0){};
void insertAfter(Node<T> *node){
if(next==0){
next=node;
}
else
{
node->next=next;
next=node;
}
};
Node<T>* deleteAfter(){
if(next==0){
cout<<"there is no Node After"<<endl;
}
else
{
this->next=this->next->next;
delete(this->next);
}
return this;
};
Node<T>* nextNode(){
return next;
};

};
class Stack
{
private:
Node<int> *pre;
Node<int> *top;
public:
Stack(){createStack();};
void createStack();
void push(Node<int> &item);
Node<int> pop();
int size();
void show_Stack();
};
#endif
#include"Stack.h"
#include<iostream>
using namespace std;
void Stack::createStack(){
int num;
cin>>num;
Node<int> *temp;
//Node<int> *top;
top=new Node<int>(num,0);
pre=top;
while(num!=-9999)
{
cin>>num;
temp=new Node<int>(num,0);
push(*temp);
}
//return top;
}
void Stack::push(Node<int> &item)
{
pre->insertAfter(&item);
pre=pre->nextNode();
}
Node<int> Stack::pop()
{
Node<int> node=(*pre);
Node<int> *se=top;
while(se->nextNode()!=pre)
{
se=se->nextNode();
}
pre=se;
delete(pre->nextNode());
return node;
}
int Stack::size()
{
int count=0;
Node<int> *se=top;
while(se->nextNode()!=0)
{
se=se->nextNode();
count++;
}
return count;
}
void Stack::show_Stack(){
Node<int> *se=top;
while(se!=0)
{
cout<<se->data<<endl;
se=se->nextNode();

}
}

#include<iostream>
#include"Stack.h"
#include"STACK.h"
using namespace std;
void main()
{
Stack s;
s.show_Stack();
}

Answer 1

你装修使用的吗

Answer 2

突体育体育冗图图

Answer 3

大神在过年

Answer 4

...........没学过编程