题目地址:https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
方法:判断该节点是否删除pre和current的处理不一样
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null||head.next==null)return head;
ListNode dummy = new ListNode(0);
Map<Integer, Integer>hashMap = new HashMap<Integer, Integer>();
dummy.next = head;
ListNode pre = dummy;
ListNode current = head;
while(current!=null){
if(hashMap.containsKey(current.val)){
hashMap.put(current.val, hashMap.get(current.val)+1);
}
else{
hashMap.put(current.val, 1);
}
current=current.next;
}
current=head;
while(current!=null){
if(hashMap.get(current.val)>1){
pre.next=current.next;
current=current.next;
}
else{
pre=current;
current=current.next;
}
}
return dummy.next;
}
}