2021-02-16

import java.util.Scanner;

//方法抽象和逐步求精
//方法抽象的概念可以应用于程序开发过程中。当编写一个大型程序时,可以使用分治的策略,也称逐步求精,将大问题分解为子问题。子问题又分解成更小更容易处理的问题。
//自顶向下的设计
//自顶向上方法是从下向上每次实现结构图中的一个方法,对每次实现的方法都写在一个测试程序(称为驱动器) 进行测试 。自顶向下和自底向上都是不错的方法:它们都是渐进的实现方法,这有助于分离程序设计错误,使得测试变得容易
//这两种方法可以一起使用
public class Demo05 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		
		System.out.println("输入年份:");
		int year = input.nextInt();
		
		System.out.println("输入月份:");
		int month = input.nextInt();
		
		printMonth(year,month);
	}
	
	public static void printMonth(int year, int month) {
		System.out.print(month + " " + year);
	}
	
	public static void printMonthTitle(int year, int month) {
		
	}
	
	public static void printMonthbody(int year, int month) {
		
	}
	
	public static String getMonthName(int month) {
		return "January";
	}
	
	public static int getStartDay(int year, int month) {
		return 1;
	}
	
	public static int getTotalNumberOfDays(int year,int month) {
		return 10000;
	}
	
	public static int getNumberOfDaysInMonth(int year,int month) {
		return 31;
	}
	
	public static boolean isLeapYear(int year) {
		return true;
	}
}
//实现细节
//逐步求精的优势:将一个大问题分解为小的易于处理的问题。每个问题可以使用一个方法来实现。这种方法使得问题更加易于编写、重用、调试、修改和维护。
import java.util.Scanner;

public class Demo06 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		
		System.out.println("输入年份:");
		int year = input.nextInt();
		
		System.out.println("输入月份:");
		int month = input.nextInt();
		
		printMonth(year,month);
	}
	
	public static void printMonth(int year, int month) {
		printMonthTitle(year, month);
		
		printMonthbody(year, month);
		
	}
	
	public static void printMonthTitle(int year, int month) {
		System.out.println("     	" + getMonthName(month) + " " + year);
		System.out.println("---------------------------");
		System.out.println("  Sun Mon Tue Wed Thur Fri Sat");
	}
	
	public static void printMonthbody(int year, int month) {
		int startDay = getStartDay(year, month);
		
		int numberOfDaysInMonth = getNumberOfDaysInMonth(year, month);
		
		int i = 0;
		for (i = 0; i < startDay; i++) {
			System.out.print("    ");
		}
		
		for (i = 1; i < numberOfDaysInMonth; i++) {
			System.out.printf("%4d",i);
			
			if ((i+ startDay) % 7 == 0) {
				System.out.println();
			}
		}
		System.out.println();
	}
	
	public static String getMonthName(int month) {
		String monthName = "";
		switch(month) {
		case 1:monthName = "January";break;
		case 2:monthName = "February";break;
		case 3:monthName = "March";break;
		case 4:monthName = "April";break;
		case 5:monthName = "May";break;
		case 6:monthName = "June";break;
		case 7:monthName = "July";break;
		case 8:monthName = "August";break;
		case 9:monthName = "September";break;
		case 10:monthName = "October";break;
		case 11:monthName = "November";break;
		case 12:monthName = "December";
		
		}
		return "monthName";
	}
	
	public static int getStartDay(int year, int month) {
		final int START_DAY_FOR_JAN_1_1800 = 3;
		
		int totalNumberOfDays = getTotalNumberOfDays(year, month);
		
		return (totalNumberOfDays + START_DAY_FOR_JAN_1_1800) % 7;
	}
	
	public static int getTotalNumberOfDays(int year,int month) {
		int total = 0;
		
		for (int i = 1800; i < year; i++) {
			if (isLeapYear(i)) {
				total += 366;
			}else {
				total += 365;
			}
		}
		
		for (int i = 1; i < month; i++) {
			total += getNumberOfDaysInMonth(year, i);
		}
		return total;
	}
	
	public static int getNumberOfDaysInMonth(int year,int month) {
		if (month == 1 || month == 3 || month == 5 || month == 7 || month == 8 || month == 10 || month == 12) {
			return 31;
		}
		
		if (month == 4 || month == 6 || month == 9 || month == 11) {
			return 30;
		}
		
		if (month == 2) {
			return isLeapYear(year) ? 29 : 28;
		}
		return 0;
	}
	
	public static boolean isLeapYear(int year) {
		return year % 400 == 0 || (year % 4 == 0 && year % 100 != 0);
	}

	}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值