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