指针、链表操作

双向链表
蓝线表示删除ptCur项后

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


typedef struct NAME{
	char *name;
	struct NAME *pre;
	struct NAME *next;
}T_Name, *PT_Name;

static PT_Name g_ptNameHead;

void add_name (PT_Name ptNew)
{
	PT_Name ptCur;
	if(g_ptNameHead==NULL)
	{
		g_ptNameHead=ptNew;

	}	
	else
	{
		ptCur=g_ptNameHead;
		while(ptCur->next)
		{
			ptCur=ptCur->next;
		}
		ptCur->next=ptNew;
		ptNew->pre=ptCur;
	}
}

void add_one_name()
{
	PT_Name ptNew;
	char *str;
	char name[128];

	printf("enter the name:");
	scanf("%s",name);

	str=malloc(strlen(name)+1);
	strcpy(str,name);

	ptNew=malloc(sizeof(T_Name));
	ptNew->name=str;
	ptNew->pre=NULL;
	ptNew->next=NULL;

	add_name(ptNew);
}
/*find name*/
PT_Name get_name(char *name)
{
	PT_Name ptCur;
	if (g_ptNameHead==NULL)
	{
		return 0;
	}
	else
	{
		ptCur=g_ptNameHead;
		while(ptCur)	
		{
			if(strcmp(ptCur->name,name)==0)
				return ptCur;
			else
				ptCur=ptCur->next;
		}
	}
	return NULL;
}

void del_name(PT_Name ptDel)
{
	PT_Name ptCur;
	PT_Name ptPre;
	PT_Name ptNext;

	if(g_ptNameHead==ptDel)
	{	
		g_ptNameHead=ptDel->next;
		free(ptDel);
		return;
	}
	else
	{
		ptCur=g_ptNameHead->next;
		while(ptCur)
		{
			if(ptCur==ptDel)
			{
				ptPre=ptCur->pre;
				ptNext=ptCur->next;
				ptPre->next=ptNext;
				free(pCur);
				if(ptNext)
				{
					ptNext->pre=ptPre;
				}
				break;
			}
			else
				ptCur=ptCur->next;

		}
	}
}

void del_one_name()
{
	PT_Name ptDel;
	char name[128];	
	printf("enter del name:");
	scanf("%s",name);

	ptDel=get_name(name);
	if(ptDel==NULL)
	{	
		printf("no name\n");
		return;
	}
	del_name(ptDel);		

}

void list_all_name()
{
	PT_Name ptCur;
	ptCur=g_ptNameHead;
	int i=0;
	if(ptCur==NULL)
		return;
	else
	{	
		while(ptCur)
		{
			printf("%02d,%s\n",i++,ptCur->name);
			ptCur=ptCur->next;

		}
	}
}

int main(int argc,char **argv)
{
	char c;
	printf("<l> list all names\n");	
	printf("<a> add one names\n");	
	printf("<d> del one  names\n");	
	printf("<x> exit\n");
	
	while(1)
	{
		c=getchar();
		switch(c)
		{
			case'l':
			{
				list_all_name();
				break;
			}

			case'a':
			{
				add_one_name();
				break;
			}
			case'd':
			{
				del_one_name();
				break;
			}

			case'x':
			{
				return 0;
				break;
			}
		}
	}
	return 0;
}

/*双向循环链表插入函数*/
TYPE *insert_link(TYPE *head,TYPE *p_in)
{
 TYPE *p_mov = head,p_front = head;
 
 if(head == NULL)
 {
  head = p_in;
  p_in->next = head;
  p_perior = head;
 }
 else
 {
  while((p_in->[] > p_mov->[]) && (p_mov->next != head))
  {
   p_front = p_mov;
   p_mov = p_mov->next;
  }
  
  if(p_in->[] <= p_mov->[])
  {
   if(head == p_mov)
   {
    p_in->prior = head->prior;
    head->prior->next = p_in;
    p_in->next = p_mov;
    p_mov->prior = p_in;
    head = p_in;
   }
   else
   {
    pf->next = p_in;
    p_in->prior = p_front;
    p_in->next = p_mov;
    p_mov->prior = p_in;
   }
  }
  else
  {
   p_mov->next = p_in;
   p_in->prior = p_mov;
   p_in->next = head;
   head->prior = p_in;
  }
 }
 return head;
}

/*双向链表删除函数*/
TYPE *delete_link(TYPE *head,int num)
{
 TYPE *p_mov = head,p_front = head;
 
 if(head == NULL)
  printf("Not link\n");
 while((p_mov->num != num) && (p_mov->next != head))
 {
  p_front = p_mov;
  p_mov = p_mov->next;
 }
 if(p_mov->num == num)
 {
  if(p_mov == head)
  {
   if(p_mov->next == head && p_mov->prior == head)
   {
    free(pb);
    head =NULL;
    return head;
   }
   head->next->prior = head->prior;
   head->prior->next = head->next;
   head = head->next;
  }
  else
  {
   p_front->next = p_mov->next;
   p_mov->next->prior = p_front;
  }
  free(p_mov);
  printf("The node is delete\n");
 }
 else
 {
  printf("The node not been found\n");
 }
 return head;
}