双向链表循环

head.h

#ifndef __HEAD_H__

#define __HEAD_H__
#include<string.h>
#include<stdio.h>
#include<stdlib.h>
typedef char datatype[20];
typedef struct Node
{
	union{
		int len;
		datatype data;
	};
	struct Node *next;
	struct Node *prev;
}*doublelink;

doublelink create_head();

doublelink create_node();
int insert_head(doublelink l,  datatype e);

void output(doublelink l);

int  insert_rear(doublelink l,datatype e);

int delete_head(doublelink l);
int delete_rear(doublelink l);
int insert_gps(doublelink l,int gps,datatype e);
int revise_data(doublelink l,int gps, datatype e);
#endif

main.c

#include "head.h"
int main(int argc, const char *argv[])
{
	doublelink l=create_head();

	int n;
	datatype e;
	printf("请输入字符串个数");
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		printf("请输入字符串:");
		scanf("%s",e);
		insert_head(l,e);//头插
       // insert_rear(l,e);//尾插
	}
	output(l);

	//头删
	delete_head(l);
//	delete_head(l);
	output(l);

	//尾删
	delete_rear(l);
	output(l);

	int gps;
	printf("请输入插入的位置：");
	scanf("%d",&gps);
	printf("请输入插入的值：");
	scanf("%s",e);
	insert_gps(l,gps,e);
	output(l);


	printf("请输入修改的位置：");
	scanf("%d",&gps);
	printf("请输入修改的值：");
	scanf("%s",e);
	revise_data(l,gps,e);
	output(l);
	return 0;
}

test.c

#include "head.h"
doublelink create_head()
{
	doublelink l=(doublelink)malloc(sizeof(struct Node));
		if(l==NULL)
			return NULL;
		l->len=0;
		l->next=NULL;
		l->prev=NULL;
		return l;
}
doublelink create_node()
{
	doublelink p=(doublelink)malloc(sizeof(struct Node));
	if(p==NULL)
		return NULL;
	strcpy(p->data,"");
	p->next=NULL;
	p->prev=NULL;
	return p;
}
/*
 * function:    头插
 * @param [ in] 
 * @param [out] 
 * @return      
 */
int insert_head(doublelink l,  datatype e)
{
	if(l==NULL){
		printf("插入失败\n");
		return -1;
	}
	doublelink s=create_node();
		if(s==NULL)
			return -1;
	strcpy(s->data,e);
		s->next=l->next;
		s->prev=l;
		if(l->next!=NULL){
			l->next->prev=s;
		}
		l->next=s;
		l->len++;
		return 0;
}
/*
 * function:    遍历
 * @param [ in] 
 * @param [out] 
 * @return      
 */
void output(doublelink l)
{
	if(l==NULL||l->len==0){
		printf("遍历失败\n");
		return;
	}
	puts("正向遍历\n");
	doublelink p=l;
		while(p->next!=NULL){
			p=p->next;
			printf("%s\t",p->data);
			
	}
		printf("\n");
	puts("逆向遍历\n");
	while(p->prev!=NULL){
		printf("%s\t",p->data);
		p=p->prev;
	}
	puts("");
}
/*
 * function:    尾插
 * @param [ in] 
 * @param [out] 
 * @return      
 */
int insert_rear(doublelink l,datatype e)
{
	if(l==NULL){
		printf("插入失败\n");
		return -1;
	}
	doublelink p=l;
	while(p->next!=NULL){
		p=p->next;
	}
	doublelink s= create_node();
	if(s==NULL)
		return -1;
	strcpy(s->data,e);
	p->next=s;
	s->prev=p;
	l->len++;
}
int delete_head(doublelink l)
{
	if(l==NULL||l->len==0){
		printf ("头删失败\n");
		return -1;
	}
	doublelink q=l->next;
	l->next=q->next;
	if(q->next!=NULL){
		q->next->prev=l;
	}
	free(q);
	q=NULL;
	l->len--;
}
int delete_rear(doublelink l)
{
	if(l==NULL||l->len==0){
		printf("删除失败\n");
		return -1;
	}
	doublelink q=l;
	while(q->next!=NULL){
		q=q->next;
	}
	q->prev->next=NULL;
	free(q);
	q=NULL;
	l->len--;
}
int insert_gps(doublelink l,int gps,datatype e)
{
	if(l==NULL||gps<1||gps>l->len+1){
		printf("插入失败");
		return -1;
	}
	doublelink b=create_node();
	if(b==NULL)
		return -1;
	doublelink p=l;
	for(int i=1;i<gps;i++){
		p=p->next;
	}
	strcpy(b->data,e);
	if(p->next!=NULL){
		p->next->prev=b;
	}
	b->next=p->next;
	b->prev=p;
	p->next=b;
	l->len++;
	return 0;
}
int revise_data(doublelink l,int gps, datatype e)
{
	if(l==NULL||l->len==0||gps<1||gps>l->len+1){
		printf("修改失败");
		return -1;
	}
	doublelink a=l;
	for(int i=1;i<gps;i++){
		a=a->next;
	}
	strcpy(a->next->data,e);
}

运行结果