单链表2-2

typedef struct LinkNose{
	char data;
	struct LinkNode *next;
} LNode, *LinkList, *NodePtr;

建立一个单链表

LinkList initLinkList(){
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
//在空间里找到一个地址，把这个地址赋值给L
	tempHeader->data = '\0';
	tempHeader->next = NULL;
	return tempHeader;
}// Of initLinkList

打印链表

void printList(NodePtr paraHeader) {
 NodePtr p = paraHeader->next;
 
 while (p != NULL) {
  printf("%c", p->data);
  p = p->next;
 }
 
 printf("\r\n");
}

插入

void appendElement(NodePtr paraHeader, char paraChar)
{
	//paraHeader 是链表的头节点
	//paraChar 是指定的元素 
	NodePtr p,q;
	q = (NodePtr)malloc(sizeof(LNode));
	q->data=paraChar;
	q->next=NULL;
	p=paraHeader;
	//搜索尾节点 
	while(p->next!=NULL)
	{
		p=p->next;
	}
	p->next=q;
	
} 

删除

void deleteElement(NodePtr paraHeader, char paraChar){
    NodePtr p, q;
    p = paraHeader;
    while((p->next != NULL) && (p->next->data != paraChar)){
        p = p->next;
    }
 
    if(p->next == NULL){
        printf("Cannot delete %c\r\n", paraChar);
        return;
    }
 
    q = p->next;
    p->next = p->next->next;
    free(q);
}

 指定插入

void insertElement(NodePtr paraHeader,char paraChar,int paraPosition) 
{
	NodePtr p,q;
	
	p=paraHeader;
	int i;
	for( i=0;i<paraPosition;i++)
	{
	  p=p->next;
	  if(p == NULL) 
	  {
	     printf("The position %d is beyond the scope of the list.",paraPosition);
	     return;
	  }
    }
    
    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;
    
    printf("linking\r\n");
    q->next = p->next;
    p->next = q;
 
}

完整代码

#include <stdio.h>
#include <stdlib.h>
 
typedef struct LinkNode{
	char data;
	struct LinkNode *next;
}LNode,*LinkList,*NodePtr;
 
LinkList initLinkList(){
	NodePtr tempHeader =(NodePtr)malloc(sizeof(LNode));
	tempHeader->data = '\0';
	tempHeader->next = NULL;
	return tempHeader;
}
 
void printList(NodePtr paraHeader)
{
	NodePtr p= paraHeader->next;
	while (p!=NULL)
	{
		printf("%c",p->data);
		p = p->next;
	}
	printf("\r\n");
}
 
 
 
void appendElement(NodePtr paraHeader,char paraChar)
{
	NodePtr p,q;
	
	q=(NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	q->next = NULL;
	
	p=paraHeader;
	while(p->next !=NULL)
	{
		p=p->next;
	}
	p->next=q;
}
 
void headElement(NodePtr paraHeader, char paraChar)
{
	NodePtr p,q;
	q = (NodePtr)malloc(sizeof(LNode));
	q->data=paraChar;
	
	p=paraHeader;
	q->next= p->next;
	p->next =q;
	
} 
 
 
void insertElement(NodePtr paraHeader,char paraChar,int paraPosition) 
{
	NodePtr p,q;
	
	p=paraHeader;
	int i;
	for( i=0;i<paraPosition;i++)
	{
	  p=p->next;
	  if(p == NULL) 
	  {
	     printf("The position %d is beyond the scope of the list.",paraPosition);
	     return;
	  }
    }
    
    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;
    
    printf("linking\r\n");
    q->next = p->next;
    p->next = q;
 
}
 
 
 
 
 
 
 
 
void deleteElement(NodePtr paraHeader,char paraChar) 
{
	NodePtr p,q;
	p = paraHeader;
	while((p->next !=NULL)&&(p->next->data != paraChar))
	{
		p = p->next;
	}
	
	if(p->next == NULL)
	{
		printf("Cannot delete %c\n",paraChar);
		return;
	}
	
	q = p->next;
	p->next = p->next->next;
	free(q);	     
}
 
 
void appendInsertDeleteTest(){
	LinkList tempList = initLinkList();
	printList(tempList);
	
	appendElement(tempList,'S');
	appendElement(tempList,'m');
	appendElement(tempList,'e');
	appendElement(tempList,'l');
	appendElement(tempList,'l');
    printList(tempList);
    printf("在头部插入一个字母A\n");
    headElement(tempList,'A');
    printList(tempList);
    printf("删去刚才的输入的\n");
    deleteElement(tempList,'A');
    printList(tempList);
    
    deleteElement(tempList,'m');
    deleteElement(tempList,'e');
    deleteElement(tempList,'l');
    printList(tempList);
    
    insertElement(tempList,'l',2);
     printList(tempList);
} 
 
int main()
{
	appendInsertDeleteTest();
}