打卡 707.设计链表 熟悉链表的基本操作

如果产生Line 38: Char 14: runtime error: member access within null pointer of type ‘struct MyLinkedList’ [solution.c]这样的报错，就是编译器不能判断我们循环中的值是否为空指针。
下面是csdn截的图原文地址

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


MyLinkedList* myLinkedListCreate() {
    MyLinkedList*head = (MyLinkedList*)malloc(sizeof(MyLinkedList));
    head->next = NULL;
    return head;
}
//获取下标为index的值,如果下标无效则返回 -1
int myLinkedListGet(MyLinkedList* obj, int index) {
    MyLinkedList* cur = obj->next;    //cur指向头指针
    for(int i = 0;cur != NULL;i++){    
        if(i == index)
            return cur->val;
            else 
            cur = cur->next;
    }
    return -1;   
}
//创建新的头结点
void myLinkedListAddAtHead(MyLinkedList* obj, int val) {
    MyLinkedList* nhead = (MyLinkedList*)malloc(sizeof(MyLinkedList));
    nhead->val = val;
    nhead->next = obj->next;
    obj->next = nhead;
}
//在链表尾部插入
void myLinkedListAddAtTail(MyLinkedList* obj, int val) {
    MyLinkedList* ntail = (MyLinkedList*)malloc(sizeof(MyLinkedList));
    ntail->val = val;
    MyLinkedList* cur = obj;
    while(cur->next != NULL){   //此处判断如果用cur ！= NULL，则cur继续指向下一位，最终cur指向NULL
        cur = cur->next;
    }
    cur->next = ntail;
    ntail->next = NULL;
}

void myLinkedListAddAtIndex(MyLinkedList* obj, int index, int val) {
    if(index == 0){
        myLinkedListAddAtHead(obj,val);
        return;
    }
    MyLinkedList* cur = obj->next;   //cur指向头结点 
    MyLinkedList* nindex = (MyLinkedList*)malloc(sizeof(MyLinkedList));
    nindex->val = val;
    for(int i = 1;cur != NULL;i++){  //因为要插入到下标为index的节点之前，所以i=1
        if(i == index){
            nindex->next = cur->next;  //举个例子：设index=3.此时cur指向下标为2
            cur->next = nindex;
        }else
        cur = cur->next;
    }
}

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; //cur指向头结点
    for(int i = 1;cur != NULL && cur->next != NULL;i++){  //限制条件cur->next ！= NULL,避免cur指向NULL
        if(i == index){
        MyLinkedList* tmp = cur->next;   //使cur->next为要处理的节点
        if(tmp != NULL){
            cur->next = tmp->next;
            free(tmp);
        }
        
        }else
            cur = cur->next;

    }

}

void myLinkedListFree(MyLinkedList* obj) {

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

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