数据结构之堆栈的链接表示

堆栈的链接表示其实就是实现一个带头节点的单链表，头结点即为top指针，进栈操作就是利用头插法创建堆栈，出栈即为删除第一个节点，在这里只实现创建、进栈、出栈操作,其余操作请查阅单链表实现
完整代码如下

#include <stdio.h>
#include <stdlib.h>
typedef struct Noded{
	struct Noded *top;
	int data;
}Noded;

static int size = 0;
void Init(Noded *head){
	head = (Noded*)malloc(sizeof(Noded));
	head->top = NULL;
	
}

void push(Noded *head,int x){
	Noded *p = (Noded*)malloc(sizeof(Noded));
	p->data = x;
	p->top = head->top;
	head->top = p;
	size++;
}

Noded *pop(Noded *head){
	if(head->top == NULL)
	return NULL;
	head->top = head->top->top;
	size--;
	return head;
}

int main(){
	Noded *head;
	Init(head);
	int i;
	for(i = 0; i < 7; i++)
	push(head,i);
	printf("%d\n",size);
	pop(head);
	printf("%d\n",size);
	
}