Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
Input: 1->1->2
Output: 1->2
Example 2:
Input: 1->1->2->3->3
Output: 1->2->3
题目大意为 删除重复数字。保留一个
时间复杂度O(l)
只需要判断当前数字和下一个数字是否相等 如果相等 删除 不相等 遍历一下个
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
ListNode *p=head;
if(head == NULL)
return head;
while(p->next)
{
if(p->val == p->next->val)
{
p->next = p->next->next;
}
else
{
p=p->next;
}
}
return head;
}
};