Leetcode
2020.05.05 10:57

605. Can Place Flowers

조회 수 376 추천 수 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/



?

  1. 720. Longest Word in Dictionary

  2. 225. Implement Stack using Queues

  3. 56. Merge Intervals

  4. 844. Backspace String Compare

  5. 222. Count Complete Tree Nodes

  6. 697. Degree of an Array

  7. 605. Can Place Flowers

  8. 724. Find Pivot Index

  9. 448. Find All Numbers Disappeared in an Array

  10. 628. Maximum Product of Three Numbers

  11. 532. K-diff Pairs in an Array

  12. 897. Increasing Order Search Tree

  13. 872. Leaf-Similar Trees

  14. 876. Middle of the Linked List

  15. 203. Remove Linked List Elements

  16. 997. Find the Town Judge

  17. 270. Closest Binary Search Tree Value

  18. 687. Longest Univalue Path

  19. 783. Minimum Distance Between BST Nodes

  20. 235. Lowest Common Ancestor of a Binary Search Tree

Board Pagination Prev 1 2 3 4 Next
/ 4