leetcode - Remove Duplicates from Sorted List

标签：style   color   io   os   ar   for   sp   on   amp   

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.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
struct ListNode
{
	int val;
	ListNode *next;
	ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
    ListNode *deleteDuplicates(ListNode *head) {
        if(head == NULL) return head;
		ListNode *p = head,*t = NULL;
		int value = head->val;
		ListNode *cur = head->next;
		while(cur != NULL)
		{
			if(value == cur->val)
			{
				t = cur;
				p->next = cur->next;
				cur = cur->next;
				delete t;
			}
			else
			{
				p = cur;
				value = cur->val;
				cur = cur->next;
			}
		}
		return head;
    }
};

leetcode - Remove Duplicates from Sorted List

标签：style   color   io   os   ar   for   sp   on   amp   

原文地址：http://blog.csdn.net/akibatakuya/article/details/40017149