给定一个排序链表,删除所有重复的元素,使得每个元素只出现一次。
示例 1:
输入: 1->1->2
输出: 1->2
示例 2:
输入: 1->1->2->3->3
输出: 1->2->3
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* deleteDuplicates(struct ListNode* head)
{
struct ListNode* cur;
struct ListNode* post;
struct ListNode* temp;
if (head == NULL) {
return NULL;
}
if (head->next == NULL) {
return head;
}
cur = head;
post = head->next;
while (post != NULL) {
if (cur->val == post->val) {
temp = post;
post = post->next;
cur->next = post;
temp->next = NULL;
free(temp);
} else {
cur = cur->next;
post = post->next;
}
}
return head;
}