现实炸金花

import java.util.ArrayList;

import java.util.List;

import java.util.Random;

 

//创建卡牌类

class Pai {

protected String suit; //花色

protected String count; //点数

 

public Pai(String suit, String count) {

this.suit = suit;

this.count = count;

}

 

@Override

public String toString() {

return "(" + suit + count + ")";

}

}

 

public class Kapai {

public static void main(String[] args) {

//1.构造一副牌

List<Pai> poker = buyCard();

//2.洗牌

//Collections.shuffle(poker);

XiPai(poker);

System.out.println(poker);

//3.分牌

List<List<Pai>> players = new ArrayList<>();

//三个玩家

players.add(new ArrayList<Pai>());

players.add(new ArrayList<Pai>());

players.add(new ArrayList<Pai>());

for (int playerIndex = 0; playerIndex < 3; playerIndex++) {

for (int cardIndex = 0; cardIndex < 3; cardIndex++) {

players.get(playerIndex).add(poker.remove(0));

}

}

System.out.println("玩家1:");

System.out.println(players.get(0));

System.out.println("玩家2:");

System.out.println(players.get(1));

System.out.println("玩家3:");

System.out.println(players.get(2));

//4.比大小

match(players);

}

private final static String[] SUITS = {"♥️","♠️","♦️","♣️"};

public static List<Pai> buyCard() {

List<Pai> poker = new ArrayList<>();

for (int i = 0; i < 4; i++) {

for (int j = 2; j <= 10; j++) {

poker.add(new Pai(SUITS[i], j + ""));

}

poker.add(new Pai(SUITS[i], "J"));

poker.add(new Pai(SUITS[i], "Q"));

poker.add(new Pai(SUITS[i], "K"));

poker.add(new Pai(SUITS[i], "A"));

}

return poker;

}

//洗牌

public static void XiPai(List<Pai> list) {

Random random = new Random();

for (int i = list.size() - 1; i >= 0; i--) {

int ret = random.nextInt(list.size());

Pai tmp = list.get(i);

list.set(i,list.get(ret));

list.set(ret,tmp);

}

}

//比大小

public static void match(List<List<Pai>> players) {

float[] player = new float[3];

String[] arr1 = {players.get(0).get(0).count,players.get(0).get(1).count,

players.get(0).get(2).count};

String[] arr2 = {players.get(1).get(0).count,players.get(1).get(1).count,

players.get(1).get(2).count};

String[] arr3 = {players.get(2).get(0).count,players.get(2).get(1).count,

players.get(2).get(2).count};

swap(arr1);

swap(arr2);

swap(arr3);

String[][] cur = {arr1,arr2,arr3};

for (int i = 0; i < 3; i++) {

if (cur[i][0].equals(cur[i][1]) && cur[i][0].equals(cur[i][2])) {

player[i] = 5000.0f;

player[i] += compaire(cur[i]);

} else if (cur[i][0].compareTo(cur[i][1]) == 1 && cur[i][1].compareTo(cur[i][2]) == 1) {

player[i] = 4000.0f;

player[i] += compaire(cur[i]);

} else if (players.get(i).get(0).suit.equals(players.get(i).get(1).suit)

&& players.get(i).get(0).suit.equals(players.get(i).get(2).suit)) {

player[i] = 3000.0f;

player[i] += compaire(cur[i]);

} else if (cur[i][0].equals(cur[i][1]) || cur[i][0].equals(cur[i][2]) || cur[i][1].equals(cur[i][2])) {

player[i] = 2000.0f;

player[i] += compaire(cur[i]);

} else if (cur[i][0].compareTo(cur[i][1]) != 0 && cur[i][0].compareTo(cur[i][2]) != 0

&& cur[i][1].compareTo(cur[i][2]) != 0 ) {

player[i] = 1000.0f;

player[i] += compaire(cur[i]);

}

}

float max = -1;

int flag = -1;

int flag2 = -1;

int flag3 = -1;

for (int i = 0; i < 3; i++) {

if (player[0] == player[1] && player[0] == player[2]) {

flag3 = 0;

}

if (player[i] > max) {

max = player[i];

flag = i + 1;

} else if (player[i] == max) {

flag2 = i + 1;

}

}

if (flag2 != -1 && flag3 == -1) {

System.out.println("玩家" + flag + "和" + flag2 + "的牌一样大");

} else if (flag3 != -1) {

System.out.println("三个玩家的牌一样大");

}

System.out.println("玩家" + flag + "的牌最大");

}

private static void swap(String[] arr) {

String max1 = "";

String max2 = "";

String max3 = "";

for (int i = 0; i < 3; i++) {

if (arr[i].equals("10")) {

arr[i] = ":";

}

if (arr[i].equals("J")) {

arr[i] = ";";

}

if (arr[i].equals("Q")) {

arr[i] = "<";

}

if (arr[i].equals("K")) {

arr[i] = "=";

}

if (arr[i].equals("A")) {

arr[i] = ">";

}

}

if (arr[0].compareTo(arr[1]) > 0) {

max2 = arr[0];

max3 = arr[1];

if (arr[2].compareTo(max2) > 0) {

max1 = arr[2];

} else if (arr[2].compareTo(max2) < 0){

max1 = max2;

if (arr[2].compareTo(max3) > 0) {

max2 = arr[2];

} else {

max2 = max3;

max3 = arr[2];

}

} else {

max1 = arr[2];

}

} else if(arr[0].compareTo(arr[1]) < 0){

max2 = arr[1];

max3 = arr[0];

if (arr[2].compareTo(max2) > 0) {

max1 = arr[2];

} else if (arr[2].compareTo(max2) < 0) {

max1 = max2;

if (arr[2].compareTo(max3) > 0) {

max2 = arr[2];

} else {

max2 = max3;

max3 = arr[2];

}

} else {

max1 = arr[2];

}

} else if (arr[0].compareTo(arr[1]) == 0) {

if (arr[2].compareTo(arr[1]) == 0) {

max1 = arr[0];

max2 = arr[0];

max3 = arr[0];

} else if (arr[2].compareTo(arr[1]) > 0) {

max1 = arr[2];

max2 = arr[1];

max3 = arr[0];

} else {

max3 = arr[2];

max2 = arr[0];

max1 = arr[1];

}

arr[0] = max1;

arr[1] = max2;

arr[2] = max3;

return;

}

arr[0] = max1;

arr[1] = max2;

arr[2] = max3;

return;

}

private static float compaire(String[] arr) {

float[] ret = new float[3];

for (int i = 0; i < 3; i++) {

if (arr[i] == ">") {

ret[i] = 0.13f;

} else if (arr[i] == "=") {

ret[i] = 0.12f;

} else if (arr[i] == "<") {

ret[i] = 0.11f;

} else if (arr[i] == ";") {

ret[i] = 0.10f;

} else if (arr[i] == ":") {

ret[i] = 0.09f;

} else if (arr[i] == "9") {

ret[i] = 0.08f;

} else if (arr[i] == "8") {

ret[i] = 0.07f;

} else if (arr[i] == "7") {

ret[i] = 0.06f;

} else if (arr[i] == "6") {

ret[i] = 0.05f;

} else if (arr[i] == "5") {

ret[i] = 0.04f;

} else if (arr[i] == "4") {

ret[i] = 0.03f;

} else if (arr[i] == "3") {

ret[i] = 0.02f;

} else if (arr[i] == "2") {

ret[i] = 0.01f;

}

if (i == 0) {

ret[i] *= 1000;

} else if (i == 1) {

ret[i] *= 10;

} else {

ret[i] *= 1;

}

}

return ret[0] + ret[1] + ret[2];

}

}

1e6b734cf73644658af1d1f8468b64f7.png

  • 5
    点赞
  • 6
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值