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

package main
import . "nc_tools"

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func deleteDuplicates(head *ListNode) *ListNode {
 	if head==nil||head.Next==nil{
		return head
	}
	res :=&ListNode{}
	temp:=res
	m := map[int]int{}
	ints := []int{}
	for head!=nil {
		m[head.Val]++
		ints = append(ints, head.Val)
		head=head.Next
	}
	for i, _ := range ints {
		if m[ints[i]]==1{
			temp.Next=&ListNode{
				Val: ints[i],
			}
			temp=temp.Next
		}
	}
	return res.Next
}