题目链接:https://leetcode.com/problems/remove-duplicates-from-sorted-list/
Runtimes:24ms
1、问题
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.
2、分析
简单的链表删除操作
3、小结
注意链表空指针的判断
4、实现
/**
* 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) {
ListNode *p = head;
while(NULL != p)
{
while(NULL != p->next && p->val == p->next->val)
{
ListNode *q = p->next;
p->next = q->next;
delete q;
}
p = p->next;
}
return head;
}
};
5、反思
注意链表空指针的判断