该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
例子:
package wbb;
import java.util.HashMap;
public class test1 {
public static void main(String[] args) {
HashMap hm = new HashMap();
hm.put("周瑜","小乔");
hm.put("吕布","貂蝉");
boolean a=hm.containsValue("小乔");
boolean b=hm.containsKey("李白");
System.out.println(a);
System.out.println(b);
boolean c=hm.isEmpty();
System.out.println(c);
hm.clear();
boolean d=hm.containsKey("吕布");
System.out.println(d);
}
}
HashMap底层数据是哈希表,元素无序唯一,唯一靠元素重写equals方法和hashcode方法实现
String Integer 默认重写了equals方法和hashcode方法。
TreeMap数据结构是红黑树特点:元素唯一,并且可以排序
package wbb;
import java.util.Set;
import java.util.TreeMap;
class test2 {
public static void main(String[] args) {
TreeMap tm = new TreeMap();
tm.put(1, "梨");
tm.put(3,"苹果");
tm.put(2, "香蕉");
Set keySet = tm.keySet();
for(Integer key: keySet){
System.out.println(key+"..."+tm.get(key));
}
}