amazon 设计 7 genial card game

package card;

public class Game implements Runnable{
    int numPlayers;
    int startNumber;
    //players and hands seperate so players can't change their cards
    Player player[] = new Player[numPlayers];
    Hand hands[] = new Hand[numPlayers];
    Card topCard;
    Deck deck;

    public Game(){
        int numPlayers=2;
        int startNumber=7;
        deck = new Deck();
        for (int i=0; i<numPlayers; i++){
            //naming of players and hands should be the same, I havn't figured the best way to do this yet
            hands[i] = new Hand(deck, startNumber);
            player[i] = new Player(""+i,hands[i]);
        }
    }

    @Override
    public void run() {
        // TODO Auto-generated method stub
        boolean InGame = true;
        topCard = deck.drawCard();
        while(InGame){
            
        }
    }

}

 

package card;

import java.util.ArrayList;
import java.util.Random;

public class Deck {

    ArrayList<Card> cards;
    public Deck(){
        cards = new ArrayList<Card>();
        for (int a=0; a<13; a++) {
            for (int b=0; b<4 ; b++) {
                cards.add(new Card(a,b));
            }
        }
        shuffle();
    }
    
    private void swap(int i,int j){
        Card buf = cards.get(i);
        cards.set(i, cards.get(j));
        cards.set(j, buf);
    }
    
    private void shuffle(){
        Random rand = new Random();
        for(int i=0; i<cards.size(); i++){
            int ran = rand.nextInt(cards.size());
            swap(i,ran);
        }
    }
    
    public Card drawCard(){
        if(cards.size() <= 0){
            //
        }else{
            Card temp = (Card) cards.get(cards.size()-1);
            cards.remove(cards.size()-1);
            System.out.println("Card "+temp+" drawn from deck\n");
            return temp;
         
        }
        return null;
    }

}

 

package card;

import java.util.ArrayList;

public class Hand {


        private ArrayList<Card> cards = new ArrayList<Card>();
        private Card toPlay;
        private Deck deck;
        private final String name;

        public Hand(Deck d, int num){
            deck = d;
            start(num);
        }
        private void start(int num){
            for (int i=0; i<num; i++) {
                pickUp();
            }
        }
        public Card getCard(int i){
            return (Card)(cards.get(i));
        }
        public int size(){
            return cards.size();
        }
        public void setPlay(Card c){
            toPlay = c;
        }
        public void print(){
            for (int i=0; i<size(); i++){
                System.out.println(cards.get(i));
            }
            System.out.println("\n\n");
        }

        private void pickUp(){
            cards.add(deck.drawCard());
        }


        public Card play(Card topCard){
    
        }
    

}

 

/*http://facepunch.com/showthread.php?t=1179730*/

package card;

public class Player {

    private final String name;
    private Hand myHand;
    
    public Player(String name, Hand hand){
        myHand = hand;
        this.name = name; 
    }
    public void turn(Card topCard);
    
    
    

}

 

package card;


public class Card {
    private static String[] COLOR = {"red","black"};
    private static String[] SUITS = {"heart","spade","club","diamond"};
    private static String[] ranks = {"Ace", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Jack", "Queen", "King", "Joker"};
    

    private final int suit;
    private final int color;
    private final int values;
   
    private final String name;
    
    public Card(int val, int suit){
        this.values = val;
        this.suit = suit;
    }
 

    public String getNmae();
    public int getSuit();
    public int getVaule();
    

}

 

转载于:https://www.cnblogs.com/leetcode/p/3906247.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
代码下载:完整代码,可直接运行 ;运行版本:2022a或2019b或2014a;若运行有问题,可私信博主; **仿真咨询 1 各类智能优化算法改进及应用** 生产调度、经济调度、装配线调度、充电优化、车间调度、发车优化、水库调度、三维装箱、物流选址、货位优化、公交排班优化、充电桩布局优化、车间布局优化、集装箱船配载优化、水泵组合优化、解医疗资源分配优化、设施布局优化、可视域基站和无人机选址优化 **2 机器学习和深度学习方面** 卷积神经网络(CNN)、LSTM、支持向量机(SVM)、最小二乘支持向量机(LSSVM)、极限学习机(ELM)、核极限学习机(KELM)、BP、RBF、宽度学习、DBN、RF、RBF、DELM、XGBOOST、TCN实现风电预测、光伏预测、电池寿命预测、辐射源识别、交通流预测、负荷预测、股价预测、PM2.5浓度预测、电池健康状态预测、水体光学参数反演、NLOS信号识别、地铁停车精准预测、变压器故障诊断 **3 图像处理方面** 图像识别、图像分割、图像检测、图像隐藏、图像配准、图像拼接、图像融合、图像增强、图像压缩感知 **4 路径规划方面** 旅行商问题(TSP)、车辆路径问题(VRP、MVRP、CVRP、VRPTW等)、无人机三维路径规划、无人机协同、无人机编队、机器人路径规划、栅格地图路径规划、多式联运运输问题、车辆协同无人机路径规划、天线线性阵列分布优化、车间布局优化 **5 无人机应用方面** 无人机路径规划、无人机控制、无人机编队、无人机协同、无人机任务分配 **6 无线传感器定位及布局方面** 传感器部署优化、通信协议优化、路由优化、目标定位优化、Dv-Hop定位优化、Leach协议优化、WSN覆盖优化、组播优化、RSSI定位优化 **7 信号处理方面** 信号识别、信号加密、信号去噪、信号增强、雷达信号处理、信号水印嵌入提取、肌电信号、脑电信号、信号配时优化 **8 电力系统方面** 微电网优化、无功优化、配电网重构、储能配置 **9 元胞自动机方面** 交通流 人群疏散 病毒扩散 晶体生长 **10 雷达方面** 卡尔曼滤波跟踪、航迹关联、航迹融合

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值