首页 > 代码库 > ［LeetCode］ 237. Delete Node in a Linked Lis解题小结
［LeetCode］ 237. Delete Node in a Linked Lis解题小结
题目：
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.
首先判断这个结点是不是空结点或尾结点，然后要记得释放内存，以免造成memory leak
/** * 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 *delNode; delNode = node->next; node->val = node->next->val; node->next = node->next->next; free(delNode); }};
［LeetCode］ 237. Delete Node in a Linked Lis解题小结
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。