mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 16:36:41 +08:00
添加 problem 1185
This commit is contained in:
@ -0,0 +1,7 @@
|
|||||||
|
package leetcode
|
||||||
|
|
||||||
|
import "time"
|
||||||
|
|
||||||
|
func dayOfTheWeek(day int, month int, year int) string {
|
||||||
|
return time.Date(year, time.Month(month), day, 0, 0, 0, 0, time.Local).Weekday().String()
|
||||||
|
}
|
@ -0,0 +1,54 @@
|
|||||||
|
package leetcode
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"testing"
|
||||||
|
)
|
||||||
|
|
||||||
|
type question1185 struct {
|
||||||
|
para1185
|
||||||
|
ans1185
|
||||||
|
}
|
||||||
|
|
||||||
|
// para 是参数
|
||||||
|
// one 代表第一个参数
|
||||||
|
type para1185 struct {
|
||||||
|
day int
|
||||||
|
month int
|
||||||
|
year int
|
||||||
|
}
|
||||||
|
|
||||||
|
// ans 是答案
|
||||||
|
// one 代表第一个答案
|
||||||
|
type ans1185 struct {
|
||||||
|
one string
|
||||||
|
}
|
||||||
|
|
||||||
|
func Test_Problem1185(t *testing.T) {
|
||||||
|
|
||||||
|
qs := []question1185{
|
||||||
|
|
||||||
|
question1185{
|
||||||
|
para1185{31, 8, 2019},
|
||||||
|
ans1185{"Saturday"},
|
||||||
|
},
|
||||||
|
|
||||||
|
question1185{
|
||||||
|
para1185{18, 7, 1999},
|
||||||
|
ans1185{"Sunday"},
|
||||||
|
},
|
||||||
|
|
||||||
|
question1185{
|
||||||
|
para1185{15, 8, 1993},
|
||||||
|
ans1185{"Sunday"},
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
fmt.Printf("------------------------Leetcode Problem 1185------------------------\n")
|
||||||
|
|
||||||
|
for _, q := range qs {
|
||||||
|
_, p := q.ans1185, q.para1185
|
||||||
|
fmt.Printf("【input】:%v 【output】:%v\n", p, dayOfTheWeek(p.day, p.month, p.year))
|
||||||
|
}
|
||||||
|
fmt.Printf("\n\n\n")
|
||||||
|
}
|
46
Algorithms/1185. Day of the Week/README.md
Executable file
46
Algorithms/1185. Day of the Week/README.md
Executable file
@ -0,0 +1,46 @@
|
|||||||
|
# [1185. Day of the Week](https://leetcode.com/problems/day-of-the-week/)
|
||||||
|
|
||||||
|
|
||||||
|
## 题目:
|
||||||
|
|
||||||
|
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`.
|
||||||
|
|
||||||
|
|
||||||
|
## 题目大意
|
||||||
|
|
||||||
|
给你一个日期,请你设计一个算法来判断它是对应一周中的哪一天。输入为三个整数:day、month 和 year,分别表示日、月、年。
|
||||||
|
|
||||||
|
您返回的结果必须是这几个值中的一个 {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"}。
|
||||||
|
|
||||||
|
提示:
|
||||||
|
|
||||||
|
- 给出的日期一定是在 1971 到 2100 年之间的有效日期。
|
||||||
|
|
||||||
|
## 解题思路
|
||||||
|
|
||||||
|
|
||||||
|
- 给出一个日期,要求算出这一天是星期几。
|
||||||
|
- 简单题,按照常识计算即可。
|
Reference in New Issue
Block a user