Total Accepted: 111563
Total Submissions: 304716
Difficulty: Easy
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
.
/**
* 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 p = head;
while(p!=null && p.next!=null){
if(p.val == p.next.val){ //有重复的值 删除
p.next = p.next.next;
}
else{ //否则 直接链接到下一个
p = p.next;
}
}
return head;
}
}