链表的常用操作

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

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

/** Initialize your data structure here. */

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

/** 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) {
    if (index < 0 || index >= obj->val) {
        return -1;
    }

    while (index >= 0) {
        obj = obj->next;
        index--;
    }

    return obj->val;
}

/** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
void myLinkedListAddAtHead(MyLinkedList* obj, int val) {
    if (obj == NULL) {
        return;
    }

    obj->val++;
    MyLinkedList *temp = (MyLinkedList*)malloc(sizeof(MyLinkedList));
    temp->val = val;
    temp->next = obj->next;
    obj->next = temp;
}

/** Append a node of value val to the last element of the linked list. */
void myLinkedListAddAtTail(MyLinkedList* obj, int val) {
    if (obj == NULL) {
        return;
    }

    obj->val++;
    MyLinkedList *temp = (MyLinkedList*)malloc(sizeof(MyLinkedList));
    temp->next = NULL;
    temp->val = val;

    while (obj->next != NULL) {
        obj = obj->next;
    }

    obj->next = temp;
}

/** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
void myLinkedListAddAtIndex(MyLinkedList* obj, int index, int val) {
    if (obj == NULL || index < 0 || index > obj->val) {
        return;
    }

    if (index == obj->val) {
        myLinkedListAddAtTail(obj, val);
        return;
    }

    obj->val++;
    MyLinkedList *temp = (MyLinkedList*)malloc(sizeof(MyLinkedList));
    temp->val = val;
    temp->next = NULL;

    while (index > 0) {
        obj = obj->next;
        index--;
    }

    temp->next = obj->next;
    obj->next = temp;
}

/** Delete the index-th node in the linked list, if the index is valid. */
void myLinkedListDeleteAtIndex(MyLinkedList* obj, int index) {
    if (obj == NULL || obj->val == 0 || index < 0 || index + 1 > obj->val) {
        return;
    }

    obj->val--;
    while (index > 0) {
        obj = obj->next;
        index--;
    }

    MyLinkedList *temp = obj->next;
    obj->next = temp->next;
    free(temp);
}

void myLinkedListFree(MyLinkedList* obj) {
    if (obj->next == NULL) {
        free(obj);
        return;
    }

    myLinkedListFree(obj->next);
    obj->next = NULL;
    myLinkedListFree(obj);
}

/**
 * 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);
*/

void show(MyLinkedList *obj)
{
    while (obj != NULL) {
        printf("%d ", obj->val);
        obj = obj->next;
    }
    printf("
");
}

int main()
{
    MyLinkedList *obj = NULL;
    obj = myLinkedListCreate();
    myLinkedListAddAtHead(obj, 1);
    show(obj);
    myLinkedListAddAtTail(obj, 2);
    show(obj);
    myLinkedListAddAtIndex(obj, 0, 3);
    show(obj);
    myLinkedListAddAtIndex(obj, 2, 4);
    show(obj);
    myLinkedListDeleteAtIndex(obj, 0);
    show(obj);
    myLinkedListDeleteAtIndex(obj, 2);
    show(obj);
//    myLinkedListFree(obj);

    return 0;
}

题目来源：LeetCode707