605. 种花问题

链接：https://leetcode-cn.com/problems/can-place-flowers/

 

class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        int sum=0;
           if(flowerbed.length==1){
               if(flowerbed[0]==0&&n==1){
                   return true;
               }
           }
           //根据题目要求首和尾也要种花
           else{
               //1,首
               if(flowerbed[0]==0&&flowerbed[1]==0){
                   flowerbed[0]=1;
                   sum++;
               }
               //2,中间
               for(int i=1;i<flowerbed.length-3;i++){
                   if(flowerbed[i]==0&&flowerbed[i+1]==0&&flowerbed[i+2]==0){
                       flowerbed[i+1]=1;
                       sum++;
                   }
               }
               //3,尾
               if(flowerbed[flowerbed.length-1]==0&&flowerbed[flowerbed.length-2]==0){
                   flowerbed[flowerbed.length-1]=1;
                   sum++;
               }
           }
           if(sum>=n){
               return true;
           }
           else{
               return false;
           }
    }
}