map集合中的添加方法put(k,v)

package com.day15.Map;

import java.util.Collection;
import java.util.HashMap;
import java.util.Map;

public class MapOne {

  public static void main(String[] args) {
    fun();
    info();
    Map<String, Integer> ma=new HashMap<>();
    ma.put("Kobe",20);
    ma.put("KG",21);
    ma.put("PP",22);
    Collection<Integer> c=ma.values();
    System.out.println(c);//[22, 20, 21]
    System.out.println(ma.size());//3

  }

  private static void info() {
    Map<String, Integer> ma=new HashMap<>();
    ma.put("Kobe",20);
    ma.put("KG",21);
    ma.put("PP",22);
    Integer va=ma.remove("Kobe");//根据键删除值,返回值
    System.out.println(va);//20
    System.out.println(ma);//{PP=22, KG=21}
  }

  private static void fun() {
    Map<String, Integer> ma=new HashMap<>();
    Integer i1=ma.put("Kobe",20);
    Integer i2=ma.put("KG",21);
    Integer i3=ma.put("PP",22);
    Integer i4=ma.put("Kobe",21);//相同的键不存,值覆盖
    System.out.println(ma);//{PP=22, Kobe=21, KG=21}
    System.out.println(i1);//null
    System.out.println(i2);//null
    System.out.println(i3);//null
    System.out.println(i4);//20 返回被覆盖的20
  }

}

猜你喜欢

转载自www.cnblogs.com/zhujialei123/p/9033738.html