leetcode 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
解
/**
* 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;
}else{
ListNode* tmp=node->next;
node->val=tmp->val;
node->next=tmp->next;
delete(tmp);
}
}
};
小结
虽然java的实现方法更为简单,但是个人总认为链表这种东西,只有用c++才能体现出其优越性。