Linux学习——数据结构之链栈

目录

主函数文件test.c

功能函数文件linkstack.c

声明和初始化文件linkstack.h

---

 

主函数文件test.c

#include <stdio.h>
#include <stdlib.h>
#include "linkstack.h"

int main(int argc, const char *argv[])
{
	linkstack s;

	s = stack_create();
	if (s == NULL) 
		return -1;

	stack_push(s, 10);
	stack_push(s, 20);
	stack_push(s, 30);
	stack_push(s, 40);

#if 0
	while (!stack_empty(s)) {
		printf("pop:%d\n", stack_pop(s));
	}
#endif

	s = stack_free(s);
	
	return 0;
}

功能函数文件linkstack.c

#include <stdio.h>
#include <stdlib.h>
#include "linkstack.h"
linkstack stack_create()
{
	linkstack s;
	if((s = (linkstack)malloc(sizeof(listnode))) == NULL)
	{
		printf("malloc is defalut");
		return NULL;
	}
	s->data = 0;
	s->next = NULL;
	return s;
}
int stack_push(linkstack s, data_t value)
{
	linkstack p;
	if(s == NULL) {
		printf("s is NULL");
		return -1;
	}
	p = (linkstack)malloc(sizeof(listnode));
	if(p == NULL)
	{
		printf("malloc is defalut");
		return -1;
	}
	p->data = value;
	//p->next = NULL;
	p->next = s->next;
	s->next = p;
	return 0;
}
data_t stack_pop(linkstack s)
{
	linkstack p;
	data_t a;
	if(s == NULL)
	{
		printf("s is NULL");
		return -1;
	}
	p = s->next;
	s->next = p->next;

	a = p->data;

	free(p);
	p =NULL;
	return a;
	
}
int stack_empty(linkstack s)
{
	if (s == NULL) {
		printf("s is NULL\n");
		return -1;
	}

	return (s->next == NULL ? 1 : 0);
}

data_t stack_top(linkstack s) {
	return (s->next->data);
}

linkstack stack_free(linkstack s) {
	linkstack p;

	if (s == NULL) {
		printf("s is NULL\n");
		return NULL;
	}

	while (s != NULL) {
		p = s;
		s = s->next;
		printf("free:%d\n", p->data);
		free(p);
	}

	return NULL;
}

声明和初始化文件linkstack.h

typedef int data_t;

typedef struct node {
	data_t data;
	struct node *next;
}listnode, *linkstack;

linkstack stack_create();
int stack_push(linkstack s, data_t value);
data_t stack_pop(linkstack s);
int stack_empty(linkstack s);
data_t stack_top(linkstack s);
linkstack stack_free(linkstack s);