题解 | #删除有序链表中重复的元素-II#

用递归

import java.util.*;

/*

• public class ListNode {
• int val;
• ListNode next = null;
• }
• /

public class Solution {
/**
*
* @param head ListNode类
* @return ListNode类
*/
public ListNode deleteDuplicates (ListNode head) {
// write code here
if (head == null){return head;}
if (head.next == null){return head;}
if (head.val != head.next.val){
head.next = deleteDuplicates(head.next);
return head;
} else {
int val = head.val;
while (head != null && head.val == val){
head = head.next;
}
return deleteDuplicates(head);
}
}
}