剑指offer 栈 c语言实现

E:\arithmetic\Stack

栈的create、push、pop、isempty、print

先构造struct node，在栈结构里面包含指向顶部节点的top

//stack.h
#ifndef STACK_H_H
#define STACK_H_H

#include <stdio.h>
#include <stdlib.h>//molloc free

typedef struct LinkNode {
	int value;
	struct LinkNode *next;
}Node, *NodeLink;

typedef struct NodeStack{
	Node *top;
}Stack;

Stack*  createStack();
int isEmpty(Stack *s);
void pushStack(Stack *s, int n);
int popStack(Stack *s);
void printStack(Stack *s);
#endif 

//stack.c
#include "Stack.h"

Stack*  createStack(){
	Stack *s = malloc(sizeof(Stack));
	s->top = NULL;
	return s;
}
int isEmpty(Stack *s){
	return s->top==NULL ? 1:0;
}
void pushStack(Stack *s, int n){
	Node *t = malloc(sizeof(Node));
	t->value = n;
	t->next = s->top;
	s->top = t;
}
int popStack(Stack *s){
	if(isEmpty(s)){
		printf("Stack is empty! quit!\n");
		return -1;//??
	}
	int n = s->top->value;
	Node *t = s->top;
	s->top= t->next;
	free(t);
	return n; 
}
void printStack(Stack *s){
	Node *t = s->top;
	while(t != NULL){
		printf("%d\t", t->value);
		t = t->next;
	}
}

//main.c 
#include <stdio.h>
#include "Stack.h"
int main(int argc, char *argv[])
{
	Stack *s;
	s = createStack();
	int a[] = {1,2,3,4,5,6,7,8,9,0};
	int i;
	for(i=0 ; i<10 ; i++){
		pushStack(s, a[i]);
	}
	printStack(s);
	return 0;
}