JAVA面试14-Set

HashSet 无重复元素的无序集合 实际是HashMap

 public HashSet() {
        map = new HashMap<>();
    }

无重复 且 无序

public class T20 {
    public static void main(String[] args) {
        HashSet hashSet=new HashSet<>();
        hashSet.add("xixi");
        hashSet.add("lili");
        hashSet.add("cici");
        hashSet.add("lili");
        hashSet.remove("xixi");
        System.out.println(hashSet); //[cici, lili]
    }
}

默认容量16 每次扩充0.75倍

 static final int DEFAULT_INITIAL_CAPACITY = 1 << 4;//16
 public HashSet(Collection<? extends E> c) {
        map = new HashMap<>(Math.max((int) (c.size()/.75f) + 1, 16));
        addAll(c);
    }

hash

 static final int hash(Object key) {
        int h;
        return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
    }

value

public boolean add(E e) {
        return map.put(e, PRESENT)==null;
    }
private static final Object PRESENT = new Object();

LinkedHashSet hashCode决定存储位置，链表维护元素次序

 1 public LinkedHashSet() {
        super(16, .75f, true);
    }
 2 HashSet(int initialCapacity, float loadFactor, boolean dummy) {
        map = new LinkedHashMap<>(initialCapacity, loadFactor);
    }
 3 public LinkedHashMap(int initialCapacity, float loadFactor) {
        super(initialCapacity, loadFactor);
        accessOrder = false;
    }
 4 public HashMap(int initialCapacity, float loadFactor) {
        if (initialCapacity < 0)
            throw new IllegalArgumentException("Illegal initial capacity: " +  initialCapacity);
        if (initialCapacity > MAXIMUM_CAPACITY)
            initialCapacity = MAXIMUM_CAPACITY;
        if (loadFactor <= 0 || Float.isNaN(loadFactor))
            throw new IllegalArgumentException("Illegal load factor: " +loadFactor);
        this.loadFactor = loadFactor;
        this.threshold = tableSizeFor(initialCapacity);
    }

根据插入顺序输出

public class T20 {
    public static void main(String[] args) {
        LinkedHashSet linkedHashSet=new LinkedHashSet();
        linkedHashSet.add("xixi");
        linkedHashSet.add("cici");
        linkedHashSet.add("lili");
        linkedHashSet.remove("xixi");
        System.out.println(linkedHashSet);//[cici, lili]

    }
}

public class T20 {
    public static void main(String[] args) {
        LinkedHashSet linkedHashSet=new LinkedHashSet();
        linkedHashSet.add("xixi");
        linkedHashSet.add("lili");
        linkedHashSet.add("cici");
        linkedHashSet.remove("xixi");
        System.out.println(linkedHashSet);//[lili, cici]

    }
}

TreeSet 实现了自动排序

  public TreeSet() {
        this(new TreeMap<E,Object>());
    }
  TreeSet(NavigableMap<E,Object> m) {
        this.m = m;
    }
 private transient NavigableMap<E,Object> m;
 public interface NavigableMap<K,V> extends SortedMap<K,V>

自动排序

public class T20 {
    public static void main(String[] args) {
        TreeSet treeSet=new TreeSet();
        treeSet.add("xixi");
        treeSet.add("lili");
        treeSet.add("cici");
        treeSet.remove("xixi");
        System.out.println(treeSet);//[cici, lili]

    }
}