leetcode_605

문제

https://leetcode.com/problems/can-place-flowers/description/?envType=study-plan-v2&envId=leetcode-75

• 인접한 양 옆으로 심어지지 않은 자리에 n개 만큼 꽃을 심어야 함

python3

def canPlaceFlowers(flowerbed, n):
    for i in range(len(flowerbed)):
        if flowerbed[i] == 0:
            if(i==0 or flowerbed[i-1]==0) and (i==len(flowerbed)-1 or flowerbed[i+1]==0):
                n -= 1
                flowerbed[i] = 1
        if n <= 0:
            return True
    return False

java

public class no_605 {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        for(int i=0;i<flowerbed.length;i++) {
            if(flowerbed[i]==0) {
                if((i==0 || flowerbed[i-1]==0) && (i==flowerbed.length-1 || flowerbed[i+1]==0)) {
                    n--;
                    flowerbed[i] = 1;
                }
            }
        }
        return (n<=0);
    }
}