4. 605. Can Place Flowers

class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        boolean flag = false;
        int cnt = 0;
        int len= flowerbed.length;
        //for check
        for(int i=0;i<len  ; i++){
            if(flowerbed[i]==0){
                 //left most
            if(i==0){
                //only one element 

                //greater than one

                if((i==len-1) || (i+1<=len-1 && flowerbed[i+1]==0)){
                    flowerbed[i]=1;
                    cnt++;
                }
            }

            //centre
            //left
            //right
            else if((i-1>=0 && flowerbed[i-1]==0) && (i+1<=len-1 &&  flowerbed[i+1]==0)){
                flowerbed[i]=1;
                cnt++;
            }

            //right most
            else if(i+1>len-1 && flowerbed[i-1]==0){
                flowerbed[i]=1;
                cnt++;
            }
            }
           

            //check for count
            if(cnt>=n){
                flag=true;
                break;
            }
        }
        return flag;
        
    }
}