洗扑克牌（乱数排列）

最新推荐文章于 2019-04-12 18:08:00 发布

meng_lin

最新推荐文章于 2019-04-12 18:08:00 发布

阅读量169

点赞数

分类专栏：经典算法文章标签： J#

本文链接：https://blog.csdn.net/meng_lin/article/details/83373387

版权

经典算法专栏收录该内容

16 篇文章 0 订阅

订阅专栏

package qinglin.learn.arithmetic;

import java.util.Random;

public class PokerRefreash
{
	public static void main(String[] args)
	{
		PokerRefreash refreash = new PokerRefreash();
		Random  random = new Random();
		int poker[]=new int[53];
		for(int i=1;i<poker.length;i++)
			poker[i]=i;
		for(int i=1;i<poker.length;i++)
		{
			refreash.swap(poker, random.nextInt(52), random.nextInt(52));
		}
		for(int i=1;i<poker.length;i++)
		{
			System.out.print(refreash.getColor(poker[i])+" "+refreash.getAppearance(poker[i]));
		}
	}
	public String getAppearance(int pokerNum)
	{
		String appearance = "";
		switch(pokerNum%13)
		{
			case 0:
				appearance="K";
				break;
			case 11:
				appearance="J";
				break;
			case 12:
				appearance="Q";
				break;
			default:
				appearance=pokerNum%13+"";
				break;
		}
		return appearance+" ";
	}
	public void swap(int poker[],int i,int j)
	{
		int temp=poker[i];
		poker[i]=poker[j];
		poker[j]=temp;
	}
	public String getColor(int num)
	{
		String color="";
		switch((num-1)/13)
		{
			case 0:
				color="红桃";
				break;
			case 1:
				color="黑桃";
				break;
			case 2:
				color="梅花";
				break;
			case 3:
				color="方块";
				break;			
		}
		return color;
	}
}