[OJ.leetcode] remove-duplicates-from-sorted-list

https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/

Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.

/* 반드시 인접해있는 두 노드만 duplicated 되어있는지? -> YES O(n) solution : 순회하면서 duplicated 노드 만나면 삭제(건너뛰고)연결 */ /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *deleteDuplicates(ListNode *head) { ListNode * cur = head; while(cur) { ListNode* next = cur->next; while(next && cur->val == next->val) { delete next; next = next->next; } cur->next = next; cur = next; } return head; } };