[力扣笔记]707.设计链表

这道题覆盖了链表的常见操作，对理解链表相关的知识有很大的帮助。
题目只给了几个函数，为了方便测试，我自己写了main函数的内容，完整代码如下。

值得注意的是，在涉及链表的“索引”时，我是引入一个标记flag，每次循环+1并让指针移到下一个节点。在参考了《代码随想录》后发现其实直接用while(index–)就行了，这在删除操作中由为方便（直接定位到第index个节点的前一个节点）。

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

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

MyLinkedList* myLinkedListCreate();
int myLinkedListGet(MyLinkedList* obj, int index);
void myLinkedListAddAtHead(MyLinkedList* obj, int val);
void myLinkedListAddAtTail(MyLinkedList* obj, int val);
void myLinkedListAddAtIndex(MyLinkedList* obj, int index, int val);
void myLinkedListDeleteAtIndex(MyLinkedList* obj, int index);
void myLinkedListFree(MyLinkedList* obj);
void myLinkedListPrint(MyLinkedList* obj);


int main() {
    char c = 'y';
    MyLinkedList* head = (MyLinkedList*)malloc(sizeof(MyLinkedList));
    head = NULL;
    while (c == 'y') {

        char s[1000] = "\0";
        int i = 0;
        scanf("%s",s);
        
        if (strcmp(s,"create") == 0) {
            head = myLinkedListCreate();
            printf("%d",head->val);
        }

        if (strcmp(s,"addhead") == 0) {
            printf("\n头插什么？");
            int val;
            scanf("%d",&val);
            myLinkedListAddAtHead(head,val);
        }

        if (strcmp(s,"get") == 0) {
            printf("\n获取哪个节点的值？");
            int index;
            scanf("%d",&index);
            int temp;
            temp = myLinkedListGet(head,index);
            printf("%d\n",temp);
        }

        if (strcmp(s,"addtail") == 0) {
            printf("\n尾插什么？");
            int val;
            scanf("%d",&val);
            myLinkedListAddAtTail(head,val);
        }

        if (strcmp(s,"delete") == 0) {
            printf("\n删哪个节点？");
            int index;
            scanf("%d",&index);
            myLinkedListDeleteAtIndex(head,index);
        }

        if (strcmp(s,"addindex") == 0) {
            printf("\n在哪个节点前增加什么？");
            int val;
            int index;
            scanf("%d",&index);
            scanf(" %d",&val);
            myLinkedListAddAtIndex(head,index,val);
        }

        myLinkedListPrint(head);

        printf("\n是否继续？");
        scanf(" %c",&c);

    }
    myLinkedListFree(head);
    return 0;
}

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

int myLinkedListGet(MyLinkedList* obj, int index) {
    if (index >= 0) {
        MyLinkedList* s = (MyLinkedList*)malloc(sizeof(MyLinkedList));
        s = obj->next;
        int i = 0;
        while (s) {
            if (i == index) {
                return s->val;
            }
            else {
                s = s->next;
                i++;
            }
        }
        return -1;
    }
    return -1;
}

void myLinkedListAddAtHead(MyLinkedList* obj, int val) {
    MyLinkedList* p = malloc(sizeof(MyLinkedList));

    p->val = val;
    p->next = obj->next;
    obj->next = p;
}

void myLinkedListAddAtTail(MyLinkedList* obj, int val) {
    MyLinkedList* p = malloc(sizeof(MyLinkedList));
    MyLinkedList* s = malloc(sizeof(MyLinkedList));
    s->val = val;
    s->next = NULL;
    p = obj;
    while (p->next) {
        p = p->next;
    }
    p->next = s;
}

void myLinkedListAddAtIndex(MyLinkedList* obj, int index, int val) {
    if (index < 0) {
        myLinkedListAddAtHead(obj,val);
    }
    else {
        MyLinkedList* p = malloc(sizeof(MyLinkedList));
        p = obj;
        MyLinkedList* s = malloc(sizeof(MyLinkedList));
        s = p->next;
        int flag = 0;
        while (s) {
            if (flag == index) {
                MyLinkedList* pt = malloc(sizeof(MyLinkedList));
                pt->val = val;
                pt->next = s;
                p->next = pt;
                flag = -1;
                break;
            }
            else {
                s = s->next;
                p = p->next;
                flag++;
            }
        }
        if (index == flag) {
            myLinkedListAddAtTail(obj,val);
        }
    }
}

void myLinkedListDeleteAtIndex(MyLinkedList* obj, int index) {
    if (index >= 0) {
        MyLinkedList* p = malloc(sizeof(MyLinkedList));
        p = obj;
        MyLinkedList* s = malloc(sizeof(MyLinkedList));
        s = p->next;
        int flag = 0;
        while (s) {
            if (flag == index) {
                MyLinkedList* pt = malloc(sizeof(MyLinkedList));
                pt = s->next;
                p->next = pt;
                free(s);
                break;
            }
            else {
                s = s->next;
                p = p->next;
                flag++;
            }
        }
    }
}

void myLinkedListFree(MyLinkedList* obj) {
    MyLinkedList* p = malloc(sizeof(MyLinkedList));
    p = obj->next;
    MyLinkedList* s = malloc(sizeof(MyLinkedList));
    while (p) {
        obj->next = p->next;
        s = p;
        p = p->next;
        free(s);
    }
    free(obj);
}

void myLinkedListPrint(MyLinkedList* obj) {
    MyLinkedList* p = malloc(sizeof(MyLinkedList));
    p = obj->next;
    while (p) {
        printf("%d",p->val);
        if(p->next!=NULL) {
            printf("->");
        }
        else {
            printf("\n");
        }
        p = p->next;
    }
}