Leetcode
2020.05.05 10:57
605. Can Place Flowers
조회 수 647 추천 수 0 댓글 0
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-flowers rule.
Example 1:
Input: flowerbed = [1,0,0,0,1], n = 1 Output: True
Example 2:
Input: flowerbed = [1,0,0,0,1], n = 2 Output: False
Note:
- The input array won't violate no-adjacent-flowers rule.
- The input array size is in the range of [1, 20000].
- n is a non-negative integer which won't exceed the input array size.
class Solution {
public boolean canPlaceFlowers(int[] flowerbed, int n) {
for(int i=0; i<flowerbed.length; i++){
if(n == 0){
return true;
}
if(flowerbed[i] == 1){
continue;
}
boolean left = (i > 0) ? flowerbed[i - 1] == 0 : flowerbed[i] == 0;
boolean right = (i < flowerbed.length - 1) ? flowerbed[i + 1] == 0 : flowerbed[i] == 0;
if(left && right && flowerbed[i] == 0){
flowerbed[i] = 1;
n--;
}
}
return n <= 0;
}
}[문제] https://leetcode.com/problems/can-place-flowers/
| 번호 | 분류 | 제목 | 글쓴이 | 날짜 | 조회 수 |
|---|---|---|---|---|---|
| 77 | Leetcode | [todo] 687. Longest Univalue Path | hooni | 2020.05.01 | 199 |
| 76 | Programmers |
team game
|
hooni | 2020.04.30 | 0 |
| 75 | Programmers |
hashmap
|
hooni | 2020.04.30 | 0 |
| 74 | Programmers |
fib
|
hooni | 2020.04.30 | 0 |
| 73 | Leetcode | 997. Find the Town Judge | hooni | 2020.05.02 | 670 |
| 72 | Leetcode |
994. Rotting Oranges
|
hooni | 2020.04.14 | 152 |
| 71 | Leetcode |
993. Cousins in Binary Tree
|
hooni | 2020.04.30 | 209 |
| 70 | Leetcode | 973. K Closest Points to Origin | hooni | 2020.04.15 | 149 |
| 69 | Leetcode | 946. Validate Stack Sequences | hooni | 2020.04.08 | 145 |
| 68 | Leetcode | 937. Reorder Data in Log Files | hooni | 2020.04.25 | 153 |
| 67 | Leetcode | 897. Increasing Order Search Tree | hooni | 2020.05.04 | 642 |
| 66 | Leetcode | 876. Middle of the Linked List | hooni | 2020.05.04 | 629 |
| 65 | Leetcode |
872. Leaf-Similar Trees
|
hooni | 2020.05.04 | 629 |
| 64 | Leetcode | 852. Peak Index in a Mountain Array | hooni | 2020.04.28 | 147 |
| 63 | Leetcode | 844. Backspace String Compare | hooni | 2020.05.05 | 672 |
| 62 | Leetcode | 783. Minimum Distance Between BST Nodes | hooni | 2020.05.01 | 685 |
| 61 | Leetcode | 763. Partition Labels | hooni | 2020.04.17 | 204 |
| 60 | Leetcode | 75. Sort Colors | hooni | 2020.04.14 | 137 |
| 59 | Leetcode | 731. My Calendar II | hooni | 2020.04.15 | 137 |
| 58 | Leetcode | 729. My Calendar I | hooni | 2020.04.15 | 140 |