标签：
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.
1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val; 5 * ListNode *next; 6 * ListNode(int x) : val(x), next(NULL) {} 7 * }; 8 */ 9 class Solution { 10 public: 11 void deleteNode(ListNode* node) { 12 node->val=node->next->val; 13 ListNode* tem = node->next; 14 node->next = tem->next; 15 delete tem; 16 } 17 };
思路：
将后一个节点的值复制到当前节点，使用指针tem存储下一个节点。修改当前节点的next指针，最后删除tem。
leetcode:237 Delete Node in a Linked List－每日编程第四题
标签：
原文地址：http://www.cnblogs.com/yishuimao/p/5030660.html
