扑克牌洗牌算法

最新推荐文章于 2024-11-14 19:06:32 发布

slowdownthenrunfast

最新推荐文章于 2024-11-14 19:06:32 发布

阅读量663

点赞数

分类专栏： Alogrithm 文章标签：算法

本文链接：https://blog.csdn.net/slowdownthenrunfast/article/details/38515023

版权

Alogrithm 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

package com.citi.byteman.test.arithmatic;

import java.util.Random;

public class XiPai {

	private String[] singleCard = { "2", "3", "4", "5", "6", "7", "8", "9",
			"10", "J", "Q", "K", "A" };
	private String[] allCards = new String[54];

	// shuffle 100 times, exchange two cards every time
	public void shuffleCards() {
		allCards = initCard();
		String temp = "";
		for (int i = 0; i < 100; i++) {
			int m = new Random().nextInt(54);
			int n = new Random().nextInt(54);
			temp = allCards[m];
			allCards[m] = allCards[n];
			allCards[n] = temp;
		}

	}

	// initial all 54 cards
	public String[] initCard() {
		for (int i = 0; i < singleCard.length; i++) {
			String[] tempCards = addMsg(singleCard[i]);
			for (int j = 0; j < 4; j++) {
				allCards[i * 4 + j] = tempCards[j];
			}
		}
		allCards[52] = "Big Joke";
		allCards[53] = "Small Joke";
		return allCards;
	}

	private String[] addMsg(String card) {
		return new String[] { "Black-" + card, "Red-" + card, "Plum-" + card,
				"Box-" + card };
	}

	public void printCurrentCards() {
		for (int i = 0; i < allCards.length; i++) {
			System.out.println(allCards[i]);
		}
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		XiPai xipai = new XiPai();
		xipai.shuffleCards();
		xipai.printCurrentCards();
	}

}

算法思想: 两个随机数对应扑克牌位置去相互交换