LeetCode 237. Delete Node in a Linked List
2017-04-04 16:24
405 查看
题目:
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.
思路:
删除一个节点(不是最后的那个)。
将要删除的下一个节点的值赋给要删除的节点,删除下一个节点
代码:
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; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: void deleteNode(ListNode* node) { ListNode* del=node->next; node->val=node->next->val; node->next=node->next->next; delete del; } };
相关文章推荐
- 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
- leetcode: 237. Delete Node in a Linked List
- (easy)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
- 【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
- LeetCode笔记:237. Delete Node in a Linked List