일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- Real or Not? NLP with Disaster Tweets
- 자연어처리
- ubuntu
- github
- 프로그래머스
- gs25
- 캐치카페
- PYTHON
- 우분투
- programmers
- hackerrank
- 편스토랑
- Docker
- dacon
- 맥북
- ChatGPT
- 더현대서울 맛집
- 프로그래머스 파이썬
- 파이썬
- Git
- leetcode
- 데이콘
- Kaggle
- Baekjoon
- AI 경진대회
- SW Expert Academy
- 편스토랑 우승상품
- 코로나19
- 백준
- 금융문자분석경진대회
- Today
- Total
목록
반응형
2020/06/22 (2)
솜씨좋은장씨
We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.Now, given an integer n, write a function that returns true when it is a perfect number and false when it is not. Example: Input: 28 Output: True Explanation: 28 = 1 + 2 + 4 + 7 + 14 Note: The input number n will not exceed 100,000,000. (1e8) Solution import math class Solution(..
Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original. Example: Input: s = "abcdefg", k = 2 Output: "bacdfeg" Rest..