链表相关操作汇总

摘要：链表初始化、加入节点、删除节点、遍历、反转等。

代码：

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

#define OK 1
#define Error 0

typedef struct Node
{
    int data;
    struct Node* next;
}Node;

typedef struct Node* LinkList;

int InitList(LinkList *L)
{
    *L=(LinkList)malloc(sizeof(Node)); /* 产生头结点,并使L指向此头结点 */
    if(!(*L)) /* 存储分配失败 */
            return Error;
    (*L)->next=NULL; /* 指针域为空 */

    return OK;
}

int insert_list(LinkList* link_list,int count,int *parament)
{
    int j=1;
    LinkList p,insert_node;
    p = *link_list;
    while(j<count && p)
    {
        p = p->next;
        ++j;
    }
    if (j>count || !p)
        return Error;

    insert_node = (LinkList)malloc(sizeof(Node));
    insert_node->next = p->next;
    insert_node->data = *parament;
    p->next = insert_node;
    return OK;
}

int delete_list(LinkList* link_list,int count)
{
    LinkList p ,q;
    p = * link_list;

    int j = 1;
    while(j<count && p)
    {
        p = p->next;
        ++j;
    }
    if (j>count || !p)
        return Error;
    q = p->next;
    p->next = q->next;
    printf("--delete = %d\n",q->data);
    return OK;
}

int trave_list(LinkList link_list)
{
    int i=0;
    LinkList p = link_list->next;
    while (p)
    {
        ++i;
        printf("element %d = %d\n",i,p->data);
        p = p->next;
    }
    return OK;
}
int get_element(LinkList link_list,int count,int *parament)
{
    int i=1;
    if (count < i)
        return Error;
    LinkList p = link_list->next;
    while (p && i<count)
    {
        printf("element %d = %d\n",i,p->data);
        p = p->next;
        i++;
    }
    *parament = p->data;
    return OK;
}

int reverse_list(LinkList* old_list,LinkList* new_list)
{
    if (old_list==NULL || new_list == NULL)
        return Error;
    LinkList list = (*old_list)->next;
    while (list)
    {
        insert_list(new_list,1,&list->data);
        list = list->next;
    }
    return OK;
}

void main()
{
    printf("hello world!\n");
    LinkList my_linklist;
    LinkList rev_list;

    memset(&my_linklist,0,sizeof(my_linklist));
    memset(&rev_list,0,sizeof(rev_list));

    InitList(&my_linklist);
    InitList(&rev_list);

    int i;
    for(i=0;i<10;i++)
    {
        insert_list(&my_linklist,1,&i);
    }
    trave_list(my_linklist);

    int get_num;
    get_element(my_linklist,1,&get_num);
    printf("get_num = %d\n",get_num);
    delete_list(&my_linklist,1);
    printf("after delete----\n");
    trave_list(my_linklist);

    printf("after reverse---\n");
    reverse_list(&my_linklist,&rev_list);
    trave_list(rev_list);
}