LeetCode 237 Delete Node in a Linked List
来源:互联网 发布:淘宝店铺基本加权设置 编辑:程序博客网 时间:2024/06/05 23:19
题目
分析
题目的意思很简单,给你一个链表,给你一个节点(不是尾结点)让你反悔除了这个节点之外的链表。
题解
起初我是这样想的,把下一个的值赋给当前的值,不断移动当前的位置,那么最后一个值就是不需要的。
那么倒数第二个节点 node -> next = NULL; 即可
/** * 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) { while(node->next->next != NULL){ node->val = node->next->val; node = node->next; } node->val = node->next->val; node->next = NULL; }};
后面发现我好傻,如果我把下一个节点的值赋给现在的值,
那么下一个节点不就是不需要的了么,直接跳过就好了,干嘛还慢悠悠的移到最后去.....
于是只需要两句话就完成了
/** * 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->val = node->next->val; node->next = node->next->next; }};
0 0
- leetcode: Delete Node in a Linked List
- LeetCode Delete Node in a Linked List
- 【leetcode】Delete Node in a Linked List
- Leetcode: Delete Node in a Linked List
- [LeetCode]Delete Node in a Linked List
- 【leetcode】Delete Node in a Linked List
- Leetcode Delete Node in a Linked List
- LeetCode || Delete Node in a Linked List
- [LeetCode] Delete Node in a Linked List
- LeetCode-Delete Node in a Linked List
- 【leetCode】Delete Node In A Linked List
- [leetcode] Delete Node in a Linked List
- [LeetCode]Delete Node in a Linked List
- [leetcode]Delete Node in a Linked List
- Leetcode: Delete Node in a Linked List
- LeetCode Delete Node in a Linked List
- LeetCode-Delete Node in a Linked List
- leetcode | Delete Node in a Linked List
- C语言的内存管理分析 栈区 代码区 堆区 静态区 常量区
- Android UI学习之Gallery
- linux下段错误检查的便捷方法
- 聚集索引与非聚集索引
- 糟糕程序员的各种迹象
- LeetCode 237 Delete Node in a Linked List
- 软件测试工程师的“三十六变”
- HDU 1753
- Codeforces Round #305 (Div. 2)A. Mike and Fax
- 音乐播放器
- Android基础入门教程——1.2 开发环境搭建
- Spring实现AOP的4种方式
- Java基础数据类型IO流来读取雇员信息
- ListView优化完全解读