版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/amy260231120/article/details/83028420
package com.luffy.map;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.TreeSet;
public class Demo2 {
public static void main(String[] args) {
// TODO Auto-generated method stub
// 1扑克
String[] num = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2"};
String[] color = {"红桃", "黑桃", "方块", "梅花"};
HashMap<Integer, String> poker = new HashMap<>();
ArrayList<Integer> pokerIndex = new ArrayList<>();
int index = 0;
for (String s1 : num) {
for (String s2 : color) {
poker.put(index, s2.concat(s1));
pokerIndex.add(index);
index += 1;
}
}
System.out.println(index);
// 洗牌 对index进行乱序
Collections.shuffle(pokerIndex);
// for (Integer key : pokerIndex) {
// System.out.println(poker.get(key) );
// }
// 发牌 TreeSet会自动对index进行排序
TreeSet<Integer> number1 = new TreeSet<>();
TreeSet<Integer> number2 = new TreeSet<>();
TreeSet<Integer> number3 = new TreeSet<>();
TreeSet<Integer> dipai = new TreeSet<>();
for (int index2 = 0; index2 < poker.size() - 3; index2++) {
if (index2 % 3 == 0) {
number1.add(pokerIndex.get(index2));
} else if (index2 % 3 == 1) {
number2.add(pokerIndex.get(index2));
} else {
number3.add(pokerIndex.get(index2));
}
}
dipai.add(pokerIndex.get(poker.size()-3));
dipai.add(pokerIndex.get(poker.size()-2));
dipai.add(pokerIndex.get(poker.size()-1));
// 看牌
lookPoker("numbr1", number1, poker);
lookPoker("number2", number2, poker);
lookPoker("numbr3", number3, poker);
lookPoker("dipai", dipai, poker);
}
private static void lookPoker(String name, TreeSet<Integer> number1, HashMap<Integer, String> poker) {
// TODO Auto-generated method stub
System.out.println("name" + "=" + name);
for (Integer integer : number1) {
System.out.print(poker.get(integer));
}
System.out.println();
}
}