Remove Duplicates from Sorted List

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.
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
      
        if (head == null)
            return head; 
        if (head.next == null) 
            return head; 
        
        
        ListNode cur = head; 
        while(cur.next != null) {
            ListNode afterCur = cur.next;
            if (cur.val == cur.next.val) {
                //if the val of next node = the val of current node:
                //reset the next of the current node
                cur.next = afterCur.next;
            } else if (cur.val != cur.next.val) {
                cur = afterCur; 
            }
        }
        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