[LeetCode] Remove Duplicates from Sorted List II

问题：

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

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

分析：

链表的题，往往都是考察队链表的基本操作。没有高深的算法，但要一次写对也见功夫。

代码：

class Solution {public:ListNode *deleteDuplicates(ListNode *head) {if (!head)return NULL;ListNode * dummy = new ListNode(0);dummy->next = head;ListNode * one = dummy;ListNode * two = head->next;while (two) {bool moved = false;while (two && two->val == one->next->val) {two = two->next;moved = true;}if (moved)one->next = two;elseone = one->next;two = two ? two->next : NULL;}head = dummy->next;delete dummy;return head;}};