一:需求分析:
游戏分为 5 类牌:
1:豹子 :三张牌点数一样
2:顺子:三张牌点数连续
3:清一色:三张牌花色相同
4:对子:三张牌中有两张牌点数相同
5:单张:除去上述的 4 种情况
规则:我们把大小规则定为:豹子 > 顺子 > 清一色 > 对子 > 单张. 如果玩家牌的类型相同,就依次比较最大牌的点数。
二:代码设计:
1.首先设计一个 Pai 的类,用来表示每一张牌的花色和点数。
2.构造完一副牌后,再洗牌,在这里我们可以用库中的洗牌的方法—> Collections.shuffle(),也可以自己写一个洗牌方法。
3.我们假定有三个玩家,再给玩家发牌,每人发三张。
4.比较大小得出最大的玩家。
三:代码具体实现
1.Pai 类:用来描述每张牌的点数和花色,此外还重写了 toString 方法
//创建卡牌类
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 + ")";
}
}
2.函数主体包含了 4 部分:
(1)构造一副牌 (2)洗牌 (3)发牌 (4)比大小
(1)构造一副牌:点数我们用字符串表示,外层循环表示牌的花色,内层循环表示牌的点数,
在内层循环下表示出 J、Q、K、A。
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;
}
(2)洗牌:我们用的方法是:从后往前遍历 List ,每次取到一个元素的时候再产生一个随机数,然后把当前取到的元素和随机数交换,
再取到下一个元素,再产生一个随机数,再交换……
此外,我们还可以用库函数中的 Collections.shuffle() 方法进行洗牌。
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);
}
}
(3)发牌:因为每个玩家要手握三张牌,所以每一个玩家都是一个牌的集合,因此 players 里面是 List 的集合。
在发牌时,我们先得到某一个玩家,再增加这个玩家手中的牌,我们每次把这副牌中的第一张发给这个玩家,同时在这副牌中删除这张牌,
然后再发牌时再从第一张发。最后打印三个玩家手中的牌。
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)比大小:
首先,豹子就是比较三张牌的点数;顺子就是比较三张牌的花色;对子就是任意两张牌的点数相同;单张就是三张牌的点数跟花色都不相同。唯独顺子比较麻烦。在这里我们的解决方法是:先对玩家手中的三张牌进行降序排序,然后比较前后两张牌的点数差值是否是 1 即可。
在比较时,我们采用不同的权重来区别牌的类别以及牌中不同点数顺序。
比如:首先根据牌的类型先给出一个值(当然这个值比较大,为牌的类型直接决定牌的大小),如果玩家牌的类型相同在比较牌的点数(此处三张牌的权重也不相同,因为如果最大的牌比较出来了,后面的牌就不用比较了,因此三张牌按照大小顺序的权重也不同),我们必须保证后面牌的权重值的和不能大于牌的类型的值和前面较大牌的值。
注:豹子给定的值:5000 ; 顺子给定的值: 4000 ; 清一色给定的值: 3000 ; 对子给定的值: 2000; 单张给定的值: 1000 ;
三张牌按照大小顺序给定的权重: * 1000 ; *10 ; *1 。
排序方法:为了方便比较大小,我们把10,J,Q,K,A的值根据 asc|| 转化成与 1 ~ 9 连续的值了。
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];
}
具体的比较方法:根据数组中算出的三个玩家牌的大小进行排序.
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 + "的牌最大");
}
最终完整的代码如下:
//创建卡牌类
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];
}
}
效果展示:每次启动都会随机发牌。
项目源码:https://github.com/YTCfight/ZhaJinHua/blob/master/src/KaPai.java