Day15: [LeetCode中等] 82. 删除排序链表中的重复元素 II

Day15: [LeetCode中等] 82. 删除排序链表中的重复元素 II

题源:

来自leetcode题库:

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

思路:

因为链表已经排好序了,所以重复的值都会在一起,遍历链表就好了。

代码:

dirty code凑合看吧

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
struct ListNode* deleteDuplicates(struct ListNode* head){
    if (head == NULL || head->next == NULL) return head;
    struct ListNode H= {NULL, 0};
    struct ListNode* p1 = head;
    struct ListNode* p2 = &H;
    int n,value;
    while (p1) {
        struct ListNode* tmp = p1;
        for (n = 0,value = p1->val; p1 != NULL && p1->val == value; ++n) 
            p1 = p1->next;
        if (n == 1) {  
            p2->next = tmp;
            p2 = tmp;
        }
    }
    p2->next = NULL;
    return H.next;
}
发布了49 篇原创文章 · 获赞 13 · 访问量 550

猜你喜欢

转载自blog.csdn.net/qq2215459786/article/details/103109184