Case - simulated landlords (upgraded version)

 

package it.com;

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

public class shnegjiPoker {
    public static void main(String[] args) {
        // establish HashMap, The key is the number , The value is a card 
        HashMap<Integer, String> hm = new HashMap<>();

        // establish ArrayList, Storage number 
        ArrayList<Integer> array = new ArrayList<>();

        // Create a decor array and a point array 
        String[] colors = {"", "", "", ""};
        String[] numbers = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A"};

        // from 0 Start to go HashMap It stores the number , And store the corresponding cards , At the same time to ArrayList The number is stored inside 
        int index = 0;

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

        // Shuffle ( Washing No ), use Collections Of shuffle() Method realization 
        Collections.shuffle(array);

        // Licensing （ It's also a number , In order to ensure that the numbers are sorted , establish TreeSet Collection acceptance ）
        TreeSet<Integer> funong = new TreeSet<>();
        TreeSet<Integer> zhongnong = new TreeSet<>();
        TreeSet<Integer> pinnong = new TreeSet<>();
        TreeSet<Integer> dipai = new TreeSet<>();

        for (int i = 0; i < array.size(); i++) {
            int x = array.get(i);
            if (i >= array.size() - 3) {
                dipai.add(x);
            } else if (i % 3 == 0) {
                funong.add(x);
            } else if (i % 3 == 1) {
                zhongnong.add(x);
            } else if (i % 3 == 2) {
                pinnong.add(x);

            }
        }
        // Call the card reading method 
        lookPoker(" Rich peasants ",funong,hm);
        lookPoker(" Middle peasants ",zhongnong,hm);
        lookPoker(" The poor peasants ",pinnong,hm);
        lookPoker(" a hand ",dipai,hm);
    }
    // Define how to look at cards （ Traverse TreeSet aggregate , Get number , To HashMap Set to find the corresponding card ）
    public static void lookPoker(String name, TreeSet<Integer> ts, HashMap<Integer, String> hm) {
        System.out.println(name + " The card is ：");
        for (Integer key : ts) {
            String poker = hm.get(key);
            System.out.print(poker + " ");
        }
        System.out.println();
    }

}