#include<stdio.h>
#include<stdlib.h>
int tail=0,top=0;
typedef struct Stack
{
char data;
struct Stack *next;
}Stack;
Stack *CreateNode_Head()
{
Stack *headNdoe=(Stack *)malloc(sizeof(Stack));
headNdoe->next=NULL;
headNdoe->data=NULL;
return headNdoe;
}
Stack *CreateNode(char data)
{
Stack *newNode=(Stack *)malloc(sizeof(Stack));
newNode->data=data;
newNode->next=NULL;
return newNode;
}
void Stack_insert(Stack *headNode,char data)
{
Stack *newNode=CreateNode(data);
newNode->next=headNode->next;
headNode->next=newNode;
top++;
}
void printf_stack(Stack *headNode)
{
栈的回文判断
最新推荐文章于 2024-06-11 05:40:28 发布