Remove Duplicates from Sorted List
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==NULL)
return NULL;
ListNode * curnode=head;
ListNode * nextnode = head->next;
while(nextnode!=NULL)
{
if(curnode->val==nextnode->val)
{
curnode->next = nextnode->next;
free(nextnode);
nextnode = curnode->next;
}
else
{
curnode = nextnode;
nextnode = nextnode->next;
}
}
return head;
}
};