remove duplicates from sorted lists@leetcode

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.

» Solve this problem

	/**
	* 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) {
	// Start typing your C/C++ solution below
	// DO NOT write int main() function
	if(head==NULL||head->next==NULL) return head;
	ListNode *cur=head, *p=cur->next;
	while(p->next!=NULL)
	{
	if(cur->val!=p->val)
	{
	cur->next=p;
	cur=p;
	p=p->next;
	}
	else
	p=p->next;
	}
	if(p->val!=cur->val)
	{
	cur->next=p;
	cur=p;
	cur->next=NULL;
	}
	else
	cur->next=NULL;
	return head;
	}
	};

view raw Remove Duplicates from Sorted Lists hosted with ❤ by GitHub