237. 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

解答：

一个单向列表，给定一个指定删除的节点，得到删除后的链表。

        从给定删除的节点出发，依次把下一个节点的值赋值到当前节点，指针逐渐往后移动，判断当前节点是否为倒数第二个节点了，如果是，那么应该把当前节点的next赋值为NULL（此为链表尾）。

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