C语言双向循环链表

/*****************************************************
copyright (C), 2014-2015, Lighting Studio. Co.,     Ltd. 
File name:
Author:Jerey_Jobs    Version:0.1    Date: 
Description:
Funcion List: 
*****************************************************/

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

enum ret_val{MALLOC_OK,MALLOC_NO,CREATE_OK,CREATE_NO};

struct dblnode
{
    int num;

    struct dblnode *prior,*next;
};

typedef struct dblnode Dblnode;
//typedef struct dblnode * DblLink;
typedef Dblnode * DblLink;

int is_malloc_ok(DblLink new_node)
{
	if(NULL == new_node)
	{
        printf("malloc error!\n");
		return MALLOC_NO;
	}

	return MALLOC_OK;
}

int create_node(DblLink * new_node)
{
	*new_node = (DblLink)malloc(sizeof(Dblnode));
	if(MALLOC_OK == is_malloc_ok(*new_node))
	{
		return CREATE_OK;
	}

	return CREATE_NO;
}

void create_dbllink(DblLink *head)
{
	if(CREATE_OK == create_node(head))
	{
		(*head)->prior = *head;
		(*head)->next = *head;
		printf("create dbllink success!\n");
	}
	else
	{
		printf("dbllink create falilure!\n");
		exit(EXIT_FAILURE);
	}
}

void insert_node_tail(DblLink head,DblLink new_node)
{
	new_node->prior = head->prior;
	new_node->next = head;
	head->prior->next = new_node;
	head->prior = new_node;
}

void insert_node(DblLink head)
{
	DblLink new_node = NULL;

	int i;
    for(i = 0;i < 10;i++)
	{
		if(CREATE_OK == create_node(&new_node))
		{
			new_node->num = i + 1;
			insert_node_tail(head,new_node);
		}
		else
		{
			printf("create new node error!\n");
		}
	}

}

void display_link_next(DblLink head)
{
	DblLink p = NULL;

	if( NULL == head)
	{
		printf("no such link!\n");
		return;
	}

	p = head->next;

	if(p == head)
	{
        printf("link is empty!\n");
	}

	while(p != head)
	{
		printf("%d\n",p->num);
		p = p->next;
	}
}

void release_link(DblLink * head)
{
	DblLink p = NULL;

    p = (*head)->next;

	while(p != *head)
	{
		(*head)->next = p->next;
		free(p);
		p = (*head)->next;
	}

	free(*head);

	*head = NULL;
}

int main()
{
	DblLink head = NULL;
//	DblLink new_node = NULL;

//	int i;

	create_dbllink(&head);

	insert_node(head);

    display_link_next(head);

	release_link(&head);

	display_link_next(head);

    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值