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)return null;
ListNode tmp = head;
int s = head.val;
for(ListNode a = head;a!=null;a=a.next){
if(s==a.val)continue;
s=a.val;
tmp.next=a;
tmp=a;
}
tmp.next=null;
return head;
}
}