日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

java 扑克牌排序_java 怎么写compareto方法实现扑克牌排序

發布時間:2023/12/20 编程问答 31 豆豆
生活随笔 收集整理的這篇文章主要介紹了 java 扑克牌排序_java 怎么写compareto方法实现扑克牌排序 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

展開全部

public class Card {

private String face;

private String suit;

public String getFace() {

return face;

}

public void setFace(String face) {

this.face = face;

}

public String getSuit() {

return suit;

}

public void setSuit(String suit) {

this.suit = suit;

}

public Card(String face, String suit) {

super();

this.face = face;

this.suit = suit;

}

public Card() {

// TODO Auto-generated constructor stub

}

----------------------------------------------------------------------------------

public class Consts {

public static final String BLACK = "3"; //黑桃e69da5e887aa62616964757a686964616f31333337383265

public static final String RED = "2"; //紅桃

public static final String CLUB = "1"; //梅花

public static final String DIAMOND = "0";//方塊

}

------------------------------------------------------------------------------------

public class OrderTool {

public List doOrder(Card[] card_array) {

List list = new ArrayList();

// 按類排序

if (card_array != null && card_array.length > 0) {

Card temp = null;

int flag = 0;

for (int i = 0; i < card_array.length; i++) {

if (flag > 0) {

System.out.println("請檢查傳入的紙牌值!");

break;

}

for (int j = i + 1; j < card_array.length; j++) {

int i_suit = this.convert(card_array[i].getFace());

int j_suit = this.convert(card_array[j].getFace());

if (i_suit == -1 || j_suit == -1) {

flag++;

break;

}

if (i_suit > j_suit) {

temp = card_array[i];

card_array[i] = card_array[j];

card_array[j] = temp;

} else if (i_suit == j_suit) {

int i_face = Integer.parseInt(card_array[i].getSuit());

int j_face = Integer.parseInt(card_array[j].getSuit());

if (i_face < j_face) {

temp = card_array[i];

card_array[i] = card_array[j];

card_array[j] = temp;

}

}

}

}

for(Card card : card_array){

list.add(card);

}

}

return list;

}

private int convert(String param) {

int res = 0;

try {

res = Integer.parseInt(param);

return res;

} catch (Exception e) {

if ("A".equalsIgnoreCase(param)) {

return 1;

} else if ("J".equalsIgnoreCase(param)) {

return 11;

} else if ("Q".equalsIgnoreCase(param)) {

return 12;

} else if ("K".equalsIgnoreCase(param)) {

return 13;

} else {

System.out.println("拿的是王吧!");

return -1;

}

}

}

public static String faceTranslater(int face){

String res = "";

switch(face){

case 3:res = "黑桃";break;

case 2:res = "紅桃";break;

case 1:res = "梅花";break;

case 0:res = "方塊";break;

}

return res;

}

//測試

public static void main(String[] args) {

Card c0 = new Card("A",Consts.BLACK);

Card c1 = new Card("2",Consts.BLACK);

Card c2 = new Card("A",Consts.RED);

Card c3 = new Card("5",Consts.CLUB);

Card c4 = new Card("4",Consts.RED);

Card c5 = new Card("3",Consts.DIAMOND);

Card c6 = new Card("4",Consts.BLACK);

Card[] c = {c0,c1,c2,c3,c4,c5,c6};

List list = new OrderTool().doOrder(c);

for(Card card : list){

System.out.println("花色:"+OrderTool.faceTranslater(Integer.parseInt(card.getSuit()))+"&"+"牌面:"+card.getFace());

}

}

本回答被網友采納

已贊過

已踩過<

你對這個回答的評價是?

評論

收起

總結

以上是生活随笔為你收集整理的java 扑克牌排序_java 怎么写compareto方法实现扑克牌排序的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。