顺序栈的操作其实与前面我们写的顺序表差不多,只是栈只能一头进再出!
代码如下:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//顺序栈
typedef int data_t;
typedef struct node
{
data_t data;
struct node *next;
}lstack;
lstack *creatlstack()
{
lstack *head=(lstack *)malloc(sizeof(lstack));
if(head==NULL)
{
perror("malloc");
return NULL;
}
head->data=-1;
head->next=NULL;
return head;
}
//判空
int lstack_is_empty(lstack *head)
{
return(head->next==NULL)?1:0;
}
//求表长
int lstack_length(lstack *head)
{
lstack *p=head->next;
int len;
while(p!=NULL)
{
len++;
p=p->next;
}
return len;
}
//入栈
int lstack_ruzhan(lstack *head,data_t data)
{
lstack *new=(lstack *)malloc(sizeof(lstack));
if(new==NULL)
return -1;
new->data=data;
new->next=NULL;
new->next=head->next;
head->next=new;
return 0;
}
//出栈
int lstack_chuzhan(lstack *head)
{
if(lstack_is_empty(head))
return -1;
lstack *p=head->next;
data_t m=p->data;
head->next=p->next;
free(p);
p=NULL;
return m;
}
//清空
void lstack_clear(lstack *head)
{
lstack *p=head->next;
lstack *q=NULL;
head->next=NULL;
while(p!=NULL)
{
q=p->next;
free(p);
p=q;
}
}
//销毁
void lstack_destory(lstack **head)
{
lstack_clear(*head);
free(*head);
*head=NULL;
}
//打印
void lstack_display(lstack *head)
{
lstack *p=head->next;
while(p!=NULL)
{
printf("%d ",p->data);
p=p->next;
}
puts("");
}
int main(int argc, const char *argv[])
{
lstack *head=creatlstack();
int i=0;
while(i<10)
{
lstack_ruzhan(head,i+1);
i++;
}
lstack_display(head);
int j=0;
while(j<5)
{
data_t data=lstack_chuzhan(head);
j++;
printf("data=%d ",data);
}
puts("");
lstack_display(head);
lstack_clear(head);
lstack_display(head);
lstack_destory(&head);
printf("--------------------------------\n");
lstack_display(head);
return 0;
}
要搞清楚栈和队列的区别!