链表-707.设计链表

. - 力扣（LeetCode）

题意：

在链表类中实现这些功能：

• get(index)：获取链表中第 index 个节点的值。如果索引无效，则返回-1。
• addAtHead(val)：在链表的第一个元素之前添加一个值为 val 的节点。插入后，新节点将成为链表的第一个节点。
• addAtTail(val)：将值为 val 的节点追加到链表的最后一个元素。
• addAtIndex(index,val)：在链表中的第 index 个节点之前添加值为 val  的节点。如果 index 等于链表的长度，则该节点将附加到链表的末尾。如果 index 大于链表长度，则不会插入节点。如果index小于0，则在头部插入节点。
• deleteAtIndex(index)：如果索引 index 有效，则删除链表中的第 index 个节点。

typedef struct MyLinkedList {
    int val;
    struct MyLinkedList  *next;
} MyLinkedList;

/** Initialize your data structure here. */

MyLinkedList* myLinkedListCreate() {
    MyLinkedList *head = malloc(sizeof(MyLinkedList));
    head->next = NULL;
    return head;
}

/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
int myLinkedListGet(MyLinkedList* obj, int index) {
    MyLinkedList *cur = obj->next;

    int idx = 0;
    while(cur != NULL) {
        if (idx == index) {
            return cur->val;
        }
        idx++;
        cur = cur->next;
    }

    return -1;
}

void myLinkedListAddAtHead(MyLinkedList* obj, int val) {
    MyLinkedList *nhead = malloc(sizeof(MyLinkedList));
    nhead->val = val;
    
    nhead->next = obj->next;
    obj->next = nhead;
}

void myLinkedListAddAtTail(MyLinkedList* obj, int val) {


    MyLinkedList *cur = obj;
    while (cur->next != NULL) {
        cur = cur->next;
    }
    MyLinkedList *ntail = malloc(sizeof(MyLinkedList));
    ntail->val = val;
    ntail->next = NULL;
    cur->next = ntail;

    return;
}


void myLinkedListAddAtIndex(MyLinkedList* obj, int index, int val) {
    int idx = 0;
    if (index == idx) {
        myLinkedListAddAtHead(obj, val);
        return;
    }


    idx++;
    MyLinkedList *next = NULL;
    MyLinkedList *cur = obj->next;
    while(cur != NULL) {
        if (idx == index) {
            MyLinkedList *new = malloc(sizeof(MyLinkedList));
            new->val = val;
            new->next = cur->next;
            cur->next = new;
            return;
        }
        idx++;
        cur = cur->next;
    }

    return;


}

void myLinkedListDeleteAtIndex(MyLinkedList* obj, int index) {
    if (index == 0){
        MyLinkedList *tmp = obj->next;
        if (tmp != NULL){
            obj->next = tmp->next;
            free(tmp);     
        }
        return;
    }
    MyLinkedList *cur = obj->next;
    for (int i = 1 ;cur != NULL && cur->next != NULL; i++){
        if (i == index){
            MyLinkedList *tmp = cur->next;
            if (tmp != NULL) {
                cur->next = tmp->next;
                free(tmp);
            }
            return;
        }
        else{
            cur = cur->next;
        }
    }
    
    /*
    MyLinkedList *cur = obj->next;
    if (cur == NULL) {
        return;
    }
    if (index == 0) {
        obj->next = cur->next;
        return;
    }

    int idx = 1;
    while (cur->next != NULL) {
        if (idx == index) {
            //ÕÒµ½index
            cur->next = cur->next->next;
            return;
        }
        idx++;
        cur = cur->next;
    }
    */
}

void myLinkedListFree(MyLinkedList* obj) {
    MyLinkedList *cur = NULL;
    while (obj != NULL) {
        cur = obj;
        obj = obj->next;
        free(cur);
        cur = NULL;
    }
}

/**
 * Your MyLinkedList struct will be instantiated and called as such:
 * MyLinkedList* obj = myLinkedListCreate();
 * int param_1 = myLinkedListGet(obj, index);
 
 * myLinkedListAddAtHead(obj, val);
 
 * myLinkedListAddAtTail(obj, val);
 
 * myLinkedListAddAtIndex(obj, index, val);
 
 * myLinkedListDeleteAtIndex(obj, index);
 
 * myLinkedListFree(obj);
*/