C语言 实现单链表基本功能

#ifndef __NODE_H__
#define __NODE_H__
#include<stdlib.h>
#include <stdio.h>
struct linkNode{
    int data;
    struct linkNode * next;
};
struct linkHead{
    int length;
    short isEmpty;
    short isFull;
    int Maxlength;
    struct linkNode * next;
};
typedef struct linkNode* p2Node;
typedef struct linkHead* p2Head;
typedef struct linkHead Head; 

extern p2Head createLinkHead();　　　　
extern void createLinkNodeByHead(p2Head head,int data);
extern void createLinkNodeByTail(p2Head head,int data);
extern p2Node getElement(p2Head head,int index);
extern int insertList(p2Head head,int position,int data);
extern int removeElement(p2Head head,int position);
extern int isEmpty(p2Head head);
extern int isFull(p2Head head);
extern int getLength(p2Head head);
extern void setMaxContains(p2Head head,int length);
#endif

这里定义了一个头文件，包含结构体的声明和函数的声明！该头文件叫做node.h

下面的node.c引入了该头文件，对上面的函数做了具体的实现！

#include"node.h"

p2Head createLinkHead()
{
    p2Head head;
    head= (p2Head)calloc(1,sizeof(Head));
    if(NULL == head)
    {
        printf("error calloc error!\n");return ;
    }
    head->next=NULL;
    head->length=0;
    head->isEmpty=1;
    head->isFull=0;
    return head;
}
//头插式插入链表 
 void createLinkNodeByHead(p2Head head,int data)
{    
     if(1 == isFull(head))    
    {
        return ;
    }
    p2Node node;
    node=(p2Node)calloc(1,sizeof(struct linkNode));
    if(NULL == node)
    {
        printf("error calloc error!\n");return ;
    }
    node->data=data;
    
    node->next=head->next;
    head->next=node;
    head->isEmpty=0;
    head->length++;
}

void createLinkNodeByTail(p2Head head,int data)
{    
    if(1==isFull(head))
    {
        return ;
    }
    p2Node node;
    p2Node p=head->next,r;
    node=(p2Node)calloc(1,sizeof(struct linkNode));
    if(NULL == node)
    {
        printf("error calloc error!\n");return ;
    }
    if(p == NULL)        //若出创建的是第一个节点，让head连接它 
    {
        head->next=node;
        node->next=NULL;
        node->data=data;
        head->length++;
        head->isEmpty=0;
        return ;
    }
    while(p != NULL)
    {    r=p;    //保存p的前一次值； 
        p=p->next;
        
    }
    r->next=node;
    node->next=NULL;
    node->data=data;
    head->isEmpty=0;
    head->length++;
}
 p2Node getElement(p2Head head,int index)    //获得第n个真正节点 
{    
    int k=1;
     if(head == NULL || index > head->length)
    {
        printf("error could not get! ");
        return ;
    }
    p2Node p=head->next;//p指向第一个节点 
    while(k<index)
    {
        p=p->next;
        k++;
    }
    return p; 
}
 int insertList(p2Head head,int position,int data)
{    
    int k=1;
    p2Node p=head->next;
    if(1==isFull(head))
    {
        return -1;
    }
    p2Node node=(p2Node)calloc(1,sizeof(struct linkNode ));
    if(NULL == node)
    {
        printf("error calloc fault!\n");
        return  -1;
    }
    node->data=data;
    //插入头部（第一个位置）
    if(position == 1)
    {
        node->next=head->next;
        head->next=node;
        head->length++;
        return 1;
    }//插入链表中间部位 
    else if(position<=head->length){
        while(k<position-1)
        {
            p=p->next;
            k++;
        }
        node->next=p->next;
        p->next=node;
        head->length++;
        return 1;
    }//插进尾部 
    else{
        while(p->next!=NULL)
        {
            p=p->next;
        } 
        node->next=p->next;
        p->next=node;
        head->length++;
        return 1;
    }
    

}
int removeElement(p2Head head,int position)
{
    p2Node p=head->next,r;
    if(head== NULL || position >head->length || position<=0)
    {
        printf("error could not delete!\n");
        return -1;
    }
    if(position==1)
    {    
    
        head->next=p->next;
        head->length--;
        return 1;
    }
    //若是删除链表中间元素 
    else if(position < head->length)
    {
        int k=1;
        while(k<position-1)
        {
            p=p->next;
            k++;
        }
        r=p->next;
        p->next=r->next;
        free(r);
        head->length--;
        return 1;
    }
    else//删除尾部 
    {    
        p2Node r;
        while(p->next!= NULL)
        {
            r=p;
            p=p->next;
        }
        r->next=NULL;
        free(p);
        head->length--;
        return 1;
    }
    
}

 int isEmpty(p2Head head)
{    
     if(head->length==0)
    {
        return 1;    
    }
    else{
        return 0;
    }
    
}
 int isFull(p2Head head)
{
    if(head->length>=head->Maxlength)
    {
        return 1;
    }
    else{
        return 0;
    }
}
 int getLength(p2Head head)
{
    return head->length;
}
220 void setMaxContains(p2Head head,int length)    //选择设置链表的最大长度 
{
    head->Maxlength= length;
}

具体使用：

1.设置该链表的最大长度

2.创建头结点

3.以头插式或尾插方式创建链表真正数据节点

4.指行插，删，查，操作！

#include <stdlib.h>
#include"node.h"

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char *argv[]) {
    p2Head head= createLinkHead();
    setMaxContains(head,10);
    createLinkNodeByTail( head,1);
    createLinkNodeByTail( head,2);
    createLinkNodeByTail( head,3);
    createLinkNodeByTail( head,4);
    createLinkNodeByTail( head,5);
    printf("%d\n",head->length);
    insertList(head,6,10);
    removeElement(head,6);
    p2Node node=getElement(head,5);
    
    printf("%d\t%d\t",head->length,head->isEmpty);
    return 0;
}