Remove Duplicates from Sorted List

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.

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 class Solution {
10 public:
11     ListNode *deleteDuplicates(ListNode *head) {
12         
13         ListNode *p = head;
14         while(p != NULL && p->next != NULL)
15         {
16             if(p->val == p->next->val)
17             {
18                 ListNode *del = p->next;
19                 p->next = p->next->next;
20                 delete del;
21             }
22             else
23                 p = p->next;
24         }
25         
26         return head;
27     }
28 };

 

posted @ 2014-09-13 19:12  yqc  阅读(69)  评论(0)  编辑  收藏  举报