将C转化为Java 求一个厉害的人 帮帮我

Question

#include<stdio.h>
int main()
{
int i,total=0,n=0,number,a[11]={0},count=0;
//计算投入硬币价值，以-1结束
while(n!=-1){
total+=n;
scanf("%d",&n);
}
//计算输入所需产品的标号，并统计每个标号数量存在数组a，价格相加存放在count，以-1结束
while(number!=-1){
scanf("%d",&number);
if(number==-1){
break;
}
a[number]++;
if(number>0&&number<4){
count++;
}
else if(number>3&&number<6){
count+=2;
}
else if(number>5&&number<9){
count+=3;
}
else{
count+=4;
}
}
//如果产品的价格大于投入硬币数，输出Insufficient money
if(count>total){
printf("Insufficient money");
}
//如果钱足够，按题意进行以下输出
else{
printf("Total:%dyuan,change:%dyuan\n",total,total-count);
for(i=1;i<11;i++){
if(a[i]!=0){
switch(i){
case 1:printf("Table-water:%d;",a[i]);break;
case 2:printf("Table-water:%d;",a[i]);break;
case 3:printf("Table-water:%d;",a[i]);break;
case 4:printf("Coca-Cola:%d;",a[i]);break;
case 5:printf("Milk:%d;",a[i]);break;
case 6:printf("Beer:%d;",a[i]);break;
case 7:printf("Orange-Juice:%d;",a[i]);break;
case 8:printf("Sprite:%d;",a[i]);break;
case 9:printf("Oolong-Tea:%d;",a[i]);break;
case 10:printf("Green-Tea:%d;",a[i]);break;
}
}
}
}
return 0;
}

Answer 1

若有帮助请采纳！

import java.util.Scanner;

public class Text {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int i, total = 0, n = 0, number = 0, count = 0;
        int a[] = {0,0,0,0,0,0,0,0,0,0,0};
        //计算投入硬币价值，以-1结束
        System.out.println("请输入硬币：");
        while (n != -1) {
            total += n;
            n = sc.nextInt();
            if (n!=-1)
                System.out.println("若想继续增加硬币，请继续输入硬币；若想结束，请输入：-1");
        }
        //计算输入所需产品的标号，并统计每个标号数量存在数组a，价格相加存放在count，以-1结束
        System.out.println("请输入所需商品的标号：");
        while (number != -1){
            number = sc.nextInt();
            if (number == -1) {
                break;
            }

            try {
                a[number]++;
            }catch (ArrayIndexOutOfBoundsException e){
                System.out.println("无该商品的标号,请重新输入！");
            }

            if (number > 0 && number < 4) {
                count++;
            } else if (number > 3 && number < 6) {
                count += 2;
            } else if (number > 5 && number < 9) {
                count += 3;
            } else if (number > 8 && number < 11){
                count += 4;
            }
            System.out.println("若想继续添加所需商品，请继续输入其标号；若想结束，请输入：-1");
        }
        //如果产品的价格大于投入硬币数，输出Insufficient money
        if (count > total) {
            System.out.println("Insufficient money");
        }
        //如果钱足够，按题意进行以下输出
        else {
            System.out.println("Total:" + total + "yuan,change:" + (total - count) + "yuan");
            for (i = 1; i < 11; i++) {
                if (a[i] != 0) {
                    switch (i) {
                        case 1:
                            System.out.println(("Table-water:" + a[i]));
                            break;
                        case 2:
                            System.out.println(("Table-water:" + a[i]));
                            break;
                        case 3:
                            System.out.println(("Table-water:" + a[i]));
                            break;
                        case 4:
                            System.out.println(("Coca-Cola:" + a[i]));
                            break;
                        case 5:
                            System.out.println(("Milk:" + a[i]));
                            break;
                        case 6:
                            System.out.println(("Beer:" + a[i]));
                            break;
                        case 7:
                            System.out.println(("Orange-Juice:" + a[i]));
                            break;
                        case 8:
                            System.out.println(("Sprite:" + a[i]));
                            break;
                        case 9:
                            System.out.println(("Oolong-Tea:" + a[i]));
                            break;
                        case 10:
                            System.out.println(("Green-Tea:" + a[i]));
                            break;
                    }
                }
            }
        }
    }
}