Day03

day03

1.虚拟头节点，节点定义需要new

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        
        ListNode* p;
        ListNode* fakehead=new ListNode(0);
        fakehead->next=head;
        p=fakehead;
        while(p->next!=nullptr){
            
            if(p->next->val==val){
                ListNode* k=p->next;
                p->next=p->next->next;
                delete k;
            }else p=p->next;
        }
        head=fakehead->next;
        delete fakehead;
        return head;
    }
};

2.设计链表

class MyLinkedList {
public:

    struct LinkedNode{
        int val;
        LinkedNode* next;
        LinkedNode(int val):val(val),next(nullptr){}
    };

    MyLinkedList() {
       _dummyhead=new LinkedNode(0);
       _size=0;

    }
    
    int get(int index) {
        if(index>(_size-1) || index<0){
            return -1;
        }
        LinkedNode* cur=_dummyhead->next;
        while(index--){
            cur=cur->next;
        }
        return cur->val;
    }
    
    void addAtHead(int val) {
        LinkedNode* newNode=new LinkedNode(val);
        newNode->next=_dummyhead->next;
        _dummyhead->next=newNode;
        _size++;
    }
    
    void addAtTail(int val) {
        LinkedNode* newNode=new LinkedNode(val);
        LinkedNode* cur=_dummyhead;
        while(cur->next!=nullptr){
            cur=cur->next;
        }
        cur->next=newNode;
        _size++;
    }
    
    void addAtIndex(int index, int val) {
        if(index>_size) return;
        if(index<0) index=0;
        LinkedNode* newNode=new LinkedNode(val);
        LinkedNode* cur=_dummyhead;
        while(index--){
            cur=cur->next;
        }
        newNode->next=cur->next;
        cur->next=newNode;
        _size++;
    }
    
    void deleteAtIndex(int index) {
         if(index>(_size-1) || index<0){
            return;
        }
    LinkedNode* cur=_dummyhead;
    while(index--){
        cur=cur->next;
    }
    LinkedNode* tmp=cur->next;
    cur->next=cur->next->next;
    delete tmp;

    tmp=nullptr;
    _size--;

    }

    void printLinkedList(){
        LinkedNode* cur =_dummyhead;
        while(cur->next!=nullptr){
            cout<<cur->next->val<<" ";
            cur=cur->next;
        }
        cout<<endl;
    }

private:
    int _size;
    LinkedNode* _dummyhead;
};

/**
 * Your MyLinkedList object will be instantiated and called as such:
 * MyLinkedList* obj = new MyLinkedList();
 * int param_1 = obj->get(index);
 * obj->addAtHead(val);
 * obj->addAtTail(val);
 * obj->addAtIndex(index,val);
 * obj->deleteAtIndex(index);
 */

3.反转

/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode() : val(0), next(nullptr) {}
*     ListNode(int x) : val(x), next(nullptr) {}
*     ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
   ListNode* reverseList(ListNode* head) {
       ListNode* tmp;
       ListNode* cur=head;
       ListNode* pre=NULL;
   
       while(cur!=nullptr){
           tmp=cur->next;
           cur->next=pre;
           pre=cur;
           cur=tmp;
       
                   }
      return pre;
   }
};