leetcode 081 —— 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 || !head->next) return head;
		ListNode *pre = new ListNode(0);
		ListNode *p = pre;
		p->next = head;
		ListNode *cur = head;
		ListNode *next = head->next;
		while (cur&&next){
			bool flag=false;
			while (next&&cur->val == next->val){ //next为null就终止
				flag = true;
				cur = cur->next;
				next = next->next;
			}
			if (!flag){  //cur和next不相同
				cur = cur->next;
				next = next->next;
				p = p->next;
			}
			else{
				p->next = next;
				cur = next;
				if (next)
					next = next->next;
			}
		}
		return pre->next;
	}
};