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 * struct ListNode *next; 6 * }; 7 */ 8 void deleteNode(struct ListNode* node) 9 { 10 if(node==NULL) 11 return; 12 13 struct ListNode* p,*q; 14 q=node; 15 p=node->next; 16 int temp; 17 temp=p->val; 18 p->val=q->val; 19 q->val=temp; 20 q->next=p->next; 21 22 }
LeeCode-Delete Node in a Linked List
原文：http://www.cnblogs.com/vpoet/p/4660464.html