Short easy c++ solution


  • 1
    F
    class Solution {
    public:
        ListNode* deleteDuplicates(ListNode* head) {
            ListNode* dummy = new ListNode(0);
            dummy->next = head;
            ListNode* cur = dummy;
            while (cur->next && cur->next->next) {
                if (cur->next->val == cur->next->next->val) cur->next = cur->next->next;
                else cur = cur->next;
            }
            return dummy->next;
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.