package sdjgad;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class ddz {
public static void main(String[] args) {
//創建集合
Map<Integer, String> pokers = new HashMap<>();
List<Integer> list = new ArrayList();
String[] huase = {"梅花", "黑桃", "紅桃", "方片"};
String[] shuzi = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2",};
int num = 0;
for (String str : huase) {
for (String ste : shuzi) {
String poke = str + ste;
pokers.put(num, poke);
list.add(num);
num++;
}
}
pokers.put(num, "大王");
list.add(num++);
pokers.put(num, "小王");
list.add(num);
System.out.println("全部派："+pokers);
System.out.println("索引："+list);
//發牌
Collections.shuffle(list);
List<Integer> xiaohua = new ArrayList<>();
List<Integer> xiaohei = new ArrayList<>();
List<Integer> xiaowang = new ArrayList<>();
List<Integer> dipai = new ArrayList<>();
System.out.println("洗過的牌："+list);
for (int i =0; i < list.size();i++){
Integer pokeNUM=list.get(i);
if (i>=list.size()-3){
dipai.add(pokeNUM);
}else if (i%3==0){
xiaohua.add(pokeNUM);
}else if (i%3==1){
xiaohei.add(pokeNUM);
}else if (i%3==2){
xiaowang.add(pokeNUM);
}
}
System.out.println("小花："+ kanpoker(xiaohua,pokers));
System.out.println("小黑："+xiaohei);
System.out.println("小王:"+xiaowang);
System.out.println("底牌："+dipai);
}
private static String kanpoker(List <Integer>nums , Map<Integer,String>pokers){
Collections.sort(nums); //按順序整理牌
StringBuilder sb= new StringBuilder();
for (Integer num :nums){
String poker= pokers.get(num);
sb.append(poker);
}
String str = sb.toString();
return str.trim();
}
}
uj5u.com熱心網友回復：
仔細檢查你的看牌方法uj5u.com熱心網友回復：
System.out.println("小花："+ kanpoker(xiaohua,pokers));System.out.println("小黑："+kanpoker（xiaohei，pokers));
System.out.println("小王:"+kanpoker（xiaowang，pokers));
System.out.println("底牌："+kanpoker（dipai，pokers));
正確之后 還是不能正確排序
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/263563.html
標籤：Java SE