java实现简单斗地主(看牌排序)

本文实例为大家分享了java实现简单斗地主的具体代码，供大家参考，具体内容如下

第一种方法

 
 
 
 
 public static void main(String[] args) {
 
 Map poker = new HashMap();
 List keys = new ArrayList();
 
 String[] colors = {"♠","♥","♦","♣"};
 String[] values = {"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
 
 int index = 0;
 for(String v : values){ //外层循环数，内层循环花色
 for(String c : colors){
 poker.put(index,c+v); //向map里添加key和值
 keys.add(index); //将key添加到list里，便于排序
 index++;
 }
 }
 poker.put(index, "小王");
 keys.add(index);
 index++;
 poker.put(index,"大王");
 keys.add(index);
 
 
 //洗牌
 Collections.shuffle(keys);
 
 //分牌
 List player01 = new ArrayList(); //创建玩家和底牌集合，专门盛key,根据key去map里去值
 List player02 = new ArrayList();
 List player03 = new ArrayList();
 List dipai = new ArrayList();
 
 for(int i=0; i=51){
 dipai.add(keys.get(i));
 }else if(i%3==0){
 player01.add(keys.get(i));
 }else if(i%3==1){
 player02.add(keys.get(i));
 }else if(i%3==2){
 player03.add(keys.get(i));
 }
 }
 
 //针对玩家和底牌排序
 player01.addAll(dipai);
 Collections.sort(player01);
 Collections.sort(player02);
 Collections.sort(player03);
 Collections.sort(dipai);
 
 
 System.out.println("玩家一(地主):");
 for(Integer key : player01){
 System.out.print(poker.get(key)+" ");
 }
 System.out.println("n玩家二:");
 for(Integer key : player02){
 System.out.print(poker.get(key)+" ");
 }
 System.out.println("n玩家三:");
 for(Integer key : player03){
 System.out.print(poker.get(key)+" ");
 }
 System.out.println("n底牌:");
 for(Integer key : dipai){
 System.out.print(poker.get(key)+" ");
 }
 }

第二种方法

public static void main(String[] args) {
 
 //保存编号和扑克牌的对应关系
 HashMap poker = new HashMap();
 //保存扑克牌的编号
 List list = new ArrayList();
 
 String[] colors = {"♥","♠","♦","♣"};
 String[] values = {"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
 
 //把这两个字符串放进HashMap集合中（拼接一起 花色+牌号）同时给每个放进去牌进行编码0--52并存储
 int count = 0;
 for(String v : values){
 for(String color : colors){
 //拼接
 String pk = color.concat(v);
 //把编码和牌存储到HashMap中
 poker.put(count, pk);   
 //把编码存到ArrayList中
 list.add(count);   
 count ++;
 }
 }
 
 poker.put(count, "小王");
 list.add(count);
 count++;
 
 poker.put(count, "大王");
 list.add(count);
 
// for(Integer i :list){
// System.out.print(i+" ");
// }
 
 Collections.shuffle(list);
 
 
 TreeSet player01 = new TreeSet();
 TreeSet player02 = new TreeSet();
 TreeSet player03 = new TreeSet();
  TreeSet dipai = new TreeSet();
 
  for(int i=0; i=51){
 dipai.add(list.get(i));
 }
 else if(i%3 == 0){
 player01.add(list.get(i));
 }
 else if(i%3 == 1){
 player02.add(list.get(i));
 }
 else if(i%3 == 2){
 player03.add(list.get(i));
 }
 }
  
  
  mingpai("玩家一",player01,poker);
  mingpai("玩家二",player02,poker);
  mingpai("玩家三",player03,poker);
  mingpai("底牌",dipai,poker);
 
 }
 
 //参数列表：String name(玩家名字) ; TreeSet i(牌的编号) ; HashMap pai(牌)
 public static void mingpai(String name,TreeSet i,HashMap pai){
 List li = new ArrayList();
 System.out.println(name+"的牌是：");
 for(Integer key : i){
 //TreeSet的值就是HashMap的键,所以可以得到对应的值，也就是牌
 String result = pai.get(key);
 //输出看到的牌
 System.out.print(result+" ");
 }

 System.out.println(" ");
 
}

以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持考高分网。