一个模拟斗地主的小程序

1 需求:模拟斗地主的的游戏,并且要求控制台可以输出每个人的牌

2 分析:

(1)创建一副牌(54张):用两个字符串数组分别存储牌的形状和号码,再统一存储到中ArrayList。

(2)洗牌:直接调用collections的shuffle()方法。

(3)发牌:首先定义参加游戏的用户,用户也定义为ArrayList保存接受到的牌。遍历整副牌,因为每个用户接牌顺序是固定的,所以直接用if判断并存入ArrayList中。

(4)看牌:此时可以下一个看牌的方法lookpai(),需要看谁的牌,用户直接调用即可。

3 代码实现:

方法一:如上描述分析

package com.edu_01;

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

public class Poker {
public static void main(String[] args) {
	ArrayList<String> list = new ArrayList<String>();
	
	String[] shape = {"♥","♠","♣","♦"};
	String[] number = {"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
	
	for (String shp : shape) {
		for (String num : number) {
			list.add(shp+num);
		}
	}
	
	list.add("queen");
	list.add("king");
	
	//洗牌
	Collections.shuffle(list);
	
	
	//发牌
	ArrayList<String> liushishi = new ArrayList<String>();
	ArrayList<String> luhan = new ArrayList<String>();
	ArrayList<String> hejiong = new ArrayList<String>();
	ArrayList<String> dipai = new ArrayList<String>();
	
	for(int i=0;i<list.size();i++){
		if(i >= list.size()-3){
			dipai.add(list.get(i));
		}else if(i%3 == 0){
			liushishi.add(list.get(i));
		}else if(i%3 == 1){
			luhan.add(list.get(i));
		}else if(i%3 == 2){
			hejiong.add(list.get(i));
		}	
	}
	
	//看牌
	lookpai("刘诗诗",liushishi);
	lookpai("鹿晗",luhan);
	lookpai("何炅",hejiong);
	lookpai("底牌",dipai);
}

private static void lookpai(String name, ArrayList<String> list) {
	System.out.print(name+"的牌是:");
	for (String poker : list) {
		System.out.print(poker+" ");
	}
	System.out.println();
}
}
方法二:与方法一的本质是相同的,只不过该方法使用了TreeMap键值对的方法,将牌号和形状按顺序存入TreeMap中,然后再将索引存入ArrayList中,取出时,按照索引值取牌。
package com.edu_01;

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

public class poker02 {
public static void main(String[] args) {
	
	//创建存牌的map,和索引ArrayList,创建一副牌
	TreeMap<Integer, String> tm = new TreeMap<Integer, String>();
	ArrayList<Integer> list = new ArrayList<Integer>();
	
	String[] shape = {"♥","♠","♣","♦"};
	String[] number = {"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
	
	int index = 0;
	for (String num : number) {
		for (String shp : shape) {
			tm.put(index, shp+num);
			list.add(index);
			index++;
		}
	}
	
	tm.put(index, "king");
	list.add(index);
	index++;
	
	tm.put(index, "queen");
	list.add(index);
	index++;
	
	//洗牌
	Collections.shuffle(list);
	
	//发牌
	TreeSet<Integer> liushishi = new TreeSet<Integer>();
	TreeSet<Integer> luhan = new TreeSet<Integer>();
	TreeSet<Integer> lisi = 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==0) {
			liushishi.add(list.get(i));
		}else if (i%3==1) {
			luhan.add(list.get(i));
		}else if (i%3==2) {
			lisi.add(list.get(i));
		}
	}
	
	//System.out.println(liushishi);
	//System.out.println(luhan);
	//System.out.println(lisi);
	//System.out.println(dipai);
	
	
	lookpai("刘诗诗",liushishi,tm);
	lookpai("鹿晗",luhan,tm);
	lookpai("李四",lisi,tm);
	lookpai("底牌",dipai,tm);
	
}
//看牌
private static void lookpai(String name, TreeSet<Integer> poker,
		TreeMap<Integer, String> tm) {
	System.out.print(name+"的牌是: ");
	for (Integer i : poker) {
		System.out.print(tm.get(i)+" ");
	}
	System.out.println();
	
}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值