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 value3, the linked list should become 1 -> 2 -> 4 after calling your function.

Subscribe to see which companies asked this question

分析：

不要拘泥于遍历然后删除掉某个点。

正确的做法 应该就是拿到这个点后，让这个点的值为下一个点的值，next指向下一个点的next.

删除某节点的两种方法。

一种是跨过这个节点，指向下一个节点。

另一种是赋值这个节点的next节点，然后跨过next节点。对于尾节点，需要另行处理。

本题即属于第二种。

/** * 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) {        node->val=node->next->val;        node->next=node->next->next;    }};