(Easy) Day of the week - LeetCode

Description:

Given a date, return the corresponding day of the week for that date.

The input is given as three integers representing the day, month and year respectively.

Return the answer as one of the following values {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"}.

 

Example 1:

Input: day = 31, month = 8, year = 2019
Output: "Saturday"

Example 2:

Input: day = 18, month = 7, year = 1999
Output: "Sunday"

Example 3:

Input: day = 15, month = 8, year = 1993
Output: "Sunday"

 

Constraints:

  • The given dates are valid dates between the years 1971 and 2100.
Accepted
4,400
Submissions
6,472

 

Solution:

 

class Solution {
    public String dayOfTheWeek(int day, int month, int year) {
        
        
        //2019-9-8  Sunday.   
        
        // we need to get the date difference. In that way, we will be able to know what day that day is.
             int num_1 =    GetNum(day,month,year);
             int num_2 =    GetNum(8,9,2019);
             //System.out.println(num_2-num_1);
            int diff = Math.abs(num_2-num_1)%7;
           
           if(diff ==0){
               return "Sunday";
           }
        
        
        if(num_2 - num_1 >0){
            
             if(diff==1){
                
                return "Saturday";
            }
            else if(diff == 2){
                return "Friday";
            }
              else if(diff == 3){
                return "Thursday";
            }
              else if(diff == 4){
                return "Wednesday";
            }
              else if(diff == 5){
                return "Tuesday";
            }  else if(diff == 6){
                return "Monday";
            }
        }
        else{
            
            if(diff==1){
                
                return "Monday";
            }
            else if(diff == 2){
                return "Tuesday";
            }
              else if(diff == 3){
                return "Wednesday";
            }
              else if(diff == 4){
                return "Thursday";
            }
              else if(diff == 5){
                return "Friday";
            }  else if(diff == 6){
                return "Saturday";
            }
            
        }
        
        
            System.out.println(GetNum(3,3,1977));
        
            System.out.println(GetNum(8,9,2019));
        return "";
    }
    /*
                给定一个年份,判断是否是闰年。条件为:
        A:能被4整除,并且不能被100整除。或者
        B:能被400整除。*/
    
    static boolean Leap(int a){
        
        if(a%4==0&& a%100!=0){
            return true;
        }
        else if( a%400 ==0){
            return true;
        }
        else{
            return false;
        }
    }
    
    static int GetNum(int day, int month, int year){
            
           
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        
        //Jan 31 days
        //Feb Leap year or not.  (28/29 days)
        //Mar 31 days
        //Apr 30 days
        //May 31 days
        //Jun 30 days
        //Jul 31 days
        //Aug 31 days
        //Sep 30 days
        //Oct 31 days
        //Nov 30 days
        //Dec 31 days
        
        map.put(1,31);
        map.put(3,31);
        map.put(4,30);
        map.put(5,31);
        map.put(6,30);
        map.put(7,31);
        map.put(8,31);
        map.put(9,30);
        map.put(10,31);
        map.put(11,30);
        map.put(12,31);
        
        
        if(Leap(year)){
            
            map.put(2,29);
        }
        else{
            map.put(2,28);
        }
        
        
          int sum = 0; 
            for(int i = 1977; i< year; i++){
                
                if(Leap(i)){
                     sum = sum + 366;
                }
                else{
                    sum = sum +365;
                }
               
            }
        
            for(int i = 1; i < month; i++){
                
                sum = sum + map.get(i);
                
            }
        
            sum = sum + day;
        
      return sum;
    }
}

 

转载于:https://www.cnblogs.com/codingyangmao/p/11490892.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
好的,下面是电话号码的字母组合问题的 C++ 代码实现: ``` class Solution { public: vector<string> letterCombinations(string digits) { unordered_map<char, string> mapping = { {'2', "abc"}, {'3', "def"}, {'4', "ghi"}, {'5', "jkl"}, {'6', "mno"}, {'7', "pqrs"}, {'8', "tuv"}, {'9', "wxyz"} }; vector<string> res; if (digits.empty()) { return res; } string combination; backtrack(res, combination, digits, 0, mapping); return res; } void backtrack(vector<string>& res, string& combination, string& digits, int index, unordered_map<char, string>& mapping) { if (index == digits.size()) { res.push_back(combination); return; } for (char c : mapping[digits[index]]) { combination.push_back(c); backtrack(res, combination, digits, index + 1, mapping); combination.pop_back(); } } }; ``` 其中 `letterCombinations` 函数用来生成所有的字母组合,`backtrack` 函数用来进行回溯操作。在 `letterCombinations` 函数中,首先根据数字字符和字母的映射关系创建了一个 `unordered_map` 对象 `mapping`。然后定义了一个空字符串 `combination` 和一个空 vector `res` 来保存最终结果。最后调用了 `backtrack` 函数来生成所有的字母组合。在 `backtrack` 函数中,首先判断是否达到了数字字符串的末尾,如果是,则将当前的 `combination` 字符串保存到 `res` 中。否则,遍历当前数字字符所能表示的所有字母,依次加入到 `combination` 字符串中,然后递归调用 `backtrack` 函数,添加下一个数字字符所能表示的字母。递归完成后,需要将 `combination` 字符串还原到上一个状态,以便进行下一次回溯。最终返回 `res` 数组即可。

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值