//
// public class ListNode {
// int val;
// ListNode next;
// ListNode(int x) { val = x; }
// }
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode current = head;
while (current!=null&¤t.next!=null){
if (current.val==current.next.val){
current.next=current.next.next;
}else{
current=current.next;
}
}
return head;
}
}