给定一个排序链表, 删除所有重复的元素每个元素只留下一个.
样例
给出
1->1->2->null
, 返回 1->2->null
给出
1->1->2->3->3->null
, 返回
1 - >2 - >3 - >null
/**
* Definition of ListNode
* class ListNode {
* public:
* int val;
* ListNode *next;
* ListNode(int val) {
* this->val = val;
* this->next = NULL;
* }
* }
*/
class Solution {
public:
/*
* @param head: head is the head of the linked list
* @return: head of linked list
*/
ListNode * deleteDuplicates(ListNode * head) {
// write your code here
if (head == NULL) return 0;
ListNode * p = head;
ListNode * next;
while (p - >next != NULL) {
next = p - >next;
if (next - >val == p - >val) {
p - >next = next - >next;
delete(next);
} else //else 很重要
{
p = p - >next;
}
}
return head;
}
};
LintCode 112. 删除排序链表中的重复元
来源: http://www.bubuko.com/infodetail-2477833.html