일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- github
- PYTHON
- Kaggle
- 코로나19
- 파이썬
- leetcode
- 더현대서울 맛집
- 백준
- 편스토랑 우승상품
- Docker
- 프로그래머스
- 맥북
- ChatGPT
- 금융문자분석경진대회
- programmers
- AI 경진대회
- 데이콘
- 캐치카페
- 프로그래머스 파이썬
- ubuntu
- gs25
- 편스토랑
- 자연어처리
- Git
- SW Expert Academy
- Real or Not? NLP with Disaster Tweets
- 우분투
- Baekjoon
- hackerrank
- dacon
- Today
- Total
목록
반응형
2020/06/13 (2)
솜씨좋은장씨
Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? Example 1: Input: [2,2,1] Output: 1 Example 2: Input: [4,1,2,1,2] Output: 4 Solution from collections import Counter class Solution: def singleNumber(self, nums: List[int]) -> int: c..
Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”. Example: n = 15, Return: [ "1", "2", "Fizz", "4", "Buzz", "Fizz", "7", "8", "Fizz", "Buzz", "11", "Fizz", "13", "14", "FizzBuzz..