斗地主案例的需求分析

 

斗地主案例的代码实现

package com.itheima.demo04.Test;import java.util.ArrayList;
import java.util.Collections;/*斗地主综合案例:1.准备牌2.洗牌3.发牌4.看牌*/
public class DouDiZhu {public static void main(String[] args) {//1.准备牌//定义一个存储54张牌的ArrayList集合,泛型使用StringArrayList<String> poker = new ArrayList<>();//定义两个数组,一个数组存储牌的花色,一个数组存储牌的序号String[] colors = {"♠","♥","♣","♦"};String[] numbers = {"2","A","K","Q","J","10","9","8","7","6","5","4","3"};//先把大王和小王存储到poker集合中poker.add("大王");poker.add("小王");//循环嵌套遍历两个数组,组装52张牌for(String number : numbers){for (String color : colors) {//System.out.println(color+number);//把组装好的牌存储到poker集合中poker.add(color+number);}}  // 生成一副扑克牌//System.out.println(poker);/*2.洗牌使用集合的工具类Collections中的方法static void shuffle(List<?> list) 使用默认随机源对指定列表进行置换。*/Collections.shuffle(poker);  // 洗牌//System.out.println(poker);/*3.发牌*///定义4个集合,存储玩家的牌和底牌ArrayList<String> player01 = new ArrayList<>();ArrayList<String> player02 = new ArrayList<>();ArrayList<String> player03 = new ArrayList<>();ArrayList<String> diPai = new ArrayList<>();/*遍历poker集合,获取每一张牌使用poker集合的索引%3给3个玩家轮流发牌剩余3张牌给底牌注意:先判断底牌(i>=51),否则牌就发没了*/for (int i = 0; i < poker.size() ; i++) {//获取每一张牌String p = poker.get(i);//轮流发牌if(i>=51){      // 剩下三张做底牌//给底牌发牌diPai.add(p);}else if(i%3==0){//给玩家1发牌player01.add(p);}else if(i%3==1){//给玩家2发牌player02.add(p);}else if(i%3==2){//给玩家3发牌player03.add(p);}}//4.看牌System.out.println("刘德华:"+player01);System.out.println("周润发:"+player02);System.out.println("周星驰:"+player03);System.out.println("底牌:"+diPai);}
}