Set接口实现类-LinkedHashSet

1) LinkedHashSet是 HashSet的子类

2) LinkedHashSet底层是一个 LinkedHashMap，底层维护了一个数组+双向链表

3)LinkedHashSet根据元素的hashCode值来决定元素的存储位置，同时使用链表维护元素的次序(图)，这使得元素看起来是以插入顺序保存的

4) LinkedHashSet不允许添重复元素

LinkedHashSet的代码练习

package com.hspedu.set_;

import java.util.LinkedHashSet;

import java.util.Objects;

/**

* LinkedHashSet练习题 LinkedHashSetexercIsejavaCar

* 类(属性:name,price)，如果name 和price一样

* 则认为是相同元素，就不能添加。

*/

public class LinkedHashSetExercise {

public static void main(String[] args) {

LinkedHashSet linkedHashSet = new LinkedHashSet();

linkedHashSet.add(new Car("奥迪", 100000));

linkedHashSet.add(new Car("奥迪", 100000));

linkedHashSet.add(new Car("奔驰", 200000));

linkedHashSet.add(new Car("宝马", 800000));

linkedHashSet.add(new Car("宝马", 800000));

linkedHashSet.add(new Car("大众", 900000));

System.out.println("linkedHashSet=" + linkedHashSet);

}

}

class Car {

private String name;

private int price;

public Car(String name, int price) {

this.name = name;

this.price = price;

}

public String getName() {

return name;

}

public void setName(String name) {

this.name = name;

}

public int getPrice() {

return price;

}

public void setPrice(int price) {

this.price = price;

}

@Override

public String toString() {

return "Car{" +

"name='" + name + '\'' +

", price=" + price +

'}';

}

@Override

public boolean equals(Object o) {

if (this == o) return true;

if (o == null || getClass() != o.getClass()) return false;

Car car = (Car) o;

return price == car.price && Objects.equals(name, car.name);

}

@Override

public int hashCode() {

return Objects.hash(name, price);

}

}