237. Delete Node in a Linked List(easy)

Easy

8544087FavoriteShare

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Given linked list -- head = [4,5,1,9], which looks like following:

 

Example 1:

Input: head = [4,5,1,9], node = 5

Output: [4,1,9]

Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.

Example 2:

Input: head = [4,5,1,9], node = 1

Output: [4,5,9]

Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.

 

Note:

• The linked list will have at least two elements.
• All of the nodes' values will be unique.
• The given node will not be the tail and it will always be a valid node of the linked list.
• Do not return anything from your function.

 

C++：

/*
 * @Author: SourDumplings
 * @Date: 2019-08-28 12:36:21
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/delete-node-in-a-linked-list/
 * 
 * 这道题实际上是删除node这个结点，将node的下一个结点的值赋值给node再删除node的下一个结点即可
 */

/**
 * 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 || !node->next)
        {
            return;
        }

        ListNode *p = node->next;
        node->val = p->val;
        node->next = p->next;
        delete p;
    }
};

Java：

/*
 * @Author: SourDumplings
 * @Date: 2019-08-28 12:44:36
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/delete-node-in-a-linked-list/
 */

/**
* Definition for singly-linked list.
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
class Solution
{
    public void deleteNode(ListNode node)
    {
        if (node == null || node.next == null)
        {
            return;
        }
        ListNode p = node.next;
        node.val = p.val;
        node.next = p.next;
    }
}