标签：
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) {} * }; */ class Solution { public: ListNode *deleteDuplicates(ListNode *head) { if(head==NULL||head->next==NULL)return head; ListNode *tmp=head->next; ListNode *res=head; ListNode *p=res; while(tmp!=NULL) { if(p->val!=tmp->val) { p->next=tmp; p=p->next; } tmp=tmp->next; } p->next=NULL; return res; } };
leetcode[83]Remove Duplicates from Sorted List
标签：
原文地址：http://www.cnblogs.com/Vae98Scilence/p/4281417.html
