Notice
Recent Posts
Recent Comments
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- 캐치카페
- programmers
- 코로나19
- 편스토랑 우승상품
- 더현대서울 맛집
- Baekjoon
- AI 경진대회
- gs25
- ubuntu
- 편스토랑
- Git
- SW Expert Academy
- 파이썬
- dacon
- hackerrank
- Docker
- leetcode
- 자연어처리
- 우분투
- 백준
- PYTHON
- 맥북
- github
- 데이콘
- ChatGPT
- Kaggle
- 프로그래머스 파이썬
- 프로그래머스
- 금융문자분석경진대회
- Real or Not? NLP with Disaster Tweets
Archives
- Today
- Total
목록
반응형
Can Place Flowers (1)
반응형
솜씨좋은장씨
[leetCode] 605. Can Place Flowers (Python)
Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die. Given a flowerbed (represented as an array containing 0 and 1, where 0 means empty and 1 means not empty), and a number n, return if n new flowers can be planted in it without violating the no-adjacent-f..
Programming/코딩 1일 1문제
2020. 6. 30. 15:22
반응형