斗地主小游戏

package it_01;

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

public class Demo6 {
    public static void main(String[] args){
        HashMap<Integer,String> hashMap = new HashMap<>();
        ArrayList<Integer> arrayList = new ArrayList<>();
        String[] pic={"♦","♣","♠","♥"};
        String[] num={"2","3","4","5","6","7","8","9","10","J","Q","K","A"};
        int a =0,b=0;
        for(int i=0;i< num.length;i++){
            for(int j=0;j< pic.length;j++){
                hashMap.put(a++,pic[j]+num[i]);
                arrayList.add(b++);
            }
        }
        hashMap.put(52,"小王");
        hashMap.put(53,"大王");
        arrayList.add(52);
        arrayList.add(53);
//        System.out.println(hashMap);
//        System.out.println(arrayList);
        Collections.shuffle(arrayList);
        TreeSet<Integer> aTreeSet =new TreeSet<>();
        TreeSet<Integer> bTreeSet =new TreeSet<>();
        TreeSet<Integer> cTreeSet =new TreeSet<>();
        TreeSet<Integer> dTreeSet =new TreeSet<>();
        for(int i=0;i<arrayList.size();i++){
            if(i>=arrayList.size()-3){
                dTreeSet.add(arrayList.get(i));
            }else if(i%3==0){
                aTreeSet.add(arrayList.get(i));
            }else if(i%3==1){
                bTreeSet.add(arrayList.get(i));
            }else if(i%3==2){
                cTreeSet.add(arrayList.get(i));
            }
        }
       see("A",aTreeSet,hashMap);
       see("B",bTreeSet,hashMap);
       see("C",cTreeSet,hashMap);
       see("底牌",dTreeSet,hashMap);
    }
    public static void see(String name,TreeSet<Integer> treeSet,HashMap<Integer,String> hashMap){
        System.out.print(name+"的牌是 ");
        for(Integer nums:treeSet){
            System.out.print(hashMap.get(nums)+" ");
        }
        System.out.println();
    }

}





posted @ 2025-04-12 20:45  lfqyj  阅读(5)  评论(0)    收藏  举报