Collection Set&HashSet&TreeSet(HashMap实现，去重特性)

一、HashSet

1. 虑重功能特性(HashMap实现)

2. put(key) 如果重复返回false

  /**
     * Adds the specified element to this set if it is not already present.
     * More formally, adds the specified element <tt>e</tt> to this set if
     * this set contains no element <tt>e2</tt> such that
     * <tt>(e==null&nbsp;?&nbsp;e2==null&nbsp;:&nbsp;e.equals(e2))</tt>.
     * If this set already contains the element, the call leaves the set
     * unchanged and returns <tt>false</tt>.
     *
     * @param e element to be added to this set
     * @return <tt>true</tt> if this set did not already contain the specified
     * element
     */
    public boolean add(E e) {
        return map.put(e, PRESENT)==null;    // 重复返回false
    }

原文地址：https://www.cnblogs.com/qishuai/p/9053490.html