本文共 1509 字，大约阅读时间需要 5 分钟。

题目：删除链表中重复的结点

/* public class ListNode {    int val;    ListNode next = null;    ListNode(int val) {        this.val = val;    }}*/import java.util.*;public class Solution {	public ListNode deleteDuplication(ListNode pHead){		Map
   
     mp=new HashMap<>();		while(pHead!=null) {			if(mp.containsKey(pHead.val)) {				mp.put(pHead.val, mp.get(pHead.val)+1);			}else {				mp.put(pHead.val, 1);			}			pHead=pHead.next;		}		ListNode curN=new ListNode(-1);		ListNode cur=curN;		Set
    
      keySet = mp.keySet();		Iterator
     
       it = keySet.iterator();		while(it.hasNext()) {			int key=it.next();			int val=mp.get(key);			if(val==1) {				cur.next=new ListNode(key);				cur=cur.next;			}		}		return curN.next;    }}
     
    
   

借鉴别人的思路：

/* public class ListNode {    int val;    ListNode next = null;    ListNode(int val) {        this.val = val;    }}*/import java.util.*;public class Solution {    public ListNode deleteDuplication(ListNode pHead)    {        ListNode curN=new ListNode(-1);		curN.next=pHead;		ListNode pre=curN;		ListNode last=curN.next;		while(last!=null) {			if(last.next!=null && last.val==last.next.val) {				while(last.next!=null &&last.val==last.next.val) {					last=last.next;				}				pre.next=last.next;				last=last.next;			}else {				pre=pre.next;				last=last.next;			}		}		return curN.next;    }}