【Java】Map之HashMap

最新推荐文章于 2024-05-02 18:49:36 发布

小屁孩2013

最新推荐文章于 2024-05-02 18:49:36 发布

阅读量920

点赞数

分类专栏： Java 文章标签： Java HashMap

本文链接：https://blog.csdn.net/u010119170/article/details/24929141

版权

Java 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

1.构造函数

HashMap()

Constructs an empty HashMap with the default initial capacity (16) and the default load factor (0.75).

HashMap(int initialCapacity)

Constructs an empty HashMap with the specified initial capacity and the default load factor (0.75).

HashMap(int initialCapacity, float loadFactor)

Constructs an empty HashMap with the specified initial capacity and load factor.

HashMap(Map<? extends K,? extends V> m)

Constructs a new HashMap with the same mappings as the specified Map.

2.方法摘要

`void`	`clear()` Removes all of the mappings from this map.
`Object`	`clone()` Returns a shallow copy of this `HashMap` instance: the keys and values themselves are not cloned.
`boolean`	`containsKey(Object key)` Returns `true` if this map contains a mapping for the specified key.
`boolean`	`containsValue(Object value)` Returns `true` if this map maps one or more keys to the specified value.
`Set<Map.Entry<K,V>>`	`entrySet()` Returns a `Set` view of the mappings contained in this map.
`V`	`get(Object key)` Returns the value to which the specified key is mapped, or `null` if this map contains no mapping for the key.
`boolean`	`isEmpty()` Returns `true` if this map contains no key-value mappings.
`Set<K>`	`keySet()` Returns a `Set` view of the keys contained in this map.
`V`	`put(K key, V value)` Associates the specified value with the specified key in this map.
`void`	`putAll(Map<? extends K,? extends V> m)` Copies all of the mappings from the specified map to this map.
`V`	`remove(Object key)` Removes the mapping for the specified key from this map if present.
`int`	`size()` Returns the number of key-value mappings in this map.
`Collection<V>`	`values()` Returns a `Collection` view of the values contained in this map.

3 程序实例

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;

public class HashMapInstance {

	public static void main(String[] args) {

		// 创建一个HashMap
		Map<String, Integer> map = new HashMap<String, Integer>();
		// 判断一个Map是否是空
		System.out.println("--Is the map empty? --" + map.isEmpty());

		// 向Map中添加几个键值对
		map.put("A", 1);
		map.put("B", 2);
		map.put("C", 3);
		map.put("D", 4);
		map.put("E", 5);

		// 获取Map的大小并打印Map
		System.out.println("The size of Map is " + map.size());
		System.out.println(map);

		// 查看Map中是否存在某个键
		System.out.println("Contains Key A :" + map.containsKey("A"));
		System.out.println("Contains Key Z :" + map.containsKey("Z"));

		// 查看Map中是否存在某个值
		System.out.println("Contains Value 1 :" + map.containsValue(1));
		System.out.println("Contains Value 10 :" + map.containsValue(10));

		// 打印Map中的所有键及所有值
		System.out.println(map.keySet());
		System.out.println(map.values());

		// 获取Map某个键对应的值,如果没有返回null
		System.out.println(map.get("A"));
		System.out.println(map.get("X"));

		// 从Map中移除键为指定内容的键值对
		System.out.println(map.remove("B"));
		System.out.println(map);

		// 将Map清空
		map.clear();
		System.out.println(map);

		// 遍历hashMap的方法一(相对而言更高效)
		Iterator<Entry<String, Integer>> iterator = map.entrySet().iterator();
		while (iterator.hasNext()) {
			Map.Entry<String, Integer> entry = iterator.next();

			String key = entry.getKey();
			Integer value = entry.getValue();
			System.out.println("Key=" + key + "\t Value" + value);
		}

		// 遍历hashMap的方法二(相对而言效率比前者低一些)
		Iterator<String> iterator2 = map.keySet().iterator();
		while (iterator2.hasNext()) {
			String key = iterator2.next();
			Integer value = map.get(key);
			System.out.println("Key=" + key + "\t Value" + value);
		}
	}
}