一周中的第几天

给你一个日期，请你设计一个算法来判断它是对应一周中的哪一天。

输入为三个整数：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 年之间的有效日期。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/day-of-the-week
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

class Solution {
public:
    string dayOfTheWeek(int day, int month, int year) 
    {
        vector<string> nums = {"Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"};  
        vector<int> days = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 };
        //cout << days.size() << endl;
        unsigned long long alldays = 0;
        for (int i= 1970; i < year; i++)
            alldays += (i % 400 == 0 || (i % 100 != 0 && i % 4 == 0)) ? 366 : 365;
        alldays += days[month - 1];
        if ((year % 400 == 0 || (year % 100 != 0 && year % 4 == 0)) && month > 2)
            alldays++;
        alldays += day;
        alldays = alldays % 7 - 1;
        alldays = (alldays + 3) % 7;
        //cout << alldays << endl;
        return nums[alldays];
    }
};