class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if (!head)
return NULL;
ListNode *slow = head, *fast = head;
while (fast != NULL)
{
if (slow->val != fast->val)
{
slow = slow->next;
slow->val = fast->val;
}
fast = fast->next;
}
slow->next = NULL;
return head;
}
};