赞
踩
参考“时间、流水”博主的文章,稍微多加了一点东西。原文链接:https://blog.csdn.net/qq_52445563/article/details/125835619
侵权删
HashMap<object1, object2> hashmap = new HashMap<object1, object2>();
hashmap.put(object1, object2);
hashmap.put(object1, hashmap.getOrDefault((object1, 0) + 1));
object2 obj2 = hashmap.get(object1);
boolean contains(Object value) ——-确定哈希表内是否包含了给定的对象,若有返回true,否则false
Boolean bool = hashmap.containsKey( Object key );
Boolean bool = hashmap.containsValue( Object value );
hashmap.remove(object1);
hashmap.clear();
int size = hashmap.size();
for(object1 obj1 : hashmap.keySet()){
System.out.println(obj1 + hashmap.get(obj1));
}
for(object2 obj2 : hashmap.values()){
System.out.println(obj2);
}
Boolean bool = hashmap.isEmpty();
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。