Blogs Hub

Can Place Flowers - Array - Easy - LeetCode - MiniTV

Can Place Flowers - Array - Easy - LeetCode - मिनी टीवी

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:
The input array won't violate no-adjacent-flowers rule.
The input array size is in the range of [1, 20000].
n is a non-negative integer which won't exceed the input array size.

public class Solution {
    public bool CanPlaceFlowers(int[] flowerbed, int n) {
        int count = 0;
        if(n==0){
            return true;
        }
        
        if(flowerbed.Length==0){
            return false;
        }
        
        if(flowerbed.Length==1){
            return n==1 && flowerbed[0]==0;
        }
        
        
        for(int i=0;i<flowerbed.Length;i++){
            if(i==0){
                if(flowerbed[i] == 0 && flowerbed[i+1]==0){
                    flowerbed[i]=1;
                    count++;
                }
            }
            else if(i==flowerbed.Length-1){
                if(flowerbed[i-1] == 0 && flowerbed[i]==0){
                    flowerbed[i]=1;
                    count++;
                }
            }
            else if(flowerbed[i-1] == 0 && flowerbed[i] == 0 && flowerbed[i+1]==0){
                flowerbed[i]=1;
                count++;
            }
        }
        
        return count>=n;
    }
}

 


Time Complexity: O(n)

Space Complexity: O(1)