[LeetCode] Delete Node in a Linked List

swingspring

于 2015-09-30 00:23:55 发布

阅读量392

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/skywn/article/details/48815467

版权

LeetCode 专栏收录该内容

5 篇文章

订阅专栏

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.

欲删除节点后一个节点往前复制，改欲删掉节点的指针指向下下个节点

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
void deleteNode(struct ListNode* node) {
    node->val=node->next->val;
    node->next=node->next->next;
}