Map集合

Map集合

Map集合概述

interface Map<K,V> K：键的类型；V：值的类型

Map集合的特点:

​ 键值对映射关系

​ 一个键对应一个值

​ 键不能重复，值可以重复 （键重复，会覆盖前面键中的值）

​ 元素存取无序

package com.itxuexi.it16.map01;

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

public class mapDemo {
    public static void main(String[] args) {
        //创建集合
        Map<String,String> map = new HashMap<String,String>();

        //put(k key ,v value) 将指定的值与该映射中的指定键相关联
        map.put("张三","河南");
        map.put("刘月","山东");
        map.put("曲令","江西");
        map.put("李欢","江西");

        //输出集合对象
        System.out.println(map);

    }
}

Map集合的成员方法

方法名	说明
V put(K key,V value)	添加元素
V remove(Object key)	根据键删除键值对元素
void clear()	移除所有的键值对元素
boolean containsKey(Object key)	判断集合是否包含指定的键
boolean containsValue(Object value)	判断集合是否包含指定的值
boolean isEmpty()	判断集合是否为空
int size()	集合的长度，也就是集合中键值对的个数

package com.itxuexi.it16.map01;

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

public class mapDemo2 {
    public static void main(String[] args) {
        //创建集合对象
        Map<String,String> map = new HashMap<String,String>();

        //添加元素put
        map.put("001","张悦");
        map.put("002","刘静");
        map.put("003","liliy");


        //判断集合是否包含指定的键 Boolean
        System.out.println(map.containsKey("002"));

        //判断集合是否包含指定的值 Boolean
        System.out.println(map.containsValue("liliy"));

        //判断集合是否为空 Boolean
        System.out.println(map.isEmpty());

        //集合的长度，也就是集合中键值对的个数
        System.out.println(map.size());

        //根据键删除键值对元素 remove
        map.remove("001");
        //不会报错 null
        System.out.println(map.remove("001"));

        //移除所有的键值对元素
        map.clear();

        System.out.println(map);

    }
}

Map集合的成员方法（二）

方法名	说明
V get(Object key)	根据键获取值
Set keySet()	获取所有键的集合
Collection values()	获取所有值的集合
Set<Map.Entry<K,V>> entrySet()	获取所有键值对对象的集合

package com.itxuexi.it16.map01;

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

public class mapDemo3 {
    public static void main(String[] args) {
        //创建集合
        Map<String,String> map = new HashMap<String, String>();

        //往集合中添加元素
        map.put("001","array");
        map.put("002","liliy");
        map.put("003","haha");

        //根据键获取值
        System.out.println(map.get("002"));

        //获取所有键的集合
        System.out.println(map.keySet());
        //循环获取 所有键
        Set<String> ke = map.keySet();
        for(String s : ke){
            System.out.println(s);
        }

        //获取所有值的集合
        System.out.println(map.values());
        //循环获取 所有值
        Collection<String> vs = map.values();
        for(String s : vs){
            System.out.println(s);
        }
        
    }
}

练习

package com.itxuexi.it16.map01;
/*
遍历思路
把所有的丈夫给集中起来
遍历丈夫的集合，获取到每一个丈夫
根据丈夫去找对应的妻子

转换为Map集合中的操作：
获取所有键的集合。用keySet()方法实现
遍历键的集合，获取到每一个键。用增强for实现	
根据键去找值。用get(Object key)方法实现

*/
import java.util.HashMap;
import java.util.Map;
import java.util.Set;

public class mapDemo4 {
    public static void main(String[] args) {
        Map<String,String> map = new HashMap<String, String>();

        map.put("zhangfu01","qizhi01");
        map.put("zhangfu02","qizhi02");
        map.put("zhangfu03","qizhi03");
        map.put("zhangfu04","qizhi04");

        //获取所有键的集合
        Set<String> st = map.keySet();

        //遍历键的集合，获取到每一个键
        for(String s : st){
            // 根据键去找值
            String value = map.get(s);
            System.out.println("key:" + s + "," + "value:" + value);
        }

    }
}

package com.itxuexi.it16.map01;

import java.util.HashMap;
import java.util.Map;
import java.util.Set;

public class mapDemo5 {
    public static void main(String[] args) {
        Map<String,String> map = new HashMap<String, String>();

        map.put("zhangfu01","qizhi01");
        map.put("zhangfu02","qizhi02");
        map.put("zhangfu03","qizhi03");
        map.put("zhangfu04","qizhi04");

        Set<Map.Entry<String,String>> se = map.entrySet();

      for (Map.Entry<String,String> me : se){
          String key = me.getKey();
          String value = me.getValue();
          System.out.println(key + "," + value);
      }

    }
}

HashMap集合练习之键是String，值是Student

创建一个HashMap集合，键是学号(String)，值是学生对象(Student)。存储三个键值对元素，并遍历

package com.itxuexi.it16.map02;

public class Student {
    private String name;
    private  int number;

    public Student() {
    }

    public Student(String name, int number) {
        this.name = name;
        this.number = number;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getNumber() {
        return number;
    }

    public void setNumber(int number) {
        this.number = number;
    }
}
//--------------------------------------------------------------

package com.itxuexi.it16.map02;

import java.util.HashMap;
import java.util.Map;
import java.util.Set;

public class StudentMap {
    public static void main(String[] args) {
        HashMap<String,Student> hm = new HashMap<String,Student>();

         //
        Student s1 = new Student("lili",12);
        Student s2 = new Student("anan",15);
        Student s3 = new Student("huahua",13);
        Student s4 = new Student("niuniu",14);

        hm.put("001",s1);
        hm.put("002",s2);
        hm.put("003",s3);
        hm.put("004",s4);

        //键找值
        Set<String> st = hm.keySet();
        for(String key : st){
            Student value = hm.get(key);
            System.out.println(key + "," + value.getName() + "," + value.getNumber());
        }
        System.out.println("--------------------------");

        //键值对对象找键和值
        Set<Map.Entry<String,Student>> sae = hm.entrySet();
        for(Map.Entry<String,Student> me : sae){
            String key = me.getKey();
            Student value = me.getValue();
            System.out.println(key + "," + value.getName() + "," + value.getNumber());

        }


    }
}

HashMap集合练习之键Student，值是String

package com.itxuexi.it16.map03;

public class Student {
    private String name;
    private int age;

    public Student() {
    }

    public Student(String name, int age) {
        this.name = name;
        this.age = age;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;

        Student student = (Student) o;

        if (age != student.age) return false;
        return name != null ? name.equals(student.name) : student.name == null;
    }

    @Override
    public int hashCode() {
        int result = name != null ? name.hashCode() : 0;
        result = 31 * result + age;
        return result;
    }
}
//----------------------------------------------
package com.itxuexi.it16.map03;

import java.util.HashMap;
import java.util.Map;
import java.util.Set;

public class StudentMap {
    public static void main(String[] args) {
        HashMap<Student,String> hm = new HashMap<Student,String>();

        //创建学生对象
        Student s1 = new Student("张三",13);
        Student s2 = new Student("李四",15);
        Student s3 = new Student("王五",13);
        Student s4 = new Student("李四",17);
        Student s5 = new Student("李四",17);


        //将对象加入到集合中
        hm.put(s1,"001");
        hm.put(s2,"002");
        hm.put(s3,"003");
        hm.put(s4,"004");
        hm.put(s5,"005");


        Set<Student> sk = hm.keySet();
        for(Student key : sk){
            String value = hm.get(key);
            System.out.println(key.getName() + "," + key.getAge() + "," + value);
        }

    }
}

集合嵌套之ArrayList嵌套HashMap

创建一个ArrayList集合，存储三个元素，每一个元素都是HashMap

每一个HashMap的键和值都是String，并遍历。

package com.itxuexi.it16.map04;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Set;

public class ArrayListHash {
    public static void main(String[] args) {
        //创建ArrayList集合
        ArrayList<HashMap<String,String>> arr = new ArrayList<HashMap<String, String>>();

        //创建HashMap集合
        HashMap<String,String> hm1 = new HashMap<String, String>();
        hm1.put("小学","一年级");
        hm1.put("中学","二年级");
        hm1.put("高中","三年级");
        hm1.put("大学","四年级");

        HashMap<String,String> hm2 = new HashMap<String, String>();
        hm2.put("小学","1年级");
        hm2.put("中学","2年级");
        hm2.put("高中","3年级");
        hm2.put("大学","4年级");


        HashMap<String,String> hm3 = new HashMap<String, String>();
        hm3.put("小学","一年级");
        hm3.put("中学","二年级");
        hm3.put("高中","三年级");
        hm3.put("大学","四年级");

        //把HashMap作为元素添加到ArrayList集合
        arr.add(hm1);
        arr.add(hm2);
        arr.add(hm3);

        //遍历ArrayList集合
        for (HashMap<String,String> hm : arr){
            Set<String> keyset = hm.keySet();
            for(String key : keyset){
                String value = hm.get(key);
                System.out.println(key + "," + value);

            }
        }
        
    }
}

集合嵌套之HashMap嵌套ArrayList

package com.itxuexi.it16.map04;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Set;

public class HashMapArray {
    public static void main(String[] args) {
        //创建HashMap集合
        HashMap<String, ArrayList<String>> hma = new HashMap<String,ArrayList<String>>();

        //创建ArrayList
        ArrayList<String> sgyy = new ArrayList<String>();
        sgyy.add("周瑜");
        sgyy.add("小乔");

        ArrayList<String> xyj = new ArrayList<String>();
        xyj.add("孙悟空");
        xyj.add("白龙马");

        ArrayList<String> shz = new ArrayList<String>();
        shz.add("武松");
        shz.add("鲁智深");

        //把ArrayList作为元素添加到HashMap集合
        hma.put("三国演义",sgyy);
        hma.put("西游记",xyj);
        hma.put("水浒传",shz);

        System.out.println(hma);

        //遍历HashMap集合
        Set<String > keyset = hma.keySet();
        for(String key: keyset){
            System.out.println(key);
            ArrayList<String> value = hma.get(key);
            for(String s : value){
                System.out.println("\t" + s);
            }
        }
    }
}

统计字符串中每个字符出现的次数

package com.itxuexi.it16.map04;

import java.util.HashMap;
import java.util.Scanner;
import java.util.Set;

public class HashMapDemo01 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("请输入你的字符串");
        String line = sc.nextLine();

        //创建HashMap集合，键是Character （char），值是Integer (int)
        HashMap<Character,Integer> hm = new HashMap<Character, Integer>();

        //遍历字符串，得到每一个字符
        for(int i = 0;i<line.length();i++){
            char key = line.charAt(i);

            //拿得到的每一个字符作为键到HashMap集合中去找对应的值，看其返回值
            Integer value = hm.get(key);

            //如果返回值是null：说明该字符在HashMap集合中不存在，就把该字符作为键，1
            if (value == null){
                hm.put(key,1);
            }else{
                //如果返回值不是null：说明该字符在HashMap集合中存在，把该值加1，然后重新存储该字符和对应的值
                value++;
                hm.put(key,value);
            }
        }

        //遍历HashMap集合，得到键和值，按照要求进行拼接
        StringBuilder sb = new StringBuilder();

        Set<Character> keyset = hm.keySet();
        for(Character key:keyset){
            Integer value = hm.get(key);
            sb.append(key).append("(").append(value).append(")");
        }

        String result = sb.toString();
        
		//输出结果
        System.out.println(result);

    }
}

Collections集合工具类

Collections类的作用：是针对集合操作的工具类

Collections类常用方法：

public static void sort(List list) 将指定的列表按升序排序

public static void reverse(List list) 反转指定列表中元素的顺序

public static void shuffle(List list) 使用默认的随机源随机排列指定的列表

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class CollectionsDemo01 {
    public static void main(String[] args) {
        //创建集合对象
        List<Integer> li = new ArrayList<Integer>();

        //添加元素
        li.add(10);
        li.add(50);
        li.add(20);
        li.add(30);

        //sotr 升序排序
        Collections.sort(li);
        System.out.println(li);

        //reverse 反转指定列表中元素的顺序
        Collections.reverse(li);
        System.out.println(li);

        //shuffle 使用默认的随机源随机排列指定的列表
        Collections.shuffle(li);
        System.out.println(li);

练习题

通过程序实现斗地主过程中的洗牌，发牌和看牌。要求：对牌进行排序

package com.itxuexi.it16.Collections03;

import java.util.ArrayList;
import java.util.Collections;

public class PokerDemo01 {
    public static void main(String[] args) {
        //创建集合，即牌盒
        ArrayList<String> arr = new ArrayList<String>();

        //定义花色数组
        String[] colors = {"♦", "♣", "♥", "♠"};
        //定义点数组
        String[] numbers = {"2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A"};

        //创建牌
        for (String color : colors) {
            for (String number : numbers) {
                arr.add(color + number);
            }
        }
        arr.add("大王");
        arr.add("小王");

        //洗牌
        Collections.shuffle(arr);

        //发牌，也就是遍历集合，给三个玩家发牌
        ArrayList<String> poker01 = new ArrayList<>();
        ArrayList<String> poker02 = new ArrayList<>();
        ArrayList<String> poker03 = new ArrayList<>();
        ArrayList<String> poker04 = new ArrayList<>();

        for (int i = 0; i < arr.size(); i++) {
            String poker = arr.get(i);
            if (i >= arr.size() - 3) {
                poker04.add(poker);
            } else if (i % 3 == 0) {
                poker03.add(poker);
            } else if (i % 3 == 1) {
                poker02.add(poker);
            } else if(i%3 == 2){
                poker01.add(poker);
            }
        }

        //看牌
        lookPoker("lili",poker01);
        lookPoker("anan",poker02);
        lookPoker("shaly",poker03);
        lookPoker("底牌",poker04);

    }

    //循环看牌 poker01
    public static void lookPoker(String name,ArrayList<String> array){
        System.out.println(name + "的牌是：" + array);
        for (String s : array){
            System.out.print(s);
        }
        System.out.println();
    }

}

通过程序实现斗地主过程中的洗牌，发牌和看牌。要求：对牌进行排序

package com.itxuexi.it16.Collections03;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeSet;

public class PokerDemo02 {
    public static void main(String[] args) {
        //创建HashMap，键是编号，值是牌
        HashMap<Integer, String> hm = new HashMap<Integer, String>();

        //创建ArrayList，存储编号
        ArrayList<Integer> array = new ArrayList<Integer>();

        //创建花色数组和点数数组
        String[] colors = {"♦", "♣", "♥", "♠"};
        String[] numbers = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2"};

        //从0开始往HashMap里面存储编号，并存储对应的牌。同时往ArrayList里面存储编号
        int index = 0;

        for (String number : numbers) {
            for (String color : colors) {
                hm.put(index, color + number);
                array.add(index);
                index++;
            }
        }

        hm.put(index, "小王");
        array.add(index);
        index++;
        hm.put(index, "大王");
        array.add(index);

        //洗牌(洗的是编号)，用Collections的shuffle()方法实现
        Collections.shuffle(array);

        //发牌(发的也是编号，为了保证编号是排序的，创建TreeSet集合接收)
        TreeSet<Integer> lqxSet = new TreeSet<Integer>();
        TreeSet<Integer> lySet = new TreeSet<Integer>();
        TreeSet<Integer> fqySet = new TreeSet<Integer>();
        TreeSet<Integer> dpSet = new TreeSet<Integer>();

        for (int i = 0; i < array.size(); i++) {
            int x = array.get(i);
            if (i >= array.size() - 3) {
                dpSet.add(x);
            } else if (i % 3 == 0) {
                lqxSet.add(x);
            } else if (i % 3 == 1) {
                lySet.add(x);
            } else if (i % 3 == 2) {
                fqySet.add(x);
            }
        }

        //调用看牌方法
        lookPoker("林青霞", lqxSet, hm);
        lookPoker("柳岩", lySet, hm);
        lookPoker("风清扬", fqySet, hm);
        lookPoker("底牌", dpSet, hm);
    }
//定义方法看牌(遍历TreeSe


    //定义方法看牌(遍历TreeSet集合，获取编号，到HashMap集合找对应的牌)
    public static void lookPoker(String name, TreeSet<Integer> ts, HashMap<Integer, String> hm) {
        System.out.print(name + "的牌是：");
        for (Integer key : ts) {
            String poker = hm.get(key);
            System.out.print(poker + " ");
        }
        System.out.println();
    }


}