leetcode+链表+移除所有的重复项

点击打开链接

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<cstring>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<limits.h>
#include<assert.h>
#include<sstream>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
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;
        ListNode *start=new ListNode(0);
        start->next = head;
        ListNode *pre=start;
        while (pre->next) {
            ListNode *cur=pre->next;
            while (cur->next&& cur->next->val==cur->val) {
                cur=cur->next;
            }
            if(cur!=pre->next) pre->next=cur->next;
            else pre=pre->next;
        }
        return start->next;
    }
};
int main()
{
    Solution temple;
    return 0;
}