Remove Duplicates from Sorted List

Such a silly mistake I made.

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

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.


/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if (head == null) return head;
        if (head.next == null) return head;
        ListNode current = head;
        ListNode nextOne = head.next;
        
        while(true) {
            
            if (current.val == nextOne.val) {
                ListNode temp = nextOne.next;
                current.next = temp;
                nextOne = temp;
            }else{
                current = current.next;
                
                nextOne = nextOne.next;
            }
            
            if (nextOne == null) break;
        }
        
        return head;
    }
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s