83.删除排序链表
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode curr = head;
while(curr!=null&&curr.next!=null){
if(curr.val == curr.next.val){
curr.next = curr.next.next;
}else{
curr = curr.next;
}
}
return head;
}
}
82.删除排序链表Ⅱ
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode dummy = new ListNode(110, head);
ListNode pre = dummy;
ListNode curr = head;
while(curr!=null){
while(curr.next!=null&&curr.next.val == curr.val){
curr = curr.next;
}
if(pre.next == curr){
pre = pre.next;
}else{
pre.next = curr.next;
}
curr = curr.next;
}
return dummy.next;
}
}