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

typedef struct Node{
    int data;
    struct Node *next;
}Node,*List;
//创建链表
void Init(List *phead){
    *phead = NULL;
}
//获取表长
int GetLength(List head){
    int count = 0;
    Node *p;
    p = head;
    while(p){
        count++;
        p = p->next;
    }
    return count;
}
//创建节点
Node *CreatNode(int x){
    Node *t;
    t = (Node *)malloc(sizeof(Node));
    t->next = NULL;
    t->data = x;
    return t;
};
//输出链表
void Print(List head){
    while(head){
        printf("%d\n",head->data);
        head = head->next;
    }
}
//查找
Node *Find(List head, int k){
    Node *p;
    p = head;
    int count = 1;
    while(p && count < k){
        p = p->next;
        count++;
    }
    return p;
};
//插入
int Insert(List *phead, int k, int x){
    Node *p,*t;
    t = CreatNode(x);
    if(*phead){
        if(k <= 0)
            return -1;
        else if( k == 1){
            t->next = *phead;
            *phead = t;
            return 1;
        }
        else{
            p = Find(*phead,k-1);
            t->next = p->next;
            p->next = t;
            return 1;
        }
    }
    else{
        if(k == 1){
            *phead = t;
            return 1;
        }
        else
            return -1;
    }
}
//删除
int Delet(List *phead, int k ,int *px){
    Node *p,*t;
    p = *phead;
    if(p){
        if(k <= 0)
            return -1;
        else if(k == 1){
            *px = p->data;
            *phead = p->next;
            return 1;
        }
        else{
            p = Find(*phead,k-1);
            *px = p->next->data;
            t = p->next;
            p->next = t->next;
            free(t);
            return 1;
        }
    }
    else
        return -1;
}