#Leetcode# 83. Remove Duplicates from Sorted List

最新推荐文章于 2024-10-07 16:14:28 发布

weixin_30305735

最新推荐文章于 2024-10-07 16:14:28 发布

阅读量39

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/zlrrrr/p/10026840.html

版权

https://leetcode.com/problems/remove-duplicates-from-sorted-list/

Given a sorted linked list, delete all duplicates such that each element appear only once.

Example 1:

Input: 1->1->2
Output: 1->2

Example 2:

Input: 1->1->2->3->3
Output: 1->2->3

代码：

/**
 * Definition for singly-linked list.
 * 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 = head;
        while(start && start -> next) {
            if(start -> val == start -> next -> val) {
                ListNode *cur = start -> next;
                start -> next = start -> next -> next;
                free(cur);
            }
            else 
                start = start -> next;
        }
        return head;
        
    }
};

　　本来想着自己尝试写出来但是很遗憾错的跟什么一样只能看看题解但是还是有的地方很烦看的不懂今天是伤心又难过的小可怜

转载于:https://www.cnblogs.com/zlrrrr/p/10026840.html