[递归]母牛的故事

解题思路:

注意事项:

import java.util.Scanner;

public class Demo1246 {

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

while (scanner.hasNext()) {

String string = scanner.nextLine();

// 找到一个表示每个月份的天数数组

int arr[] = new int[] { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

// 分割此字符串成三个部分

String[] arr1 = string.split("/");

int year = Integer.parseInt(arr1[0]);

int month = Integer.parseInt(arr1[1]);

int day = Integer.parseInt(arr1[2]);

int ans = 0;

if ((year % 4 == 0 && year % 100 != 0)||(year % 400 == 0)&&month>2) {

ans++;

}

int sum = 0;

for (int i = 0; i < month - 1; i++) {

sum += arr[i];

}

System.out.println(day+sum);

}

}

}