第七色在线视频,2021少妇久久久久久久久久,亚洲欧洲精品成人久久av18,亚洲国产精品特色大片观看完整版,孙宇晨将参加特朗普的晚宴

為了賬號(hào)安全,請(qǐng)及時(shí)綁定郵箱和手機(jī)立即綁定
已解決430363個(gè)問(wèn)題,去搜搜看,總會(huì)有你想問(wèn)的

java源碼空指針

java源碼空指針

include_ice 2018-01-18 14:04:33
package?poker; /* ?*?玩家類 ?*/ public?class?paly?{ //?Id public?String?id; //?姓名 public?String?name; public?paly()?{ } public?paly(String?id,?String?name)?{ this.id?=?id; this.name?=?name; } }package?poker; /* ?*?撲克類 ?*/ public?class?poker?{ Integer?i; String?num; String?num2; //?牌 public?poker(Integer?i,?String?num,?String?num2)?{ this.num?=?num; this.num2?=?num2; this.i?=?i; } public?poker()?{ } //?@Override //?public?int?compareTo(poker?o)?{ //?//?TODO?Auto-generated?method?stu //?return?this.i.compareTo(o.i); //?} }package?poker; import?java.util.ArrayList; import?java.util.Collections; import?java.util.HashMap; import?java.util.List; import?java.util.Map; import?java.util.Random; import?java.util.Scanner; public?class?run?{ Random?random?=?new?Random(); int?a?; private?static?Scanner?console?=?new?Scanner(System.in); //?手牌1 public?Map<Integer,?poker>?Paly1Poker; //?手牌2 public?Map<Integer,?poker>?Paly2Poker; //?牌庫(kù) public?Map<Integer,?poker>?PokerMap; // 用于給玩家1手牌排序 static?List<Integer>?a1?=?new?ArrayList<Integer>(); // 用于給玩家2手牌排序 static?List<Integer>?a2?=?new?ArrayList<Integer>(); public?run()?{ this.PokerMap?=?new?HashMap<Integer,?poker>(); } //?加載牌庫(kù)內(nèi)容,完成 public?void?pokerMap()?{ //?TODO?Auto-generated?method?stub //?牌的大小總是有順序的,可以用int類來(lái)代替 //?3 PokerMap.put(0,?new?poker(0,?"3",?"方塊")); PokerMap.put(1,?new?poker(1,?"3",?"梅花")); PokerMap.put(2,?new?poker(2,?"3",?"紅桃")); PokerMap.put(3,?new?poker(3,?"3",?"黑桃")); //?4 PokerMap.put(4,?new?poker(4,?"4",?"方塊")); PokerMap.put(5,?new?poker(5,?"4",?"梅花")); PokerMap.put(6,?new?poker(6,?"4",?"紅桃")); PokerMap.put(7,?new?poker(7,?"4",?"黑桃")); //?5 PokerMap.put(8,?new?poker(8,?"5",?"方塊")); PokerMap.put(9,?new?poker(9,?"5",?"梅花")); PokerMap.put(10,?new?poker(10,?"5",?"紅桃")); PokerMap.put(11,?new?poker(11,?"5",?"黑桃")); //?6 PokerMap.put(12,?new?poker(12,?"6",?"方塊")); PokerMap.put(13,?new?poker(13,?"6",?"梅花")); PokerMap.put(14,?new?poker(14,?"6",?"紅桃")); PokerMap.put(15,?new?poker(15,?"6",?"黑桃")); //?7 PokerMap.put(16,?new?poker(16,?"7",?"方塊")); PokerMap.put(17,?new?poker(17,?"7",?"梅花")); PokerMap.put(18,?new?poker(18,?"7",?"紅桃")); PokerMap.put(19,?new?poker(19,?"7",?"黑桃")); //?8 PokerMap.put(20,?new?poker(20,?"8",?"方塊")); PokerMap.put(21,?new?poker(21,?"8",?"梅花")); PokerMap.put(22,?new?poker(22,?"8",?"紅桃")); PokerMap.put(23,?new?poker(23,?"8",?"黑桃")); //?9 PokerMap.put(24,?new?poker(24,?"9",?"方塊")); PokerMap.put(25,?new?poker(25,?"9",?"梅花")); PokerMap.put(26,?new?poker(26,?"9",?"紅桃")); PokerMap.put(27,?new?poker(27,?"9",?"黑桃")); //?10 PokerMap.put(28,?new?poker(28,?"10",?"方塊")); PokerMap.put(29,?new?poker(29,?"10",?"梅花")); PokerMap.put(30,?new?poker(30,?"10",?"紅桃")); PokerMap.put(31,?new?poker(31,?"10",?"黑桃")); //?J PokerMap.put(32,?new?poker(32,?"J",?"方塊")); PokerMap.put(33,?new?poker(33,?"J",?"梅花")); PokerMap.put(34,?new?poker(34,?"J",?"紅桃")); PokerMap.put(35,?new?poker(35,?"J",?"黑桃")); //?Q PokerMap.put(36,?new?poker(36,?"Q",?"方塊")); PokerMap.put(37,?new?poker(37,?"Q",?"梅花")); PokerMap.put(38,?new?poker(38,?"Q",?"紅桃")); PokerMap.put(39,?new?poker(39,?"Q",?"黑桃")); //?K PokerMap.put(40,?new?poker(40,?"K",?"方塊")); PokerMap.put(41,?new?poker(41,?"K",?"梅花")); PokerMap.put(42,?new?poker(42,?"K",?"紅桃")); PokerMap.put(43,?new?poker(43,?"K",?"黑桃")); //?A PokerMap.put(44,?new?poker(44,?"A",?"方塊")); PokerMap.put(45,?new?poker(45,?"A",?"梅花")); PokerMap.put(46,?new?poker(46,?"A",?"紅桃")); PokerMap.put(47,?new?poker(47,?"A",?"黑桃")); //?2 PokerMap.put(48,?new?poker(48,?"2",?"方塊")); PokerMap.put(49,?new?poker(49,?"2",?"梅花")); PokerMap.put(50,?new?poker(50,?"2",?"紅桃")); PokerMap.put(51,?new?poker(51,?"2",?"黑桃")); System.out.println("牌庫(kù)加載中"?+?"\n"?+?"----------洗牌中----------"); System.out.println("牌庫(kù)加載完畢"?+?"\n"?+?"----------洗牌完成---------"); //?假的,沒(méi)洗 } //?給玩家1隨機(jī)發(fā)牌,完成 public?void?getpoker()?{ //?玩家1抽2張牌,每獲取一張牌則將其從牌庫(kù)刪除,就不需要檢查玩家的牌是否重復(fù) for?(int?i?=?1;?i?<?3;?i++)?{ System.out.print("玩家1,第"?+?i?+?"次抽牌:"); //?為了防止第二個(gè)隨機(jī)數(shù)與第一個(gè)相同,需要檢查牌庫(kù)中是否有此牌,如果沒(méi)有則繼續(xù)抽 do?{ a?=?random.nextInt(51); } //?檢查牌庫(kù)中是否有此牌,有則取出來(lái),沒(méi)有則繼續(xù)抽牌 while?(PokerMap.get((Integer)a)==null); //將牌加入玩家手牌 Paly1Poker.put(a,?PokerMap.get(a)); // 打印玩家抽到的牌 System.out.println(Paly1Poker.get(a).num2?+?Paly1Poker.get(a).num); //將Map中的牌傳進(jìn)list再排序 a1.add(Paly1Poker.get(a).i); // 將抽出的牌從牌庫(kù)刪除 PokerMap.remove(a); } } //?給玩家2隨機(jī)發(fā)牌,完成 public?void?getpoker2()?{ //?玩家2抽2張牌牌,每獲取一張牌則將其從牌庫(kù)刪除,就不需要檢查牌是否重復(fù) for?(int?i?=?1;?i?<?3;?i++)?{ System.out.println("玩家2第"?+?i?+?"抽牌:"); //?為了防止第二個(gè)隨機(jī)數(shù)與第一個(gè)相同,需要檢查牌庫(kù)中是否有此牌,如果沒(méi)有則繼續(xù)抽 do?{ a?=?random.nextInt(51); } //?檢查牌庫(kù)中是否有此牌,有則取出來(lái),沒(méi)有則繼續(xù)抽牌 while?(PokerMap.get(a)?==?null); Paly2Poker.put(a,?PokerMap.get(a));//運(yùn)行結(jié)果指出這里?。。】罩羔槷惓#。?! System.out.println(Paly2Poker.get(a).num2?+?Paly2Poker.get(a).num); //將Map中的牌傳進(jìn)list再排序 a1.add(Paly1Poker.get(a).i); // 將抽出的牌從牌庫(kù)刪除 PokerMap.remove(a); } } //?比較兩個(gè)玩家中牌面大小判定輸贏,打印玩家手中的牌 public?static?void?main(String[]?args)?{ //?TODO?Auto-generated?method?stub run?n1?=?new?run(); //?加載牌庫(kù) n1.pokerMap(); //?創(chuàng)建玩家 System.out.println("請(qǐng)輸入第一個(gè)玩家的id"); String?p1id?=?console.next(); System.out.println("請(qǐng)輸入第一個(gè)玩家的姓名"); String?p1name?=?console.next(); System.out.println("請(qǐng)輸入第二個(gè)玩家的id"); String?p2id?=?console.next(); System.out.println("請(qǐng)輸入第二個(gè)玩家的姓名"); String?p2name?=?console.next(); paly?p1?=?new?paly(p1id,?p1name); paly?p2?=?new?paly(p2id,?p2name); //?發(fā)牌 n1.getpoker(); n1.getpoker2(); Collections.sort(a1); Collections.sort(a2); int?b1?=?a1.get(1); int?b2?=?a2.get(1); if?(b1?>?b2)?{ System.out.println("玩家"?+?p1.id?+?"."?+?p1.name?+?"獲得勝利"); }?else?{ System.out.println("玩家"?+?p2.id?+?"."?+?p2.name?+?"獲得勝利"); } } }
查看完整描述

1 回答

?
留得枯荷聽雨聲lyx

TA貢獻(xiàn)51條經(jīng)驗(yàn) 獲得超16個(gè)贊

http://img1.sycdn.imooc.com//5a6065a400018fcf06660076.jpg

while部分改成:

while(PokerMap.get((int)a)?==?null);

沒(méi)有轉(zhuǎn)化為整型下面put里面是找不到對(duì)應(yīng)的吧。

查看完整回答
反對(duì) 回復(fù) 2018-01-18
  • 1 回答
  • 0 關(guān)注
  • 1077 瀏覽
慕課專欄
更多

添加回答

舉報(bào)

0/150
提交
取消
微信客服

購(gòu)課補(bǔ)貼
聯(lián)系客服咨詢優(yōu)惠詳情

幫助反饋 APP下載

慕課網(wǎng)APP
您的移動(dòng)學(xué)習(xí)伙伴

公眾號(hào)

掃描二維碼
關(guān)注慕課網(wǎng)微信公眾號(hào)