LeetCode: Remove Duplicates from Sorted List II

 The question is copied from LeetCode:

Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked list sorted as well.

 

Example 1:

Input: head = [1,2,3,3,4,4,5]
Output: [1,2,5]

Example 2:

Input: head = [1,1,1,2,3]
Output: [2,3]

 

Constraints:

• The number of nodes in the list is in the range [0, 300].
• -100 <= Node.val <= 100
• The list is guaranteed to be sorted in ascending order.
  

My Solution:

package madwani.sushil.leetcode.Jan1_7_2021;

public class Remove_Duplicates_From_Sorted_List_II {
    static int val = -1000;
    public static void main(String[] args) {
        ListNode inp1 = constructInput(new int[] {1, 1, 1 , 2, 2, 2, 3, 4, 5 , 6, 6});
        deleteDuplicates(inp1);
    }

    public static ListNode deleteDuplicates(ListNode head) {
        ListNode temp = new ListNode(0);
        temp.next = head;
        ListNode temp1 = temp;
        while (temp1.next !=null && temp1.next.next !=null) {
            if (temp1.next.val == temp1.next.next.val) {
                val = temp1.next.val;
                while(temp1.next !=null && temp1.next.val == val) {
                    temp1.next = temp1.next.next;
                }
            } else {
                temp1 = temp1.next;
            }
        }
        return temp.next;
    }

    static ListNode constructInput(int[] ints) {
        if ( ints.length == 0) {
            return null;
        }
        ListNode inp = new ListNode(ints[0]);
        ListNode inp1 = inp;
        for ( int i =1; i< ints.length; i++) {
            inp.next = new ListNode(ints[i]);
            inp = inp.next;
        }
        return inp1;
    }

    static class ListNode {
        int val;
        ListNode next;
        ListNode() {}
        ListNode(int val) { this.val = val; }
        ListNode(int val, ListNode next) { this.val = val; this.next = next; }
    }
}