java学习笔记-模拟斗地主

一、案例-模拟斗地主

需求：通过程序实现斗地主过程中的洗牌，发牌和看牌

package lianxi;

import java.util.ArrayList;
import java.util.Collections;

public class helloworld {
	public static void main(String[] args){
		
		//创建一个牌盒，也就是定义一个集合对象，用ArrayList集合实现
		ArrayList<String> array = new  ArrayList<String>();
		
		//定义花色数组
		String[] colors = {"♦","♣","♠","♥"};
		//定义点数数组
		String[] numbers = {"2","3","4","5","6","7","8","9","10","J","Q","K","A"};
		for(String color : colors) {
			for(String number : numbers) {
				array.add(color+number);
			}
		}
		array.add("小王");
		array.add("大王");
		
		//洗牌，也就是把牌打散，用Collections的shuffle()方法实现
		Collections.shuffle(array);
//		System.out.println(array);
		
		//发牌，也就是遍历集合，给三个玩家发牌
		ArrayList<String> zs = new ArrayList<String>();
		ArrayList<String> ls = new ArrayList<String>();
		ArrayList<String> ww = new ArrayList<String>();
		ArrayList<String> dp = new ArrayList<String>();
		
		for(int i = 0;i<array.size();i++)
		{
			String poker = array.get(i);
			if(i > array.size() -3){
				dp.add(poker);
			} else if(i % 3 == 0) {
				zs.add(poker);
			} else if(i % 3 == 1) {
				ls.add(poker);
			} else if(i % 3 == 2)
			{
				ww.add(poker);
			}
		}
		
		//看牌
		System.out.println("张三的牌为："+zs);
		System.out.println("李四的牌为："+ls);
		System.out.println("王五的牌为："+ww);
	}	
}

二、模拟斗地主升级版

需求：通过程序实现斗地主过程中的洗牌，发牌和看牌。
要求：对牌进行排序

 package lianxi;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeSet;

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里面存储编号
		int index = 0;
		for (String number : numbers) {
			for (String color : colors) {
				hm.put(index, color + number);
				array.add(index);
				index++;
			}
		}
		hm.put(index, "小王");
		array.add(index);
		index++;
		hm.put(index, "大王");
		array.add(index);
		index++;

		// 洗牌
		Collections.shuffle(array);

		// 发牌
		TreeSet<Integer> zs = new TreeSet<Integer>();
		TreeSet<Integer> ls = new TreeSet<Integer>();
		TreeSet<Integer> ww = new TreeSet<Integer>();
		TreeSet<Integer> dp = new TreeSet<Integer>(); // 底牌

		for (int i = 0; i < array.size(); i++) {
			int x = array.get(i);
			if (i >= array.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, hm);
		lookPoker("李四", ls, hm);
		lookPoker("王五", ww, hm);
		lookPoker("底牌", dp, hm);
	}

	// 定义方法看牌(遍历TreeSet集合，获取编号，到HashMap集合找对应的牌)
	public static void lookPoker(String name, TreeSet<Integer> ts, HashMap<Integer, String> hm) {
		System.out.print(name + "的牌是：");
		for (Integer key : ts) {
			String poker = hm.get(key);
			System.out.print(poker + " ");
		}
		System.out.println();
	}

}

运行截图，仅供参考