Course Solutions Uncategorized (Solved) : Import Javautilarraylist Import Javautilrandom Import Javautilscanner Public Class Jeopard Q26340316 . . . .

(Solved) : Import Javautilarraylist Import Javautilrandom Import Javautilscanner Public Class Jeopard Q26340316 . . . .

 

import java.util.ArrayList;
import java.util.Random;
import java.util.Scanner;
public class JeopardyGame
{
public static void main(String args[])
{
Scanner input_letter = new Scanner(System.in);
ArrayList possiblevalues= new ArrayList() {{add(‘r’);add(‘h’);}};
int playerzdice=0;
int computerzdice=0;
int player_points=0;
int computer_points=0;
int max_points_in_a_turn_computer = 0; // maximum points thecomputer can get per turn.
boolean playerz_turn = true;//check if player’s turn.
while(player_points<100 || computer_points <100)
{
if(playerz_turn)
{
while(true)
{
System.out.println(“Gamer 1, you have “+player_points + ” pointsnow..in total. Plz enter”+possiblevalues+” where r to Roll, h tohold dice”);
char action = input_letter.next().charAt(0);
if(action == ‘r’)
{
playerzdice = rollDice();
System.out.println(“Gamer 1 you got ” + playerzdice);
if(playerzdice == 1)
{
System.out.println(“Gamer 1..Your Turn Over”);
playerzdice = 0;
player_points = 0;
playerz_turn =! playerz_turn;
break;
}
else
{
player_points=+playerzdice;
System.out.println(“Gamer 1 your total is ” +player_points);
}
}
else if(action == ‘h’) // if to hold
{
System.out.println(“Gamer 1’s current score is”+player_points);
playerz_turn

OR

PayPal Gateway not configured

OR

PayPal Gateway not configured

Leave a Reply

Your email address will not be published. Required fields are marked *

Related Post

(Solved) : Algorithm Mindistance 0n 1 Input Array 0n 1 Numbers Output Minimum Distance Two Elements D Q29362353 . . . .(Solved) : Algorithm Mindistance 0n 1 Input Array 0n 1 Numbers Output Minimum Distance Two Elements D Q29362353 . . . .

<p>ALGORITHM MinDistance(A[0..n?1])</p><p>//Input: Array A[0..n?1]of numbers</p><p>//Output: Minimum distance between two of its elements</p><p>dmin??</p><p>for i ?0 to n?1do</p><p>for j ?0 to n?1do</p><p>if i =j and|A[i]?A[j]|< dmin</p><p>dmin?|A[i]?A[j]|</p><p>return dmin</p><p>what is best case worst case