码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode 237. Delete Node in a Linked List

时间:2016-04-20 07:07:16      阅读:153      评论:0      收藏:0      [点我收藏+]

标签:

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 -> 4after calling your function.

题解:在链表中删除一个节点,可以让它的前驱节点的指针直接指向它的后继节点。当不知道它的前驱节点时,直接让这个节点等于它的后继节点就好了。(当然在实际写工程代码时应该完成之后把没用的节点删了)

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

 

leetcode 237. Delete Node in a Linked List

标签:

原文地址:http://www.cnblogs.com/zywscq/p/5411003.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!