删除排序链表中的重复元素

给定一个排序链表，删除所有重复的元素每个元素只留下一个。

样例

给出 1->1->2->null，返回 1->2->null

给出 1->1->2->3->3->null，返回 1->2->3->null

#include <iostream>

using namespace std;


//Definition of ListNode
class ListNode {
public:
    int val;
    ListNode *next;
    ListNode(int val) {
        this->val = val;
        this->next = NULL;
    }
};

class Solution {
public:
	/**
	* @param head: The first node of linked list.
	* @return: head node
	*/
	ListNode* Init(ListNode* head)
	{
		int val = 0;
		ListNode* p = NULL;
		while (true)
		{
			cin >> val;
			if (-1 == val)
			{
				return head;
			}

			if (NULL == head)
			{
				head = new ListNode(val);
				p = head;
			}
			else
			{
				p->next = new ListNode(val);
				p = p->next;
			}
		}
	}

	ListNode *deleteDuplicates(ListNode *head) {
		// write your code here
		if (NULL == head)
		{
			return head;
		}

		ListNode* p = head;
		ListNode* temp = head;

		while (p->next != NULL && temp->next != NULL)
		{
			while (p->val == temp->val && temp->next != NULL)
			{
				temp = temp->next;
			}

			if (temp->next == NULL)//分情况处理最后一个元素
			{
				if (p->val == temp->val)//最后一个元素重复
				{
					p->next = NULL;
				}
				else//不重复
				{
					p->next = temp;
				}
				break;
			}

			p->next = temp;
			p = p->next;
		}

		return head;
	}

	void Out(ListNode* head)
	{
		if (NULL != head)
		{
			ListNode* p = head;
			while (p)
			{
				cout << p->val << " ";
				p = p->next;

			}
			cout << endl;
		}
	}
};
int main()
{
	ListNode* head = NULL;
	Solution s;
	head = s.Init(head);
	s.Out(head);
	head = s.deleteDuplicates(head);
	s.Out(head);
	return 0;
}