237. Delete Node in a Linked List

原题链接：https://leetcode.com/problems/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

题意：
给你一个链表的节点指针，要求你在这链表中删除这个节点。

思路：单纯对链表和指针的理解，没什么好讲的。

AC代码：

/** * 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&&node->next==NULL) return;        node->val=node->next->val;        node->next=node->next->next;    }};