草稿暂存

最新推荐文章于 2024-09-13 18:50:17 发布

Eleven_Adam

最新推荐文章于 2024-09-13 18:50:17 发布

阅读量984

点赞数

分类专栏：算法学习

本文链接：https://blog.csdn.net/u013195320/article/details/32313217

版权

算法学习专栏收录该内容

1 篇文章 0 订阅

订阅专栏

class Solution {
public:
    ListNode *deleteDuplicates(ListNode *head) {
        if (head == NULL)
            return NULL;
            
        bool isDup;
        ListNode *pos = head, *next_pos = head->next;
        
        if (next_pos == NULL)
            return head;
            
        ListNode *pre_pos = new ListNode(0);
        ListNode *new_head = pre_pos;
        pre_pos->next = head;
        
        while (next_pos != NULL)
        {
            isDup = false;
            while (next_pos != NULL && pos->val == next_pos->val)
            {
                isDup = true;
                next_pos = next_pos->next;
            }
            if (isDup)
            {
                pre_pos->next = next_pos;
                pos = next_pos;
            }
            else
            {
                pre_pos = pre_pos->next;
                pos = pos->next;
            }
            next_pos = next_pos->next;
        }
        return new_head->next;
    }
};