Os:windows7 x64
Jdk:jdk-8u131-windows-x64
Ide:eclipse Oxygen Release (4.7.0)
Code
Package Jizuiku0;import java.util.hashmap;/* * @version V17.09 */public class mapdemo_100 {public static void main (string[ ] args) {hashmap<integer, string> HM = init (); SYSTEM.OUT.PRINTLN (HM); System.out.println ("contains key 1?") +hm.containskey (1)); System.out.println ("Contains value Hello World?") +hm.containsvalue ("Hello World");} public static Hashmap<integer, string> init () {hashmap<integer, string> HM = new Hashmap<integer, STRING&G t; ();//The keys here are scrambled when added, but there is an interesting phenomenon in the output//To know the reason behind this phenomenon, it is necessary to understand the underlying code implementation//So-called convoluted, hm.put (1, "Beidou first yangming greedy wolf too star June"); Hm.put (2, "Beidou second Yin Jing giant door Yuan June"); Hm.put (5, "Beidou fifth Dan Yuanlian Zhen gang xing June"); Hm.put (6, "Beidou sixth Arctic Congus June"), Hm.put (7, "Beidou Seventh-day Army Guan Xingjun"); Hm.put (3, "Beidou third blessing Good LU save true star June") ; Hm.put (4, "Beidou Four Xuan the new star June"); Hm.put (8, "Beidou eighth left auxiliary hole star June"), Hm.put (9, "Beidou nineth right, Hidden light star June"); return HM;}
Result
Java is good, worth learning. Java is good, worth learning.
Learning Resources: API manual +java Source + pure heart.
JavaSE8 Base hashmap<integer,string> Containskey/value Determines whether the collection contains the specified key or value