JAVA 实现斗地主分牌

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.TreeSet;

public class doudizhu2 {
public static void main(String[] args) {

ArrayList<Integer> array = new ArrayList<Integer>();

HashMap<Integer, String> ha = new HashMap<Integer, String>();

String[] color = { "♠", "♥", "♦", "♣" };

String[] dian = { "3", "4", "5", "6", "7", "8", "9", "10",
"J", "Q", "K" , "A", "2"};

int index = 0;

for (String number :dian){
for(String colors:color){

String poker = colors.concat(number);
ha.put(index, poker);
array.add(index);
index++;
}

}
ha.put(52, "小王");
array.add(index);
index++;
ha.put(53, "大王");
array.add(index);
Collections.shuffle(array);
TreeSet <Integer> wanjia1 = new TreeSet<Integer>();
TreeSet <Integer> wanjia2 = new TreeSet<Integer>();
TreeSet <Integer> wanjia3 = new TreeSet<Integer>();
TreeSet <Integer> dipai   = new TreeSet<Integer>();

for(int i=0;i<array.size();i++){
if(i>array.size()-4){
dipai.add(array.get(i));
}
else if(i%3==0){
wanjia1.add(array.get(i));
}
else if(i%3==1){
wanjia2.add(array.get(i));
}
else if(i%3==2){
wanjia3.add(array.get(i));
}
}
kanpai("玩家1",wanjia1,ha);
kanpai("玩家2",wanjia2,ha);
kanpai("玩家3",wanjia3,ha);
kanpai("底牌",dipai,ha);
}

public static void kanpai(String name , TreeSet<Integer> ts,
HashMap<Integer,String> ha){

System.out.print(name+"的手牌是：");
for(Integer k :ts){

System.out.print(ha.get(k));

}
System.out.println();
}
}