提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档
题目:
定义一个Date类,创建两个对象存放两个日期,求两个日期的间隔(单位:天)。
代码:
#include<iostream>
using namespace std;
class CDate
{
private:int year,month,day;
public:
CDate(int y, int m, int d)
{
year=y;month=m;day=d;
}
bool IsLeapYear(int year);
long GetDays();
long operator-(CDate date);
void Show();
};
void CDate::Show()
{
cout<<year<<"-"<<month<<"-"<<day;
}
bool CDate::IsLeapYear(int year)
{
if(0 == year%400 || (0!=year%100 && 0==year%4))
return true;
else
return false;
}long CDate::GetDays()
{
long ret = 0;
int i;
for(i=0; i<year; i++)
{
if(IsLeapYear(i))
ret += 366;
else
ret += 365;
}
switch(month)
{
case 2:
{
ret += 31;
break;
}
case 3:
{
ret += (31+IsLeapYear(year) 29:28);
break;
}
case 4:
{
ret += (31+(IsLeapYear(year) 29:28)+31);
break;
}
case 5:
{
ret += (31+(IsLeapYear(year) 29:28)+31+30);
break;
}
case 6:
{
ret += (31+(IsLeapYear(year) 29:28)+31+30+31);
break;
}
case 7:
{
ret += (31+(IsLeapYear(year) 29:28)+31+30+31+30);
break;
}
case 8:
{
ret += (31+(IsLeapYear(year) 29:28)+31+30+31+30+31);
break;
}
case 9:
{
ret += (31+(IsLeapYear(year) 29:28)+31+30+31+30+31+31);
break;
}
case 10:
{
ret += (31+(IsLeapYear(year) 29:28)+31+30+31+30+31+31+30);
break;
}
case 11:
{
ret += (31+(IsLeapYear(year) 29:28)+31+30+31+30+31+31+30+31);
break;
}
case 12:
{
ret += (31+(IsLeapYear(year) 29:28)+31+30+31+30+31+31+30+31+30);
break;
}
default:
break;
}
ret += day;
return ret;
}
long CDate::operator-(CDate date)
{
long ret = GetDays()-date.GetDays();
if(0 > ret)
ret = -ret;
return ret;
}
int main()
{
CDate date1(2021, 12, 12);
CDate date2(2020, 12, 01);
long ret = date1-date2;
date1.Show();
cout<<" and ";
date2.Show();
cout<<endl;
cout<<"这两个日期相差的天数为:"<<ret<<"天"<<endl;
}
结果:
总结
提示:这里对文章进行总结:
例如:以上就是今天要讲的内容,本文仅仅简单介绍了定义一个Date类、并求两个日期的间隔。