Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
Example 1:
Input: 1->2->3->3->4->4->5
Output: 1->2->5
Example 2:
Input: 1->1->1->2->3
Output: 2->3
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null || head.next==null) return head;
ListNode dummy = new ListNode(-1);
dummy.next = head;
ListNode p = dummy;
while(p.next!=null && p.next.next!=null ){
if(p.next.val==p.next.next.val){
ListNode node = p.next;
while(node!=null && node.next!=null && node.val==node.next.val){
node = node.next;
}
p.next = node.next;
}else{
p = p.next;
}
}
return dummy.next;
}
}