| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | |||
| 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| 12 | 13 | 14 | 15 | 16 | 17 | 18 |
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 26 | 27 | 28 | 29 | 30 | 31 |
- ubuntu
- 프로그래머스 파이썬
- 편스토랑 우승상품
- gs25
- 데이콘
- 자연어처리
- Real or Not? NLP with Disaster Tweets
- 금융문자분석경진대회
- 편스토랑
- 우분투
- programmers
- SW Expert Academy
- Git
- 캐치카페
- hackerrank
- Docker
- 더현대서울 맛집
- ChatGPT
- dacon
- 프로그래머스
- 백준
- github
- 코로나19
- PYTHON
- leetcode
- Baekjoon
- 파이썬
- AI 경진대회
- 맥북
- Kaggle
- Today
- Total
목록
반응형
2020/07/29 (2)
솜씨좋은장씨
[leetCode] 1185. Day of the Week (Python)
Example 3: 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, mo..
[leetCode] 260. Single Number III (Python)
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. Example: Input: [1,2,1,3,2,5] Output: [3,5] Note: The order of the result is not important. So in the above example, [5, 3] is also correct. Your algorithm should run in linear runtime complexity. Could you implement it using..