typedef struct Node{
int data;
struct Node *pnext;
}NODE;
typedef struct Stack{
NODE *stackTop;
int capacity;
}STACK;
NODE* CreateNode(int data){
NODE *newNode=(NODE*)malloc(sizeof(NODE));
if(newNode==NULL) exit(0);
newNode->data=data;
newNode->pnext=NULL;
return newNode;
}
STACK* CreateNewStack(){
STACK *myStack=(STACK*)malloc(sizeof(STACK));
myStack->capacity=0;
myStack->stackTop=0;
return myStack;
}
void Stack_Push(STACK *myStack,int *data){
NODE *newNode=CreateNode(*data);
printf("%d",*data);
newNode->pnext=myStack->stackTop;
myStack->stackTop=newNode;
myStack->capacity++;
}
int Get_Stack_Top(STACK *myStack){
if(myStack->capacity==0){
printf("The stack is empty.n");
exit(0);
}
return myStack->stackTop->data;
}
//问题出在Pop那个函数中,其他函数仅供参考。
//这个函数用来输出之前头节点的地址,
声明一个int类型的指针之后将头节点地址传入其中。
int* Stack_Pop(STACK* myStack){
int *oldTop;
if(myStack->capacity==0){
printf("Can not pop.n");
exit(0);
}
else{
//应该是这一步的赋值出了问题。
oldTop=myStack->stackTop->data;
NODE* pMove=myStack->stackTop->pnext;
free(myStack->stackTop);
myStack->stackTop=pMove;
myStack->capacity--;
}
return oldTop;
}
下面是main.C文件int main(void){
STACK *myStack=CreateNewStack();
int element;
int *data;
printf("Please input the number you want to converse:n");
scanf("%d",&element);
while((element/2)!=0){
data=(int*)malloc(sizeof(int));
*data=element%2;
Stack_Push(myStack,data);
element=element/2;
}
Stack_Push(myStack,&element);
printf("The binary number is:n");
while(!Empty(myStack)){
data=(int*)Get_Stack_Top(myStack);
Stack_Pop(myStack);
printf("%dn",*data);
}
}
//下面是main.c文件
int main(void){
STACK *myStack=CreateNewStack();
int element;
int *data;
printf("Please input the number you want to converse:n");
scanf("%d",&element);
while((element/2)!=0){
data=(int*)malloc(sizeof(int));
//对传入的数据取余之后将余数入栈。
*data=element%2;
Stack_Push(myStack,data);
element=element/2;
}
Stack_Push(myStack,&element);
printf("The binary number is:n");
while(!Empty(myStack)){
//二进制数的入栈与出栈均无问题,但地址传值时不知道出了什么问题。
data=(int*)Get_Stack_Top(myStack);
Stack_Pop(myStack);
printf("%dn",*data);
}
}
求大佬解答。