Java评分方法

时间:2013-02-22 21:57:17

标签: java string loops

目前停留在某项计划上,以确定某个国家/地区的最高得分。我遇到的问题是确定如何通过用户的输入获得得分最高的国家。主要关注的是输出得分最高的国家和赢得的奖牌(前美国赢得2金1银1铜)。我只关心美国方法atm。我对我所关注的领域发表了一些评论。

import java.util.Scanner;
class OlympicMedalsEM
{
public static void main (String[] args)
{
    Scanner kb = new Scanner(System.in);
    int winner=0;
    String countrywin;
    int gold=0, silver=0, bronze=0, count=0, num=0, sum=0;      //num as in the number of countries
    int goldscore=0, silverscore=0, bronzescore=0;
    String country;
    {
    System.out.println("Please choose a scoring method. a for American or c for Canadian. ");
    char again = kb.next().charAt(0);
        if(again == 'a')//american method
        {
            // American method counts the medals with the most score. ex: gold is worth 3, silver 2, and bronze 1.
            // USA win 3 gold 1 silver 0 bronze = 11 points so to speak.
            {
            System.out.println("Enter the number of countries competing: ");
            num = kb.nextInt();
            {
            for (int x=0; x < num; x++)
                {
                System.out.println("Enter country and medal count(from gold to bronze): ");
                country = kb.next();
                gold = kb.nextInt();
                silver = kb.nextInt();
                bronze = kb.nextInt();
                country += country; // not sure if for loops works better than while. Not even sure is country should be counted
                }
            }
                    {
                    goldscore = gold * 3;
                    silverscore = silver * 2;
                    bronzescore = bronze * 1;
                    sum = goldscore + silverscore + bronzescore;
                        winner = sum;
                        // determine the highest score for the winner(?)
                        if (sum < winner) 
                    winner = sum;
                    }
                {
                // country is String need to change to a int(?). 
                // need it to also figure out how to pick the country with the high quality of medals
                // Possibly substitute countrywin instead of country?
                    System.out.println("The winner is: " + country + " with " + gold + " gold medals," + silver + " silver medals, and " + bronze + " bronze medals.");
                }
            }
        }
        else if(again == 'c')//canadian method
        {
            // Canadian method which counts the total number of medals
            {
            System.out.println("Enter the number of countries competing: ");
            num = kb.nextInt();
            {
            while (count<=num)
                {
                System.out.println("Enter country and medal count(from gold to bronze): ");
                country = kb.next();
                gold = kb.nextInt();
                silver = kb.nextInt();
                bronze = kb.nextInt();
                // need to understand the american version first before proceding
                +=;
                }
            }
                    {
                    sum = gold + silver + bronze;
                        }
                {
                    System.out.println("The winner is: " + country + " with " + gold + " gold medals," + silver + " silver medals, and " + bronze + " bronze medals.");
                }
            }
        }
        else
        {
            System.err.println("invalid answer");
        }
    }
}
}

4 个答案:

答案 0 :(得分:0)

查看Priority Queue
您可以使用自己的Comparator

获得所需的最小/最大值

答案 1 :(得分:0)

这样想。如果一个国家的奖牌计数输入小于前一个,为什么继续存储它。有一个当前高的变量,只在需要时才覆盖它们。

int currentHigh = 0;
int noOfCountries = 10;
int input;

for(int i=0; i<noOfCountries; i++) {
    input = in.nextInt();
    if(input>currentHigh) {
        currentHigh=input;
    }
}

答案 2 :(得分:0)

如果这是作业,你有没有学过课程?这看起来是使用它们的好时机。

我会创建一个国家/地区类,其中包含每个奖牌数和国家/地区名称的字段。然后,您可以在类中编写一个sum方法,该方法将返回该国家/地区拥有的所有奖牌的值。然后检查当前国家/地区与具有类似@pattmorters答案的分数最高的国家/地区的总和。

另外,我会将if/else语句换成switch。 (非常适合菜单选择)。

如果这不是作业,我可以给你一些示例代码。 ;)

答案 3 :(得分:0)

您可以尝试使用数组来存储总和值和国家/地区的名称。根据您的情况,您可以使用代码。它不一定完美,但它的工作原理。您还可以添加try和catch块,以确保在用户输入错误类型的数据(即int而不是char)时程序不会崩溃。

 import java.util.Scanner;
 class OlympicMedalsEM
  {
    public static void main (String[] args)
      {
        Scanner kb = new Scanner(System.in);
        int goldscore=0, silverscore=0, bronzescore=0;
        String[] country;
       {
         System.out.println("Please choose a scoring method. a for American or c for Canadian.");                              
char again = kb.next().charAt(0);
    if(again == 'a')//american method
    {
        // American method counts the medals with the most score. ex: gold is worth 3,    silver 2, and bronze 1.
        // USA win 3 gold 1 silver 0 bronze = 11 points so to speak.
        {
        System.out.println("Enter the number of countries competing: ");
        int num = kb.nextInt();
        int []sum = new int[num];            // Create sum array with "num"         number of elements, each representing sum for one country
        country = new String[num];           
        {
        /** each country is saved in a string array "country" element with corresponding sum in the "sum" array */
        for (int x=0; x < num; x++)
            {
            System.out.println("Enter country and medal count(from gold to bronze): ");
            country[x] = kb.next();
            goldscore = kb.nextInt()*3;
            silverscore = kb.nextInt()*2;
            bronzescore = kb.nextInt()*1;
            sum[x]= goldscore+silverscore+bronzescore;

            }
        }       /** gets index of array "sum" with highest value element */
                int MaxIndex=0;
                for (int c=0; c<sum.length-1; c++){
                   if (sum[c+1]>sum[c]){
                   MaxIndex=c+1;
                   }
                }
                /** country with most medals is saved in the same index number as the maximum sum index */
                System.out.println(" the country with most medals is :" + country[MaxIndex]);
                }
                }

                }
                }
                }