class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null||head.next==null){
return head;
}
head.next=deleteDuplicates(head.next);
if(head.val==head.next.val){
head=head.next;
}
return head;
}
}
递归实现
501

被折叠的 条评论
为什么被折叠?



