leetcode 237. Delete Node in a Linked List

237. Delete Node in a Linked List

Total Accepted: 62658 Total Submissions: 143216 Difficulty: Easy

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

Hide Tags

Linked List

Show Similar Problems

Have you met this question in a real interview?

Yes

Discuss

 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  // 参考 http://blog.csdn.net/sunao2002002/article/details/47083975
10  // 从链表中，删除指定的节点，但又没有给出前指针，所以先交换当前节点和下一节点的值，然后删除下一节点即可。代码如下：
11 class Solution {
12 public:
13     void deleteNode(ListNode* node) {
14         if(node == NULL || node->next == NULL) return;
15         node->val = node->next->val;
16         node->next = node->next->next;
17     }
18 };