LeetCode 237. Delete Node in a Linked List 题解(C++)
2016-10-11 13:17
399 查看
LeetCode 237. Delete Node in a Linked List 题解(C++)
题目描述
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.思路
题目的意思是删除单链表的某一个结点,而且函数的参数只给了要删除的结点,没有给链表的头结点;这里我们只需得到要删除结点的后一个结点dNode,把dNode结点的值赋给要删除的结点node,并使node指向dNode的下一个结点即可;
这里还可以直接使用*node=*dNode,直接把要删除结点的下一个结点赋给要删除的结点;
注意因为使用的是C++,所以最后我们需要delete掉删除的结点。
代码
/** * 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) { ListNode *dNode = node->next; node->val = dNode->val; node->next = dNode->next; //这里另一种方法,替换掉整个结点 *node = *dNode; delete dNode; } };
相关文章推荐
- leetcode之237. Delete Node in a Linked List(C++解法)
- Leetcode 237. Delete Node in a Linked List
- 237.[LeetCode]Delete Node in Linked List
- LeetCode——237. Delete Node in a Linked List
- [Leetcode] 237. Delete Node in a Linked List 解题报告
- [leetcode: Python]237. Delete Node in a Linked List
- leetcode 237. Delete Node in a Linked List 删除没有父结点的元素
- LeetCode:237. Delete Node in a Linked List
- LeetCode Javascript实现 283. Move Zeroes 349. Intersection of Two Arrays 237. Delete Node in a Linked List
- Leetcode——237. Delete Node in a Linked List
- [leetcode]237. Delete Node in a Linked List
- LeetCode 237. Delete Node in a Linked List
- LeetCode 237. Delete Node in a Linked List(删除链表中的一个节点)
- leetcode 237. Delete Node in a Linked List
- 【leetcode 237】 Delete Node in a Linked List (C++)
- LeetCode 237. Delete Node in a Linked List
- [LeetCode]237. Delete Node in a Linked List
- Leetcode 237. Delete Node in a Linked List
- 【Leetcode】237. Delete Node in a Linked List
- 237. Delete Node in a Linked List LeetCode