给你一个日期,请你设计一个算法来判断它是对应一周中的哪一天。
输入为三个整数:day、month 和 year,分别表示日、月、年。
您返回的结果必须是这几个值中的一个 {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"}。
示例 1:
输入:day = 31, month = 8, year = 2019
输出:"Saturday"
示例 2:
输入:day = 18, month = 7, year = 1999
输出:"Sunday"
示例 3:
输入:day = 15, month = 8, year = 1993
输出:"Sunday"
提示:
给出的日期一定是在 1971 到 2100 年之间的有效日期。
#include <iostream>
#include <unordered_set>
using namespace std;
/* 1970年12月31日是星期四 */
class Solution {
public:
string dayOfTheWeek(int day, int month, int year) {
std:vector<std::string> v = { "Thursday", "Friday", "Saturday" , "Sunday", "Monday", "Tuesday", "Wednesday" };
bool current = isLeapYear(year);
unordered_set<int> big = { 1,3,5,7,8,10,12 };
unordered_set<int> small = { 4,6,9,11 };
uint32_t sumdays = 0;
for (int i = 1; i < month; i++) {
if (big.count(i)) {
sumdays += 31;
}
else if (small.count(i)) {
sumdays += 30;
}
else if (i == 2) {
current ? sumdays += 29 : sumdays += 28;
}
}
sumdays += day;
sumdays += theDaysOfYear(year);
return v[sumdays % 7];
}
/* 计算一年中的天数 */
int theDaysOfYear(int year) {
uint32_t sumdays = 0;
uint32_t days = 365;
for (int i = 1970 + 1; i < year; i++) {
if (isLeapYear(i)) {
sumdays = sumdays + days + 1;
}
else {
sumdays = sumdays + days;
}
}
return sumdays;
}
/* 判断是否是闰年 */
bool isLeapYear(int year) {
if (year % 100 == 0) {
if (year % 400 == 0) {
return true;
}
}
else if (year % 4 == 0) {
return true;
}
return false;
}
};