题目
根据输入的日期,计算是这一年的第几天
详细描述:
输入某年某月某日,判断这一天是这一年的第几天?
输入描述:
输入三行,分别是年,月,日
输出描述:
成功:返回outDay输出计算后的第几天;失败:返回-1
示例1
输入
2012
12
31
输出
366
代码:
import java.text.SimpleDateFormat;
import java.util.Calendar;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
System.out.println(iConverDataToDay(2012,12,31));
System.out.println(iConverDataToDay1(2012,12,31));
System.out.println(dayOfYear(2012,12,31));
}
//1.调用Calendar.getInstance()获取指定时间
public static int iConverDataToDay(int year,int month,int day){
if(year<=0||month<=0||month>13||day<=0||day>31){//判断年月日的合法性
return -1;
}
//java中使用SimpleDateFormat类的构造函数SimpleDateFormat(String str)构造格式化日期的格式,
//通过format(Date date)方法将指定的日期对象格式化为指定格式的字符串.
Calendar c=Calendar.getInstance();
c.set(year,month-1,day);//Calendar.getInstance()获取当天指定点上的时间
SimpleDateFormat simpleDateFormat=new SimpleDateFormat("D");//D代表天数,构造日期格式
return Integer.valueOf(simpleDateFormat.format(c.getTime()));//打印天数
}
//瑞年判断
public static boolean isLeapYear(int year){
return (year % 4 == 0) && (year % 100 != 0) || year % 400 == 0;
}
2.列出所有的情况进行计算
public static int iConverDataToDay1(int year,int month,int day){
int count=1;
if(month>12||day>31||(month==2 && (day>29))||day<=0){//判断年月日的合法性
return -1;
}
if(month==1){
count=day;
}
if(month==2){
count=31+day;
}
if(month==3&&!isLeapYear(year)){
count=31+28+day;
}else if(month==3 && isLeapYear(year)){
count=31+29+day;
}
if(month==4&&!isLeapYear(year)){
count=31+28+30+day;
}else if(month==4&&isLeapYear(year)){
count=31+29+30+day;
}
if(month==5&&!isLeapYear(year)){
count=31+28+31+30+day;
}else if(month==5&&isLeapYear(year)){
count=31+29+31+30+day;
}
if(month==6&&!isLeapYear(year)){
count=31+28+31+30+31+day;
}else if(month==6&&isLeapYear(year)){
count=31+29+31+30+31+day;
}
if(month==7&&!isLeapYear(year)){
count=31+28+31+30+31+30+day;
}else if(month==7&&isLeapYear(year)){
count=31+29+31+30+31+30+day;
}
if(month==8&&!isLeapYear(year)){
count=31+28+31+30+31+30+31+day;
}else if(month==8&&isLeapYear(year)){
count=31+29+31+30+31+30+31+day;
}
if(month==9 && !isLeapYear(year)){
count=31+28+31+30+31+30+31+30+day;
}else if(month==9&&isLeapYear(year)){
count=31+29+31+30+31+30+31+30+day;
}
if(month==10&&!isLeapYear(year)){
count=31+28+31+30+31+30+31+31+30+day;
}else if(month==10&&isLeapYear(year)){
count=31+29+31+30+31+30+31+31+30+day;
}
if(month==11&&!isLeapYear(year)){
count=31+28+31+30+31+30+31+31+30+31+day;
}else if(month==11&&isLeapYear(year)){
count=31+29+31+30+31+30+31+31+30+31+day;
}
if(month==12&&!isLeapYear(year)){
count=31+28+31+30+31+30+31+31+30+31+30+day;
}else if(month==12&&isLeapYear(year)){
count=31+29+31+30+31+30+31+31+30+31+30+day;
}
return count;
}
//3.使用switch,case语句,去掉break,把12月放在第一个case中,1月放在最后一个case中,按照代码顺序执行。
public static int dayOfYear(int year,int month,int day){
switch (month){
case 12:
day+=30;
case 11:
day+=31;
case 10:
day+=30;
case 9:
day+=31;
case 8:
day+=31;
case 7:
day+=30;
case 6:
day+=31;
case 5:
day+=30;
case 4:
day+=31;
case 3:{
if(year%4==0&&year%100!=0||year%400==0){
day+=29;
}else{
day+=28;
}
}
case 2:
day+=31;
case 1:
day+=0;
}
return day;
}
4.利用for循环。
private static int outDay(int year, int month, int day) {
int [] Day={31,28,31,30,31,30,31,31,30,31,30,31};//存放天数的数组,下标从0开始。
if(month>12||day>31||(month==2 && (day>29))||day<=0){//判断年月日的合法性
return -1;
}
if(year%4==0&&year%100!=0||year%400==0){
//如果为瑞年则将二月设置为29天。
Day[1]=29;
}
int sum=0;
//month=9;
for (int i = 0; i < month-1; i++) {//循环结束时month的下标为month-2.
sum+=Day[i];
}
return sum+day;//求和天数加上输入的天数。
}
}
}
运行结果:
366
366
366