第三天加油

1. 力扣203题-移除链表元素

设置虚拟头节点

分析：设置一个虚拟头结点，这样原链表的所有节点就都可以按照统一的方式进行移除了。

struct ListNode* removeElements(struct ListNode* head, int val) {
    typedef struct ListNode ListNode;
    ListNode *shead;
    shead = (ListNode *) malloc (sizeof(ListNode));
    shead->next = head;
    ListNode *cur = shead;
    while(cur ->next != NULL)
    {
            if(cur->next->val == val)
            {
                ListNode *tmp = cur->next;
                cur->next = cur->next->next;
                free(tmp);
            }
            else
            {
                cur = cur->next;
            }
           
    } 
    head = shead->next;
    free(shead);
    return head;
}

2. 力扣707题-设计链表

分析：使用虚拟头节点，做的很累，收获很多。

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


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

int myLinkedListGet(MyLinkedList* obj, int index) {
    MyLinkedList *cur = obj->next;
    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 *cur = obj;
        while(cur->next != NULL)
        {
            cur = cur->next;
        }
        MyLinkedList *ntail = (MyLinkedList *) malloc (sizeof(MyLinkedList));
        ntail->val = val;
        ntail->next = NULL;
        cur->next = ntail;
}

void myLinkedListAddAtIndex(MyLinkedList* obj, int index, int val) {
    if(index == 0)
    {
        myLinkedListAddAtHead(obj,val);
        return;
    }
    MyLinkedList *cur = obj->next;
    for(int i = 1; cur != NULL; i++)
    {
        if(i == index)
        {
            MyLinkedList* newnode = (MyLinkedList *)malloc(sizeof (MyLinkedList));
            newnode->val = val;
            newnode->next = cur->next;
            cur->next = newnode;
            return;
        }
        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;
    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;
        }
    }
}

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

3.力扣206题-反转链表

 双指针法
分析：定义一个cur指针，指向头结点，再定义一个pre指针，初始化为null。首先将cur->next 节点用tmp指针保存一下。然后改变 cur->next 的指向，将cur->next 指向pre 然后继续移动pre和cur指针。
最后，cur 指针已经指向了null，循环结束，链表也反转完毕了。 此时我们return pre指针就可以了，pre指针就指向了新的头结点。

struct ListNode* reverseList(struct ListNode* head) {
    struct ListNode *temp;
    struct ListNode *cur = head;
    struct ListNode *pre = NULL;
    while(cur)
    {
        temp = cur->next;
        cur->next = pre;
        pre = cur;
        cur = temp;
    }
    return pre;
}