#include <stdio.h>
#include <stdlib.h> ///鏈式棧
typedef struct node
{
int data;
struct node *next;
}Node,*Linklist;
Linklist CreateList()
{
Linklist p;
Linklist h;
int data1;
scanf("%d",&data1);
if(data1 != 0)
{
h = (Node *)malloc(sizeof(Node));
h->data = data1;
h->next = NULL;
}
else if(data1 == 0)
return NULL;
scanf("%d",&data1);
while(data1 != 0)
{
p = (Node *)malloc(sizeof(Node));
p -> data = data1;
p -> next = h;
h = p;
scanf("%d",&data1);
}
return h;
}
void Outputlist(Node *head)
{
Linklist p;
p = head;
while(p != NULL )
{
printf("%d ",p->data);
p = p->next;
}
printf("\n");
}
void Freelist(Node *head)
{
Node *p;
Node *q = NULL;
p = head;
while(p != NULL)
{
q = p;
p = p->next;
free(q);
}
}
int main()
{
Node *head;
head = CreateList();
Outputlist(head);
Freelist(head);
return 0;
}
2.順序棧
[cpp] view plain copy
#include <iostream>
#include <stdio.h>
#include <stdlib.h> ///順序棧
#define MaxSize 100
using namespace std;
typedef
標簽：
數據結構
實驗
上傳時間：
2018-05-09
上傳用戶：123456..
