Package g0601_0700.s0605_can_place_flowers

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    605 - Can Place Flowers\.

    Easy

    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.

    Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return if n new flowers can be planted in the flowerbed 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

    Constraints:

    • <code>1 <= flowerbed.length <= 2 * 10<sup>4</sup></code>

    • flowerbed[i] is 0 or 1.

    • There are no two adjacent flowers in flowerbed.

    • 0 &lt;= n &lt;= flowerbed.length

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean canPlaceFlowers(IntArray flowerbed, Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait