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) {        ListNode* tempNode = node->next;        node->val = tempNode->val;        node->next = tempNode->next;        free(tempNode);    }};