首页 > 解决方案 > Java Arrays 仅显示来自 2 个数组的精确值

问题描述

你好我是一名学生,我刚开始学习java,我有一个练习问题,我要做的第一件事是两个数组来显示每个月有多少天,但现在我必须再做一个我只需要显示有 31 天的月份的练习。你能解释一下如何显示吗?

class Main {
    public static void main(String[] args) {
        int month_days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        String months[] = {"Ianuarie ", "Februarie ", "Martie ", "Aprilie ", "Mai ", "Iunie ", "Iulie ", "August ", "Septembrie ", "Octombrie ", "Noiembrie  ", "Decembrie "};
        {
            int i;
            for (i = 0; i < 12; i++) {
                System.out.println(months[i] + month_days[i] + " zile.");
            }
        }
        {
            int i;
            for (i = 0; i < 12; i++) {
                System.out.println((month_days[i]));
            }
        }
    }
}

标签: javaarrays

解决方案


我强烈建议您先从https://docs.oracle.com/javase/tutorial/java/nutsandbolts/index.html学习 Java 语言,然后才能理解我所写的内容。

这些具有关键概念: 控制流语句表达式、语句和块

public class Main {
public static void main(String argv[]) {
        int month_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
        String months[] = { "Ianuarie ",
                            "Februarie ",
                            "Martie ",
                            "Aprilie ",
                            "Mai ",
                            "Iunie ",
                            "Iulie ",
                            "August ",
                            "Septembrie ",
                            "Octombrie ",
                            "Noiembrie  ",
                            "Decembrie " };
        int i;
        System.out.println("Months with 31 zile.");
        for (i = 0; i < 12; i++) {
            if (month_days[i] == 31) {
                System.out.println(months[i] + month_days[i] + " zile.");               
            }
        }
        System.out.println("Months with less than 31 zile.");
        for (i = 0; i < 12; i++) {
            if (month_days[i] != 31) {
                System.out.println(months[i] + month_days[i] + " zile.");               
            }
        }
    }
}

推荐阅读