JAVA 小Q 世界上最遥远的距离

JAVA 小Q 世界上最遥远的距离 解一

import java.util.Scanner;
public class ELE5{
	public static int monthD(int year, int month){
	      int monthD = 0;
	      if(month == 1 || month ==3 || month==5|| month ==7 || month ==8 || month == 10|| month == 12)
	    	  monthD = 31;
	      
	      else if(month ==4 || month ==6 || month == 9|| month == 11)
	    	  monthD = 30;
	      else if(year % 4 ==0 && year % 100!=0 || year %400 == 0)
	    	  monthD = 29;
	      else
	    	  monthD = 28;
	      return monthD;
	     }
    public static void main(String [] args) {
  Scanner scan= new Scanner(System.in);
     int n =scan.nextInt();
     int year = 2020;
     int month = 1;
     int day = 1;
     /*小Q的方向（向未来）*/
     for(int i = 0;i < n;i++) {
        day++;
        int nowday = monthD(year,month);
        if(day > nowday) {
         month = month+1;
         day = 1;
         if(month!=12) {
          year= year +month/12;
         month = month%12;
         }
        }
       }
     System.out.printf("%4d/%02d/%02d ", year,month,day);
     year= 2020;
     month= 1;
     day= 1;
     /*女友的方向（向过去）*/
     for(int i = 0;i < n;i++) {
        day--;
       
        if(day == 0) {
         month = month-1;
       if(month == 0) {
        month = 12;
        year--;
       }
         day = monthD(year,month);
        }
       }
     System.out.printf("%4d/%02d/%02d", year,month,day);
     
    }
}

先定义一个用于根据year 与 month 来返回对应本月有多少天的函数；
然后在主函数里正常分为两部分编写就好了。