链表的删除

//链表的删除并不是把这个节点干掉 而是在遍历的过程中把这个点跳过去

#include <iostream>

using namespace std;

struct Node{
    int val;
    Node* next;
    
    Node(int _val) : val(_val), next(NULL){};
};

int main(){
    Node* p = new Node(1);
    Node* q = new Node(2);
    Node* o = new Node(3);
    
    p->next = q;
    q->next = o;
    
    Node* head = p;
    
    //删除节点
    head->next = head->next->next;//也就是val 1的next
    
    
    for(Node*i = head; i; i = i->next){
        cout << i->val << endl;
    }
    
    return 0;
}