gpt4 book ai didi

java - 扑克游戏手牌评估器数组条件结构

转载 作者:行者123 更新时间:2023-12-01 21:14:19 26 4
gpt4 key购买 nike

我制作了一个快速扑克游戏。它生成 5 个随机数,并根据其值将这些数字转换为实际的卡片值和符号。然而,我在进行手牌评估时遇到了问题。

到目前为止,我只进行了同花,因为它非常简单,但即使如此,它也不是完美的(它打印出用户同花 5 次......),如果有人可以帮助我完成这对,我将非常感激,两对,三对,同种且顺。之后我可以做剩下的事情,但我只需要注意如何做这些事情。

提前感谢您的帮助,这是代码:

package tests;

import java.util.*;

public class TESTS {

public static void main(String[] args) {
boolean[] pack = new boolean[52]; // Array to not generate the same number twice
int[] cards = new int[5]; //The 5 unique random numbers are stored in here.
String[] cardsvalues = new String[5]; // This will assign the card's value based on the random number's value
char[] cardssymbols = new char[5];//This will assign the card's symbol based on the random number's value
char symbols[] = {'♥', '♦', '♣', '♠'}; // possible symbols that the random number can take
String values[] = {"A", "2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K"}; // possible values that the random number can take
Random give = new Random();

for (int i = 0; i < cards.length; i++) { // Gives 5 unique random numbers
do {
cards[i] = give.nextInt(52);
} while (pack[cards[i]]);
pack[cards[i]] = true;
System.out.println(cards[i]);
}

for (int i = 0; i < cards.length; i++) { // This converts the number to a card symbol based on the number's value
final int numOfSymbol = cards[i] / 13;
cardssymbols[i] = symbols[numOfSymbol];
}
for (int i = 0; i < cards.length; i++) { // This converts the number to an actual card value based on the number's value.
final int numOfValues = cards[i] % 13;
cardsvalues[i] = values[numOfValues];
}
for (int i = 0; i < cardssymbols.length; i++) { // Prints the actual cards once they are converted
System.out.print(cardssymbols[i]);
System.out.println(cardsvalues[i]);
}
for (int i = 0; i < cardsvalues.length; i++) { //Here is the problem, i have no idea on how to make the handevaluator ...
if (cardsvalues[i] == cardsvalues[i] + 1) {
System.out.println("PAIR !!!");
} else if (cardsvalues[i] == cardsvalues[i] + 1 && cardsvalues[i] == cardsvalues[i] + 2) {
System.out.println("TRIPS !!!");
} else if (cardssymbols[0] == cardssymbols[1] && cardssymbols[1] == cardssymbols[2] && cardssymbols[2] == cardssymbols[3] && cardssymbols[3] == cardssymbols[4]) {
System.out.println("FLUSHHH");
}
}
}

最佳答案

提示:

  • 为了简化顺子测试​​和按最高牌排序,更容易通过索引表示排名,并且仅将其转换为用于打印的符号。
  • 使用 Card 对象可以使代码更清晰。
  • Java Collection 框架具有用于打乱、切片和排序的有用功能。

我的解决方案:

public class Test {

static final char[] suits = {'♥', '♦', '♣', '♠'};
static final String[] ranks = {"2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A"};

static class Card {
final int suit;
final int rank;

Card(int s, int r) {
suit = s;
rank = r;
}

@Override
public String toString() {
return suits[suit] + ranks[rank]; // or however you want the cards to be printed
}
}


public static void main(String[] args) {
List<Card> deck = new ArrayList<>();
for (int s = 0; s < suits.length; s++) {
for (int r = 0; r < ranks.length; r++) {
deck.add(new Card(s,r));
}
}
Collections.shuffle(deck);
List<Card> hand = deck.subList(0,5);

Collections.sort(hand, Comparator.comparing(c -> c.rank));
System.out.println("Your hand is: " + hand);

System.out.println(value(hand));

}

static String value(List<Card> hand) {
boolean straight = true;
boolean flush = true;
for (int i = 1; i < hand.size(); i++) {
straight &= hand.get(i - 1).rank + 1 == hand.get(i).rank;
flush &= hand.get(i - 1).suit == hand.get(i).suit;
}

if (straight && flush) {
return "Straight Flush from " + hand.get(4);
}

List<Run> runs = findRuns(hand);
runs.sort(Comparator.comparing(r -> -r.rank));
runs.sort(Comparator.comparing(r -> -r.length));

if (runs.get(0).length == 4) {
return "Four of a Kind: " + runs;
}

if (runs.get(0).length == 3 && runs.get(1).length == 2) {
return "Full House: " + runs;
}

if (straight) {
return "Straight from " + hand.get(4);
}

if (runs.get(0).length == 3) {
return "Three of a Kind: " + runs;
}

if (runs.get(1).length == 2) {
return "Two pair: " + runs;
}

if (runs.get(0).length == 2) {
return "Pair: " + runs;
}

return "High card: " + runs;
}

/** Represents {@code length} cards of rank {@code rank} */
static class Run {
int length;
int rank;

@Override
public String toString() {
return ranks[rank];
}
}

static List<Run> findRuns(List<Card> hand) {
List<Run> runs = new ArrayList<>();
Run run = null;
for (Card c : hand) {
if (run != null && run.rank == c.rank) {
run.length++;
} else {
run = new Run();
runs.add(run);
run.rank = c.rank;
run.length = 1;
}
}
return runs;
}
}

示例输出:

Your hand is: [♣10, ♥J, ♦J, ♠K, ♥K]
Two pair: [K, J, 10]

关于java - 扑克游戏手牌评估器数组条件结构,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/40568402/

26 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com