Remove Duplicates from Sorted List
来源:互联网 发布:flash cs3 mac 中文 编辑:程序博客网 时间:2024/05/28 19:24
描述
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.
中文:按序排列的单链表,删除冗余元素。
分析:只要用两个指针,一个记录之前的结点,一个记录现在的结点,判断是否相同进行删除。
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* deleteDuplicates(ListNode* head) { if(head==nullptr) return nullptr; for(ListNode * prev=head, *cur=head->next;cur;cur=cur->next) { if(cur->val==prev->val) { prev->next=cur->next; delete cur; } else { prev=cur; } } return head; }};
0 0
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove duplicates from sorted list
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List
- 最大熵模型
- Web工程获取目录下的资源
- linux CR2 to JPG
- Fortran从文件读入数据的规律
- 28 - 字符串的全排列和组合
- Remove Duplicates from Sorted List
- 51nod1051(最大子矩阵和)
- CUDA nvcc编译步骤简单讲解
- 并发请求导致的业务处理安全风险及解决方案
- 【HDU】5293 Tree chain problem【DP+LCA】
- C# 向指定线程发送消息
- 初识MVC框架
- eclipse 全局搜索
- 算法——贪心、穷举法