线性链表的代码实现

总结了一下线性链表的实现方式，贴在了博客里，欢迎大家批阅指正。

#include "stdio.h"
#include "stdlib.h"

#define LIST_OK    0
#define LIST_ERROR 1

typedef unsigned int UINT32;
typedef int ElemType;


typedef struct LNode{
    ElemType _data;
    struct LNode *next;
}LNode,*LinkList;
void print_list(LNode *link_list);

UINT32 create_reverse_list(LNode** link_list, UINT32 list_size){
    *link_list = (LNode*)malloc(sizeof(LNode));
    (*link_list)->next = NULL;
    UINT32 i=0;
    printf("Will create %d size link list...
",list_size);
    for(i=0; i< list_size; i++){
        LinkList p = (LNode*)malloc(sizeof(LNode));
        p->next = NULL;
        p->next = (*link_list)->next;
        printf("Please input %d th data:",i+1);
        ElemType data;
        scanf("%d",&data);
        p->_data = data;
        (*link_list)->next = p;
    }
    printf("Create list success!!!
");
    print_list(*link_list);
    return LIST_OK;
}
UINT32 create_order_list(LNode** link_list, UINT32 list_size){
    *link_list = (LNode*)malloc(sizeof(LNode));
    (*link_list)->next = NULL;
    LNode* last_node = (*link_list);
    UINT32 i=0;
    printf("Will create %d size link list...
",list_size);
    for(i=0; i< list_size; i++){
        LinkList p = (LNode*)malloc(sizeof(LNode));
        p->next = NULL;
        printf("Please input %d th data:",i+1);
        ElemType data;
        scanf("%d",&data);
        p->_data = data;
        last_node->next = p;
        last_node = p;
    }
    printf("Create list success!!!
");
    print_list(*link_list);
    return LIST_OK;
}

UINT32 destory_list(LNode** link_list){
    while((*link_list)->next){
        LNode* p = (*link_list)->next;
        (*link_list)->next = p->next;
        printf("free data:%d
",p->_data);
        free(p);
    }
    free(*link_list);
    *link_list = NULL;
    return LIST_OK;
}
LNode* locate_list(LNode* link_list, UINT32 i){
    LNode* p = link_list->next;
    UINT32 j = 1;
    while(p && j<i){
        p = p->next; j++;
    } 
    return p;
}
void print_list(LNode* link_list){
    if(NULL == link_list){
        printf("Link list is empty
");
        return;
    }
    LNode* p = link_list->next;
    UINT32 i = 1;
    while(p){
       printf("%-6d %d
",i,p->_data);
       p = p->next;
       i++;
    }
}

int main(){
    printf("Please input the size of creating list:");
    UINT32 size;
    scanf("%d",&size);
    LNode* link_list = NULL;
    printf("address %p
",link_list);
    create_order_list(&link_list, size);
    printf("address %p after creating
",link_list);
    print_list(link_list);
    UINT32 locate_num;
    printf("Please input locate number which you want:");
    scanf("%d",&locate_num);
    LNode* tmp_node = locate_list(link_list, locate_num);
    if(tmp_node){
        printf("Locating data is %d
", tmp_node->_data);
    }else{
        printf("Locating data not found!
");
    }
    destory_list(&link_list);
    printf("address %p after destory
",link_list);
    print_list(link_list);
    return 0;
}

程序的执行结果如下：

Please input the size of creating list:3
address (nil)
Will create 3 size link list...
Please input 1 th data:5
Please input 2 th data:6
Please input 3 th data:7
Create list success!!!
1      5
2      6
3      7
address 0x1eea010 after creating
1      5
2      6
3      7
Please input locate number which you want:2
Locating data is 6
free data:5
free data:6
free data:7
address (nil) after destory
Link list is empty

欢迎大家提出问题，一起交流