82. 删除排序链表中的重复元素 II+328. 奇偶链表

最新推荐文章于 2024-09-28 10:34:40 发布

清蒸GAMMA

最新推荐文章于 2024-09-28 10:34:40 发布

阅读量38

点赞数

文章标签：链表 leetcode 数据结构 Powered by 金山文档

本文链接：https://blog.csdn.net/Wang_Dechang/article/details/129647782

版权

82. 删除排序链表中的重复元素 II

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        ListNode *virhead = new ListNode(0);
        virhead -> next = head;
        ListNode *left = virhead;
        if (!head) 
        {
            return NULL;
        }
        ListNode * cur;
        while(left != NULL && left -> next != NULL && (left -> next) -> next != NULL)
        {
            if(left -> next -> val == (left -> next) -> next -> val)
            {
                int len = (left -> next) -> val;
                cur = left -> next;
                while(cur -> val == len )
                {
                    cur  = cur -> next;
                    if(cur == NULL)
                    {
                        break;
                    }
                }
                left -> next = cur;
            }
            else
            {
                left = left -> next;
            }
        }
        return virhead -> next ;
    }
};

双指针

328. 奇偶链表

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* oddEvenList(ListNode* head) {
        ListNode * even = new ListNode (0); // 奇数
        ListNode * odd = new ListNode (0); // 偶数
         even = head;
         if(head == NULL || head -> next == NULL || (head -> next) -> next == NULL)
         {
             return head;
         }
         odd = head -> next;
         ListNode * odd_head = head -> next;
         ListNode * cur = odd -> next;
         while(cur != NULL )
         {
             even -> next = cur;
             even = even -> next;
             cur = cur -> next;
             odd -> next = cur;
             odd = odd -> next;
             if(cur != NULL)
             {
                cur = cur -> next;
             }
         }
         even -> next = odd_head;
         return head;

    }
};

看答案说不用设置cur,但是设了好像也还好，不设应该更清晰