代码实现:
public class DeleteDuplicates {
//迭代实现
public ListNode deleteDuplicates1(ListNode head) {
if (head == null) return null;
ListNode temp = head;
ListNode next = head.next;
while (next != null){
if (next.val == temp.val){
next = next.next;
temp.next = next;
}else {
temp = temp.next;
next = next.next;
}
}
return head;
}
//递归实现
public ListNode deleteDuplicates(ListNode head) {
if (head ==null || head.next == null) return head;
ListNode temp = deleteDuplicates(head.next);
if (temp.val == head.val){
head.next = temp.next;
}
return head;
}
}