HashSet,TreeSet,LinkedHashSet都不允许元素有重复,如果有重复,则选取一个元素放入容器。同样,
HashMap,TreeMap,LinkedHashMap也不允许key有重复,但如果key重复,应该选取这个key对应的哪个值放入容器呢?做了一下测试:
public class Test {
public static Map putSome(Map<String,String> map){
map.put("gender", "Male");
map.put("name", "Athor");
map.put("name", "Cindy");
map.put("name", "Billy");
map.put("from","China");
return map;
}
public static void main(String[] args) {
System.out.println(putSome(new HashMap<String,String>()));
System.out.println(putSome(new TreeMap<String,String>()));
System.out.println(putSome(new LinkedHashMap<String,String>()));
}
}
/* output result: */
{name=Billy, gender=Male, from=China}
{from=China, gender=Male, name=Billy}
{gender=Male, name=Billy, from=China}
可见不论是Map的哪个子类,键name对应的值都是Billy,即最后一个name的键值对,它覆盖了之前的name键值对。
如若转载,请说明出处!http://blog.youkuaiyun.com/xukunddp