1、原题如下:
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.
2、解题如下:
/**
* 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) {
if(node == NULL) return;
ListNode* temp = node->next;
node->val = temp->val;
node->next = temp ->next;
delete temp;
}
};
3、解析
此题比较简单,甚至不需要知道链表的用法都可以完成。(这里不做进一步的说明了)