20190713 Delete Node in a Linked List(删除链表中的结点)

1、题目

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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/delete-node-in-a-linked-list
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

2、源码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


void deleteNode(struct ListNode* node) 
{
    struct ListNode* p = node->next;
    node->val = p->val;
    node->next = p->next;
    free(p);
}

 3、思路

因为我们无法获取前一个指针，所以我们人为将这个结点改造为它下一个结点的样子，然后再将下一个结点删去。

 4、纪念

今晚压力大得睡不着，现在是凌晨4:44，希望自己能够快速调整好自己的状态。