需求:通过程序实现斗地主过程中的洗牌,发牌和看牌
思路:
1)创建一个牌盒,也就是定义一个集合对象,用ArrayList集合实现
2)往牌盒里装牌
3)洗牌,也就是把牌打乱,用Collections的shuffle()方法实现
4)发牌,也就是遍历集合,给三个玩家发牌
5)看牌,也就是三个玩家分别遍历自己的牌
package collections;
import java.util.ArrayList;
import java.util.Collections;
public class PoKer0 {
public static void main(String[] args) {
ArrayList<String> list = new ArrayList<>();
String[] colors = {"♦","♣","♥","♠"};
String[] numbers = {"2","3","4","5","7","8","9","10","J","Q","K","A"};
for(String color : colors){
for(String number : numbers){
list.add(color+number);
}
}
list.add("小王");
list.add("大王");
Collections.shuffle(list);
ArrayList<String> list1 = new ArrayList<>();
ArrayList<String> list2 = new ArrayList<>();
ArrayList<String> list3 = new ArrayList<>();
ArrayList<String> list4 = new ArrayList<>();
for(int i = 0; i < list.size(); i++) {
String poker = list.get(i);
if (i >= list.size() - 3) {
list4.add(poker);
} else if (i % 3 == 0) {
list1.add(poker);
} else if (i % 3 == 1) {
list2.add(poker);
} else if (i % 3 == 2) {
list3.add(poker);
}
}
lookpoker("张三",list1);
lookpoker("李四",list2);
lookpoker("王五",list3);
lookpoker("底牌",list4);
}
public static void lookpoker(String name, ArrayList<String> list){
System.out.print(name + "的牌是:");
for(String poker : list){
System.out.print(poker + " ");
}
System.out.println();
}
}
升级版:发牌排序
思路:
1)创建HashMap,键是编号,值是牌
2)创建ArrayList,存储编号
3)创建花色数组和点数数组
4)从0开始往HashMap里面存储编号,并存储对应的牌,同时往ArrayList里面储存编号
5)洗牌(洗的是编号),用Collections的shuffle()方法实现
6)发牌(发的也是编号,为了保证编号是排序的,创建TreeSet集合接收)
7)定义方法看牌(遍历TreeSet集合,获取编号,到HashMap集合找对应的牌)
8)调用看牌方法
package collections;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeSet;
public class PoKer1 {
public static void main(String[] args) {
HashMap<Integer, String> hashMap = new HashMap<>();
ArrayList<Integer> list = new ArrayList<>();
String[] colors = {"♦", "♣", "♥", "♠"};
String[] numbers = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2"};
int index = 0;
for (String number : numbers) {
for (String color : colors) {
hashMap.put(index, color + number);
list.add(index);
index++;
}
}
hashMap.put(index, "小王");
list.add(index);
index++;
hashMap.put(index, "大王");
list.add(index);
Collections.shuffle(list);
TreeSet<Integer> zs = new TreeSet<>();
TreeSet<Integer> ls = new TreeSet<>();
TreeSet<Integer> ww = new TreeSet<>();
TreeSet<Integer> dp = new TreeSet<>();
for (int i = 0; i < list.size(); i++) {
int x = list.get(i);
if (i >= list.size() - 3) {
dp.add(x);
} else if (i % 3 == 0) {
zs.add(x);
} else if (i % 3 == 1) {
ls.add(x);
} else if (i % 3 == 2) {
ww.add(x);
}
}
lookPoKer("张三",zs,hashMap);
lookPoKer("李四",ls,hashMap);
lookPoKer("王五",ww,hashMap);
lookPoKer("底牌",dp,hashMap);
}
public static void lookPoKer(String name, TreeSet<Integer> ts, HashMap<Integer, String> hashMap) {
System.out.print(name + "的牌是:");
for (Integer key : ts) {
String poker = hashMap.get(key);
System.out.print(poker + " ");
}
System.out.println();
}
}