LeetCode(Remove Duplicates from Sorted List) 两道删除排序链表中重复数字

最新推荐文章于 2022-09-04 18:54:19 发布

lqcsp

最新推荐文章于 2022-09-04 18:54:19 发布

阅读量919

点赞数

分类专栏： c++ LeetCode 面试题文章标签：面试 leetcode 链表删除重复节点

本文链接：https://blog.csdn.net/lqcsp/article/details/23886585

版权

c++ 同时被 2 个专栏收录

80 篇文章 0 订阅

订阅专栏

LeetCode 面试题

73 篇文章 1 订阅

订阅专栏

题目要求：

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.

代码：

ListNode *deleteDuplicates(ListNode *head) {
    if(head == NULL  || head->next == NULL)
      return head;
    ListNode* pre = head, *cur = head->next;
    while(cur != NULL)
    {
      if(pre->val == cur->val)
      {
        pre->next = cur->next;
        delete cur;
        cur = pre->next;
      }
      else 
      {
        pre = cur;
        cur = cur->next;
      }
    }
    return head;
  }

题目二要求：

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

For example,
Given 1->2->3->3->4->4->5, return 1->2->5.
Given 1->1->1->2->3, return 2->3.

代码：

ListNode *deleteDuplicates(ListNode *head) {
    if(head == NULL || head->next == NULL)
      return head;
    ListNode* virtual_head = new ListNode(0);
    virtual_head->next = head;
    ListNode* del_begin = virtual_head;//添加一个虚拟头结点方便删除头结点
    
    while(del_begin != NULL)
    {
      ListNode* del_end = del_begin->next;
      while(del_end != NULL && del_end->next != NULL && 
            del_end->next->val == del_end->val)//找到要删除重复区间的最后一个节点
      {
        del_end = del_end->next;
      }
      if(del_begin->next != del_end && del_end != NULL)//如果有重复区间存在，将del_begin节点的下一位指向del_end的下一个节点，并逐个删除区间中的节点
      {
        ListNode* node = del_begin->next;
        del_begin->next = del_end->next;
        while(node != del_end)
        {
          ListNode* pnext = node->next;
          delete node;
          node = pnext;
        }
        delete del_end;
      }
      else 
        del_begin = del_begin->next;
    }
    return virtual_head->next;
  }