【LeetCode】83

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.

Solution:

 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         if(head == NULL)return head;
13         ListNode* temp = head,*cur = head->next;
14         while(cur)
15         {
16             if(cur->val != temp->val)
17             {
18                 temp->next = cur;
19                 temp = temp->next;
20             }
21             cur = cur->next;
22         }
23         temp->next = NULL;
24         return head;
25     }
26 };