| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- ASF-110
- 프로콘 갈림현상
- Ultimate Search
- python3
- 백트래킹
- LeetCode
- 네이버 검색 시스템
- algorithm
- 취준
- 백준
- 리트코드
- C++
- git
- 격리수준
- DP
- 알고리즘
- GitHub Desktop
- 프로그래머스
- 자소서
- Pro-Con
- 제노블레이드 2
- Algorithmus
- 알고리즘 종류 정리
- 코딩테스트
- baekjoon
- 프로콘
- Python
- programmers
- SRE
- Github
- Today
- Total
목록Python (2)
산타는 없다
문제 원문 Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Follow up: Could you solve it without converting the integer to a string? Example 1: Input: x = 121 Output: true Example 2: Input: x = -121 Output: false Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome. Ex..
문제 원문 Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value. The string can contain additional characters..