leetcode【82，83】Remove Duplicates from Sorted List I / II

先来看看83题目吧，这题简单很多。

问题描述（83）：

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

Return the linked list sorted as well.

Example 1:

Input: 1->2->3->3->4->4->5
Output: 1->2->5

Example 2:

Input: 1->1->1->2->3
Output: 2->3

源码（83）：

用两个前后指针，空间效率还是挺高，100%，时间上一般43.56%。不知道是不是大神太多了，之前在上面跑的100%的代码，最近都只有40%左右。

/**
 * 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)   return head;
        ListNode *back=head, *pre=head;
        int dup=0;
        while(pre){
            if(pre->val == back->val)     pre = pre->next;
            else{
                // cout<<pre->val<<endl;
                back->next = pre;
                back = back->next;
                pre = pre->next;
            }
        }
        back->next = NULL;
        return head;
    }
};

问题描述（82）：

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinctnumbers from the original list.

Return the linked list sorted as well.

Example 1:

Input: 1->2->3->3->4->4->5
Output: 1->2->5

Example 2:

Input: 1->1->1->2->3
Output: 2->3

源码（83）：

多用了一个指针，效率还可以，时间上92%左右，空间还是100%

/**
 * 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 || !head->next)   return head;
        auto back = new ListNode(0), pre = head, iter=back;
        while(pre){
            if(pre->next && pre->next->val == pre->val){
                int tmp = pre->val;
                while(pre && pre->val==tmp)    pre = pre->next;
            }
            else{
                // cout<<pre->val<<" "<<back->val<<endl;
                iter->next = pre;
                iter = iter->next;
                pre = pre->next;
            }
        }
        iter->next = NULL;
        return back->next;
    }
};