模拟斗地主

模拟斗地主

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

public class Main {
	public static void main(String[] args) {
		ArrayList<String> list = new ArrayList<String>();
		String [] s1= {"♦","♣","♥","♠"};
		String [] s2= {"A","2","3","4","5","6","7","8","9","10","J","Q","K"};
		for (String hua : s1) {
			for(String shu :s2 )
			{
				String z=hua+shu;
				list.add(z);
			}
		}
		list.add("大王");
		list.add("小王");
		Collections.shuffle(list);
		ArrayList< String > men1=new ArrayList<>(); //玩家一
		ArrayList< String > men2=new ArrayList<>(); //玩家二
		ArrayList< String > men3=new ArrayList<>(); //玩家三
		ArrayList< String > dipai=new ArrayList<>(); //底牌
		for(int i=0;i<list.size();i++)
		{
			if(i<3) {
				dipai.add(list.get(i));
			}else if(i<20)
			{
				men1.add(list.get(i));
			}else if(i<37)
			{
				men2.add(list.get(i));
			}else 
			{
				men3.add(list.get(i));
			}
		}
		System.out.println("玩家一 "+men1);
		System.out.println("玩家二 "+men2);
		System.out.println("玩家三 "+men3);
		System.out.println("底牌"+dipai);
	}
}

斗地主进阶 ~将玩家手里的牌排序显示：
思路：将牌用编号1~54表示，由HashMap<Integer, String> 存编号和对应的牌。treeset自然排序，再输出。

package 斗地主;

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

public class Main {
	public static void main(String[] args) {
		HashMap<Integer, String> hashMap = new HashMap<>(); // 存整副牌
		String[] s1 = { "♦", "♣", "♥", "♠" }; // 花色
		String[] s2 = { "A", "2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K" }; // 数字
		ArrayList<Integer> list = new ArrayList<>(); // 存编号
		int count = 1;
		for (String shu : s2) {
			for (String hua : s1) {
				String z = hua + shu;
				hashMap.put(count, z);
				list.add(count);
				count++;
			}
		}
		hashMap.put(53, "小王");
		list.add(53);
		hashMap.put(54, "大王");
		list.add(54);

		Collections.shuffle(list); // 随机打乱
		TreeSet<Integer> men1 = new TreeSet<Integer>(); // 玩家一
		TreeSet<Integer> men2 = new TreeSet<Integer>(); // 玩家二
		TreeSet<Integer> men3 = new TreeSet<Integer>(); // 玩家三
		TreeSet<Integer> dipai = new TreeSet<Integer>(); // 底牌

		// 分牌
		for (int i = 0; i < list.size(); i++) {
			if (i >= list.size() - 3) {
				dipai.add(list.get(i));
			} else if (i % 3 == 1) {
				men1.add(list.get(i));
			} else if (i % 3 == 2) {
				men2.add(list.get(i));
			} else if (i % 3 == 0) {
				men3.add(list.get(i));
			}
		}

		System.out.print("玩家一：");
		for (Integer one : men1) {
			System.out.print(hashMap.get(one) + " ");
		}
		System.out.print("\n玩家二：");
		for (Integer tow : men2) {
			System.out.print(hashMap.get(tow) + " ");
		}
		System.out.print("\n玩家三：");
		for (Integer three : men3) {
			System.out.print(hashMap.get(three) + " ");
		}
		System.out.print("\n底牌 ：");
		for (Integer d : dipai) {
			System.out.print(hashMap.get(d) + " ");
		}
	}
}

编译结果：