We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Delete duplicate-value nodes from a sorted linked list
  5. Discussions

Delete duplicate-value nodes from a sorted linked list

  • emhhacker
     + 0 comments

    My Java solution with o(n) time complexity and o(1) space complexity:

    public static SinglyLinkedListNode removeDuplicates(SinglyLinkedListNode llist) {
        if(llist == null) return llist; //no duplicates to rmv
        
        //use two ptrs to iterate over the linked list
        SinglyLinkedListNode first = llist;
        SinglyLinkedListNode second = llist.next;
        
        while(first != null && second != null){
            //remove the second ptr if its data is equal to the first ptr
            if(first.data == second.data) first.next = second.next;
            //otherwise increase first ptr since data isnt equal
            else first = second;
            
            //increment second ptr to go through entire list
            second = second.next;
        }
        
        return llist;
    }