力扣每日一题82 删除排序链表中的重复元素 II

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
    int flag=0;//是否改动链表标志位
public:
    ListNode* deleteDuplicates(ListNode* head) {
    ListNode* anchor=new ListNode(-1);
    anchor->next=head;  //链表锚点
    ListNode* pre=anchor;
    ListNode* pnext=nullptr;
    while(head)
    {
      pnext=head->next;
      while(pnext!=nullptr&&pnext->val==head->val)//存在相等情况
      {
          pnext=pnext->next;flag=1;
      } 
      if(flag==1)
      {pre->next=pnext;
      head=pnext;
      flag=0;
      }
      else //正常情况
      {pre=head;
      head=pnext;}
      
    }

   return anchor->next;

    }
};