83. Remove Duplicates from Sorte

Problem

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

Example 1:

Input: 1->1->2
Output: 1->2

Example 2:

Input: 1->1->2->3->3
Output: 1->2->3

Solution

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */

class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        ListNode temp = head;
        while(temp != null){
            if(temp.next != null){
                if(temp.val == temp.next.val){
                    temp.next = temp.next.next;
                }else{
                    temp = temp.next;
                }
            }else{
                temp = null;
            }
        }
        return head;
    }
}

Result