代码随想录算法训练营第三天 203.移除链表元素 707.设计链表 206.反转链表

203.移除链表元素

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        //整一个虚拟头结点,最后只需要返回dummyHead->next即可
        struct ListNode* dummyHead=(struct ListNode*)malloc(sizeof(ListNode));
        dummyHead->next=head;
        struct ListNode* p=dummyHead;
        while(p->next!=NULL){        
            //注意删除的结点的时候就不需要后移了
            if(p->next->val==val){

                struct ListNode* temp=p->next;
                p->next=p->next->next;
                delete temp;
            }else{
                p=p->next;
            }      
        }
        return dummyHead->next;
    }
};

707.设计链表

注意一下细节

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

/** Initialize your data structure here. */

MyLinkedList* myLinkedListCreate() {
    //这个题必须用虚拟头指针,参数都是一级指针,头节点确定后没法改指向了!!!
    MyLinkedList* head = (MyLinkedList *)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;
    for (int i = 0; cur != NULL; i++){
        if (i == index){
            return cur->val;
        }
        else{
            cur = cur->next;
        }
    }
    return -1;
}

/** 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) {
    MyLinkedList *nhead = (MyLinkedList *)malloc(sizeof (MyLinkedList));
    nhead->val = val;
    nhead->next = obj->next;
    obj->next = nhead;

}

/** Append a node of value val to the last element of the linked list. */
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;
}

/** 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 (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;
        }
    }
}

/** Delete the index-th node in the linked list, if the index is valid. */
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);
    }
}

206.反转链表

自己写的是用尾插法,看了思路还有更省空间的双指针法
双指针法只需要改成倒着读就行了

头插法

ListNode* reverseList(ListNode* head) {
        struct ListNode* dummyHead1=(struct ListNode*)malloc(sizeof(struct ListNode));
        //新的头插链表
        struct ListNode* dummyHead2=(struct ListNode*)malloc(sizeof(struct ListNode));
        dummyHead1->next=head;
        dummyHead2->next=NULL;
        //思路是从第一个结点开始逐个删除结点,头插到第二个链表上面
        struct ListNode* p=dummyHead1;
        struct ListNode* temp;
        while(p->next){
            temp=p->next;
            p->next=p->next->next;
            insertByHead(dummyHead2,temp);
        }
        return dummyHead2->next;
    }
    void insertByHead(ListNode* dummyHead,ListNode* node){
        node->next=dummyHead->next;
        dummyHead->next=node;
        return;
    }

双指针

ListNode* reverseList(ListNode* head) {
        ListNode* pre=NULL;
        ListNode* current=head;
        ListNode* temp=NULL;

        while(current){
            temp=current->next;
            current->next=pre;
            pre=current;
            current=temp;


        }
        return pre;
      
    }