//這是無序的手牌 用到ArrayList集合(無排序功能)

public class PokerDemo {

public static void main(String[] args) {
//創建牌盒
ArrayList<String> array = new ArrayList<String>();

//定義一個花色數組
String[] colors = {"?","?","?","?"};
//定義一個點數數組
String[] numbers = {"A","2","3","4","5","6","7","8","9","10","J","Q","K"};
//裝牌
for(String color : colors){
for(String number : numbers){
array.add(color.concat(number));
}
}
array.add("小王");
array.add("大王");

//洗牌
Collections.shuffle(array);

//發牌
ArrayList<String> s1 = new ArrayList<String>();
ArrayList<String> s2 = new ArrayList<String>();
ArrayList<String> s3 = new ArrayList<String>();
ArrayList<String> diPai = new ArrayList<String>();

for(int i = 0; i < array.size();i++){
if(i >= array.size() - 3){
diPai.add(array.get(i));
}else if(i % 3 ==0){
s1.add(array.get(i));
}else if(i % 3 ==1){
s2.add(array.get(i));
}else if(i % 3 ==2){
s3.add(array.get(i));
}
}
//看牌
lookPoker("張三",s1);
lookPoker("李四",s2);
lookPoker("王五",s3);
lookPoker("底牌",diPai);

}

public static void lookPoker(String name,ArrayList<String> array){
System.out.print(name + "的底牌是：");
for(String s : array){
System.out.print(s+" ");
}
System.out.println();
}

}

//這是有序的手牌 用到TreeSet集合(有排序功能)

import java.util.*;

public class PokerDemo {

public static void main(String[] args) {
// 創建一個HashMap集合
HashMap<Integer, String> hm = new HashMap<Integer, String>();

// 創建一個ArrayList集合
ArrayList<Integer> array = new ArrayList<Integer>();

// 定義一個花色數組
String[] colors = { "?", "?", "?", "?" };
// 定義一個點數數組
String[] numbers = { "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2" };
// 從0開始往HashMap中裏面存儲編號，並存對應的牌，同時往ArrayList裏面存儲編號即可
int index = 0;
// 裝牌
for (String number : numbers) {
for (String color : colors) {
String poker = color.concat(number);
hm.put(index, poker);
array.add(index);
index++;

}
}
hm.put(index, "小王");
array.add(index);
index++;
hm.put(index, "大王");
array.add(index);

// 洗牌(洗的是編號)
Collections.shuffle(array);

// 發牌
TreeSet<Integer> s1 = new TreeSet<Integer>();
TreeSet<Integer> s2 = new TreeSet<Integer>();
TreeSet<Integer> s3 = new TreeSet<Integer>();
TreeSet<Integer> diPai = new TreeSet<Integer>();

for (int i = 0; i < array.size(); i++) {
if (i >= array.size() - 3) {
diPai.add(array.get(i));
} else if (i % 3 == 0) {
s1.add(array.get(i));
} else if (i % 3 == 1) {
s2.add(array.get(i));
} else if (i % 3 == 2) {
s3.add(array.get(i));
}
}

// 看牌(遍歷TreeSet集合，獲取編號，到HashMap集合中找對應的牌)
lookPoker("張三", s1, hm);
lookPoker("李四", s2, hm);
lookPoker("王五", s3, hm);
lookPoker("底牌", diPai, hm);

}

public static void lookPoker(String name, TreeSet<Integer> ts, HashMap<Integer, String> hm) {
System.out.print(name + "的牌是：");
for (Integer key : ts) {
String value = hm.get(key);
System.out.print(value + " ");
}
System.out.println();
}

}

基於Java----鬥地主遊戲的開發