单链表操作

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

typedef struct node
{
    int data;
    struct node *next;
} list_node ,*link_list;


//link_list head; //头指针

link_list create_list(void);

void show_list(link_list head);

void insert_node_list(link_list head,int temp,int position);

void delete_node_list(link_list head,int position);

int list_len(list_node *head);

int main(int argc,int *argv[])
{
    link_list head;

    int len;

    head = create_list();

    show_list(head);

   // insert_node_list(head,10,3);

   // delete_node_list(head,3);

    len = list_len(head);

    printf("len is%d\n",len);

   // show_list(head);

    return 0;
}

link_list create_list(void)
{
    list_node *p,*s; //节点指针
    link_list head;

    head = (list_node *)malloc(sizeof(list_node));
    int temp;
    p = head;

    scanf("%d",&temp);

    while(temp!=0)
    {
        s = (list_node *)malloc(sizeof(list_node));
        s->data = temp;
        p->next = s;
        p = s;
        scanf("%d",&temp);
    }
    head = head->next;
    p->next = NULL;
    return head;
}

void show_list(link_list head)
{
    link_list p;
    p = head;

    while(p != NULL)
    {
        printf("%d\t",p->data);
        p = p->next;
    }
    putchar('\n');
}

void insert_node_list(link_list head,int temp,int position)
{
    int i,j;
    link_list p,s;

    i = 0;
    p = head;

    while(p&& i<position)
    {
        p = p->next;
        i++;
    }
    if(p==NULL)
        printf("error position\n");
    else
    {
        s = (list_node *)malloc(sizeof(list_node));
        s->data = temp;
        s->next = p->next;
        p->next = s;
    }
}


void delete_node_list(link_list head,int position)
{
    int i,j;
    link_list p,q;

    i = 0;
    p = head;

    while(p!=NULL&& i<position)
    {
        p = p->next;
        i++;
    }
    if(p->next==NULL)
        printf("error position\n");
    else
    {
        q = (list_node *)malloc(sizeof(list_node));
        q = p->next;
        p->next = q->next;
        free(q);
        printf("delete ok\n");
    }
}



int list_len(list_node *head)
{
    int len = 0;
    list_node *p;
    p = head;

    while(p != NULL)
    {
        p = p->next;
        len++;
    }
    return (len);
}


void remove_head(list_node *head)
{
    list_node *p;

    p = head->next;
    head->next = p->next;

    free(p);
}