链表18--删除重复的元素包括自己

最新推荐文章于 2018-06-15 10:18:05 发布

米缸没米了

最新推荐文章于 2018-06-15 10:18:05 发布

阅读量130

点赞数

分类专栏： LeetCode 文章标签：算法链表重复元素

本文链接：https://blog.csdn.net/qq_31307013/article/details/80265787

版权

LeetCode 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

1、题目：

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

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

2、解答：需要一个前指针

3、C++代码：

class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        ListNode *dummy = new ListNode(0);
        ListNode *prev = dummy;
        dummy->next = head;
        while(prev->next){
            ListNode *curr = prev->next;
            if(curr->next && curr->next->val == curr->val){
                do{
                    ListNode *temp = curr->next->next;
                    delete curr->next;
                    curr->next = temp;
                }while(curr->next &&  curr->next->val == curr->val);
                
                prev->next = curr->next;
                delete curr;
                    
            }else{
                prev = prev->next;
            }
        }
        return dummy->next;
    }
};

python代码

class Solution:
    def deleteDuplicates(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        dummy = pre = ListNode(None)
        dummy.next = head
        while head and head.next:
            if head.val == head.next.val:
                while head and head.next and head.val == head.next.val:
                    head = head.next
                head = head.next
                pre.next = head
            else:
                pre = pre.next
                head = head.next
        return dummy.head