LeeCode-Delete Node in a Linked List

poetliu

于 2016-04-25 18:44:56 发布

阅读量365

点赞数

CC 4.0 BY-SA版权

分类专栏： LeeCode

本文链接：https://blog.youkuaiyun.com/u013018721/article/details/51244421

LeeCode 专栏收录该内容

29 篇文章

订阅专栏

本文提供了一个函数，用于在单链表中删除指定节点（除尾节点外），仅通过访问该节点即可实现。示例中展示了如何将给定链表从3->4修改为3->2->4。

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) 
{
        if(node==NULL)
        return;

    struct ListNode* p,*q;
    q=node;
    p=node->next;
    int temp;
    temp=p->val;
    p->val=q->val;
    q->val=temp;
    q->next=p->next;

}