目录
题目

解法一:迭代
cpp
struct ListNode* delete(struct ListNode* head)
{
if (!head)
return head;
struct ListNode* retHead = head;
while (head->next)
{
if (head->val == head->next->val)
{
struct ListNode* freeNode = head->next;
head->next = head->next->next;
free(freeNode);
}
else
head = head->next;
}
return retHead;
}
struct ListNode* deleteDuplicates(struct ListNode* head)
{
return delete(head);
}