<qiyuangong>605_Can_Place_Flowers_1.java
public boolean canPlaceFlowers(int[] flowerbed, int n) {
        int i = 0, count = 0;
        while (i < flowerbed.length) {
            if (flowerbed[i] == 0 && (i == 0 || flowerbed[i - 1] == 0) && (i == flowerbed.length - 1 || flowerbed[i + 1] == 0)) {
                flowerbed[i++] = 1;
                count++;
            }
             if(count >= n)
                return true;
            i++;
        }
        return false;
    }
public boolean var_0 ( int [ ] var_1 , int var_2 ) {
  int var_4 = 0 , var_5 = 0 ;
  while ( var_4 < var_1 . length ) {
    if ( var_1 [ var_4 ] == 0 && ( var_4 == 0 || var_1 [ var_4 - 1 ] == 0 ) && ( var_4 == var_1 . length - 1 || var_1 [ var_4 + 1 ] == 0 ) ) {
      var_1 [ var_4 ++ ] = 1 ;
      var_5 ++ ;
    }
    if ( var_5 >= var_2 ) return true ;
    var_4 ++ ;
  }
  return false ;
}
