1
class Solution {
2
 public:
3
  ListNode *deleteDuplicates(ListNode *head) {
4
    ListNode *k = new ListNode();
5
    ListNode *root = k, *cur = head;
6
    while (cur != NULL) {
7
      ListNode *t = cur;
8
      while (t->next != NULL && t->next->val == t->val) t = t->next;
9
      if (t == cur) {
10
        if (root == NULL)
11
          root->val = t->val;
12
        else {
13
          ListNode *p = new ListNode(t->val);
14
          root->next = p;
15
          root = root->next;
16
        }
17
      }
18
      cur = t->next;
19
    }
20
    return k->next;
21
  }
22
};