leetcode

0 class Solution {

1 public:

2 ListNode *deleteDuplicates(ListNode *head) {

3 if (!head) return nullptr;

4 for (ListNode *p = head; p->next;)

5 if (p->val == p->next->val)

6 p->next = p->next->next;

7 else

8 p = p->next;

9 return head;

10 }

11 };