Leetcode
2020.05.05 10:57

# 605. Can Place Flowers

조회 수 697 추천 수 0 댓글 0
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

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:

1. The input array won't violate no-adjacent-flowers rule.
2. The input array size is in the range of [1, 20000].
3. 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/

?

 제목+내용제목내용댓글이름닉네임아이디태그
List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode 720. Longest Word in Dictionary 2020.05.07 846
76 Leetcode 225. Implement Stack using Queues 2020.05.05 740
75 Leetcode 56. Merge Intervals 2020.05.05 691
74 Leetcode 844. Backspace String Compare 2020.05.05 748
73 Leetcode 222. Count Complete Tree Nodes 2020.05.05 713
72 Leetcode 697. Degree of an Array 2020.05.05 786
» Leetcode 605. Can Place Flowers 2020.05.05 697
70 Leetcode 724. Find Pivot Index 2020.05.05 716
69 Leetcode 448. Find All Numbers Disappeared in an Array 2020.05.05 682
68 Leetcode 628. Maximum Product of Three Numbers 2020.05.05 672
67 Leetcode 532. K-diff Pairs in an Array 2020.05.04 728
66 Leetcode 897. Increasing Order Search Tree 2020.05.04 687
65 Leetcode 872. Leaf-Similar Trees 2020.05.04 679
64 Leetcode 876. Middle of the Linked List 2020.05.04 678
63 Leetcode 203. Remove Linked List Elements 2020.05.04 653
62 Leetcode 997. Find the Town Judge 2020.05.02 718
61 Leetcode 270. Closest Binary Search Tree Value 2020.05.01 659
60 Leetcode 687. Longest Univalue Path 2020.05.01 717
59 Leetcode 783. Minimum Distance Between BST Nodes 2020.05.01 728
58 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree 2020.05.01 721
Board Pagination Prev 1 2 3 4 Next
/ 4