content: package codingquestions.leetcode;
  
  /**
   * 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.
   * <p>
   * 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 true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise.
   * <p>
   * <p>
   * <p>
   * Example 1:
   * <p>
   * Input: flowerbed = [1,0,0,0,1], n = 1
   * Output: true
   * Example 2:
   * <p>
   * Input: flowerbed = [1,0,0,0,1], n = 2
   * Output: false
   **/
  
  
  public class FlowerPlacing {
      public boolean canPlaceFlowers(int[] flowerbed, int n) {
          for (int i = 0; i < flowerbed.length; i++) {
              if (flowerbed[i] == 0) {
                  if ((i == 0 || flowerbed[i - 1] != 1) && (i == flowerbed.length - 1 || flowerbed[i + 1] != 1)) {
                      flowerbed[i] = 1;
                      n--;
                  }
              }
          }
          return n <= 0;
      }
  }
  