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…

public class Solution { public bool CanPlaceFlowers(int[] flowerbed, int n) { && flowerbed[] == ) { n = n - ; ) { return true; } else { return false; } } ; var firstOne = false; ; i < flowerbed.Length; i++) { ) { conti++; } else { if (firstOne)…

假设你有一个很长的花坛,一部分地块种植了花,另一部分却没有.可是,花卉不能种植在相邻的地块上,它们会争夺水源,两者都会死去. 给定一个花坛(表示为一个数组包含0和1,其中0表示没种植花,1表示种植了花),和一个数 n .能否在不打破种植规则的情况下种入 n 朵花?能则返回True,不能则返回False. 示例 1: 输入: flowerbed = [1,0,0,0,1], n = 1 输出: True 示例 2: 输入: flowerbed = [1,0,0,0,1], n = 2 输出: Fa…