Given a sorted linked list, delete all duplicates such that each element appear only once.java
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
.app
/** * 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 null; ListNode t = head; ListNode h = head; int temp; while(h != null){ temp = h.val; while(t != null && t.val == temp){ t = t.next; } h.next = t; h = h.next; } return head; } }