给你一个日期,请你设计一个算法来判断它是对应一周中的哪一天。
输入为三个整数:day、month 和 year,分别表示日、月、年。
您返回的结果必须是这几个值中的一个 {“Sunday”, “Monday”, “Tuesday”, “Wednesday”, “Thursday”, “Friday”, “Saturday”}。
示例 1:
输入:day = 31, month = 8, year = 2019
输出:"Saturday"
给出的日期一定是在 1971 到 2100 年之间的有效日期
来源:力扣(LeetCode) 链接:https://leetcode-cn.com/problems/day-of-the-week 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public:
string dayOfTheWeek(int day, int month, int year) {
string week[7] = {"Thursday", "Friday", "Saturday","Sunday","Monday", "Tuesday", "Wednesday"};
int i, days = 0, monthdays[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
//1971-1-1 周五
for(i = 1971; i < year; ++i)
{
if((i%4 == 0 && i%100 != 0) || i%400 == 0)
days += 366;
else
days += 365;
}
for(i = 0; i < month-1; ++i)
{
days += monthdays[i];
}
days += day;
if(((year%4 == 0 && year%100 != 0) || year%400 == 0) && month > 2)
++days;
return week[days%7];
}
};