Leetcode Delete Node in a Linked List
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.
题目意思:
写一个函数删除单链表中的某个结点,函数只给出了删除的结点
解题思路:
只需要将删除的结点与其下一个结点交换值即可,同时调整好链表指针
源代码:
1 class Solution { 2 public: 3 void deleteNode(ListNode* node) { 4 if( node->next == NULL){ 5 delete node; 6 node = NULL; 7 } 8 swap(node->val, node->next->val); 9 ListNode* nextNode = node->next; 10 node->next = nextNode->next; 11 delete nextNode; 12 } 13 };
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步