实验1_1_问题描述：任意给定一个字符串，字符串中包含除了空格、换行符之外的任意字符。你的-CSDN博客

本文链接：https://blog.csdn.net/moonwalkings/article/details/4714527

采用链式存储结构存储 ’a’,’b’,’c’,’d’,’e’,’f’ 六个字符，并完成如下操作：

(a) 显示第 3 个数据；

(b) 在第 2 个数据后插入 ’e’

(d) 删除链表

#include <stdio.h> 
#include <stdlib.h> 
#define OK 1
#define ERROR 0
typedef struct LNode 
{ 
char data; 
struct LNode *next; 
}LNode,*LinkList; 
/*----³初始化¯-------*/  
  int   InitLinkList(LinkList   *L)  
  {  
          (*L)   =   (LinkList)malloc(sizeof(LNode));  
          (*L)->next   =   NULL;  
          return   OK;  
  }  
   
  /*-----½建立表´±í-------*/  
  int   CreateList(LinkList   *L,int   n)  
  {  
          /*建立n结点的表¸öÔªËØ*/  
          LinkList   p;  
          int   i;  
          (*L)   =   (LinkList)malloc(sizeof(LNode));  
          (*L)->next   =   NULL;  
		  printf("Input data in reverse:");
          for(i   =   n;i   >   0;--   i)  
          {  
                  p   =   (LinkList)malloc(sizeof(LNode));  
                  scanf_s("%c",&(p->data));  
                  p->next   =   (*L)->next;  
                  (*L)->next   =   p;  
          }  
          printf("Finished   create!/n");  
          return   OK;  
  }  
   
 /*------显示¾--------*/  
	int GetElem_L(LinkList L,int i)
	{
		char e;
		LinkList p = L->next;
		int j = 1;
		while (p && j < i)
		{
			p = p->next;
			++j;
		}
		if (!p || j<i) return ERROR;
		e = p->data;
		printf("The 3rd data:%c/n",e);
		return OK;
	}
	int ListInsert_L(LinkList &L,int i,char e)
	{
		LinkList p;
		p = L;
		int j =0;
		while(p && j < i-1)
		{
			p = p->next;
			++j;
		}
		if(!p || j > i-1) return ERROR;
		LinkList s = (LinkList) malloc (sizeof (LNode));
		s->data = e;
		s->next = p->next;
		p->next = s;
		return OK;
	}
	int ListDelete_L(LinkList &L,int i)
	{
		char e;
		LinkList p,q;
		p = L;
		int j = 0;
		while(p->data && j < i-1)
		{
			p = p->next;
			++j;
		}
		if(!(p->next) || j > i-1) return ERROR;
		q = p->next;  p->next = q->next;
		e = q->data;  free(q);
		return OK;
	}
	 /*------显示¾--------*/  
  void   ListDisplay(LinkList   L)  
  {  
          LinkList   p   =   L->next;  
          while(p)  
          {  
                  printf("data:%c/n",p->data);  
                  p   =   p->next;  
          }  
  }  
   int   ListDestroy(LinkList   *L)  
  {  
          LinkList   temp   =   *L;  
          do  
          {  
                  *L   =   temp;  
                  temp   =   (*L)->next;  
                  free(*L);  
          }while(temp);  
   
          printf("/nList   has   been   destroyed!/n");  
          return   OK;  
  }  
void main() 
{ 
LinkList Q = NULL; 
CreateList(&Q,6); 
GetElem_L(Q,3);
ListInsert_L(Q,2,'e');
ListDisplay(Q);
ListDelete_L(Q,2);
printf("After Delete the 3rd data:/n");
ListDisplay(Q);
ListDestroy(&Q);
}