斗地主升级版-玩家牌按照顺序排列

import sun.reflect.generics.tree.Tree;

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

public class Poker {
    public static void main(String[] args) {
//        ArrayList<String> arr =new ArrayList<String>();
        ArrayList<String>tr =new ArrayList<String>();
        HashMap<Integer, String> hs=new HashMap<Integer, String>();
        ArrayList<Integer> arr =new ArrayList<Integer>();
        TreeSet<Integer> lqxarr =new TreeSet<Integer>();
        TreeSet<Integer> lyarr =new TreeSet<Integer>();
        TreeSet<Integer> smarr =new TreeSet<Integer>();
        TreeSet<Integer> dparr =new TreeSet<Integer>();
   String [] colors ={"hongtao","heitao","fangpian","meihua"};
   String [] number ={"3","4","5","6","7","8","9","10","J","Q","k","A","2"};
   int index =0;
   for(int i=0;i<number.length;i++){
       for(int k=0;k<colors.length;k++){
           tr.add(colors[k]+number[i]);

           hs.put(index,tr.get(index));
           arr.add(index);
           index++;
       }
   }
        System.out.println(index);
         arr.add(index);
         tr.add("xiaowang");
         hs.put(index,tr.get(index));
         index ++;
         arr.add(index);
         tr.add("dawang");
         hs.put(index,tr.get(index));
//        Collections.shuffle(arr);
   for(int i=0;i<arr.size();i++){
//       System.out.println(arr1);
       if(i>=arr.size()-3)
       {

           dparr.add( arr.get(i));

       }
       else if(i%3==0)

       {
           lqxarr.add(arr.get(i));
       }
       else if(i%3==1)

       {
           lyarr.add(arr.get(i));
       }
       else if(i%3==2)

       {
           smarr.add(arr.get(i));
       }
   }
        lookPoker("lingqingxia",lqxarr,hs);
        lookPoker("liouyan",lyarr,hs);
        lookPoker("sanmao",smarr,hs);
        lookPoker("dipai",dparr,hs);
       for(int h:hs.keySet()) {
           System.out.println(h+" "+hs.get(h));
       }
    }
    public static  void lookPoker(String name,TreeSet<Integer> array,HashMap<Integer, String> hs){

        System.out.print(name +"de pai is ");
        for(Integer in :array) {
            String value = hs.get(in);

            System.out.print( value+ " ");
        }
        System.out.println("\t");


    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值