栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > Java

斗地主游戏,嘻嘻嘻

Java 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

斗地主游戏,嘻嘻嘻

//准备数据
String[] flower = {"♣","♥","♦","♠"};
String[] number = {"2","3","4","5","6","7","8","9","10","J","Q","K","A"};
String[]   king = {"大王","小王"};


//存牌
HashMap list = new HashMap<>();
int sum = 0;
for (int i = 0; i < number.length; i++) {
    for (int j = 0; j < flower.length; j++) {
        list.put(sum,number[i] + flower[j]);
        sum++;
    }
}

for(String value : king) {
    list.put(sum,value);
    sum++;
}

LinkedList linkedList = new LinkedList<>();

for (int i = 0; i < list.size(); i++) {
    linkedList.add(i);
}

//洗牌
Collections.shuffle(linkedList);

//发牌
int[] bottomPaper = {linkedList.get(linkedList.size() - 3) , linkedList.get(linkedList.size() - 2) ,linkedList.get(linkedList.size() - 1) };
TreeSet user1 = new TreeSet<>();
TreeSet user2 = new TreeSet<>();
TreeSet user3 = new TreeSet<>();
//给每个用户发牌
for (int i = 0; i < linkedList.size() - 3; i++) {

    if (i % 3 == 0) {
        user1.add(linkedList.get(i));
    }else if (i % 3 == 1) {
        user2.add(linkedList.get(i));
    }else {
        user3.add(linkedList.get(i));
    }

}
//遍历底牌
for (Integer key : bottomPaper) {
    System.out.print(list.get(key) + " ");
}
System.out.println();
//遍历用户一
for (Integer key : user1) {
    System.out.print(list.get(key) + " ");
}

System.out.println();
//遍历用户二
for (Integer key : user2) {
    System.out.print(list.get(key) + " ");
}

System.out.println();
//遍历用户三
for (Integer key : user3) {
    System.out.print(list.get(key) + " ");
}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/863105.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号