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
.
Subscribe to see which companies asked this question
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
// 安全检查
if(head==null||head.next==null) return head;
//
ListNode pre=new ListNode(-1);
pre.next=head;
ListNode cur=pre.next;
ListNode res=pre;
while(cur!=null&&cur.next!=null){
// ListNode temp=cur.next;
if(cur.val==cur.next.val){
pre.next=cur.next;
cur.next=null;
cur=pre.next;
}
else{
pre=pre.next;
cur=cur.next;
}
}
return res.next;
}
}