Leetcode 237

1. Delete Node in a Linked List
   Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.

Subscribe to see which companies asked this question

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 * delete next
 */
class Solution {
public:
    void deleteNode(ListNode* node) {
        ListNode *mynext2;
        mynext2=node->next;
        if(NULL!=node){
            node->next=mynext2->next;
            node->val=mynext2->val;
            delete(mynext2);
        }


    }
};