[LeetCode]605. Can Place Flowers

https://leetcode.com/problems/can-place-flowers/#/description

给一个数组，只包含01，1不能相邻，问能否插入n个1

前后都为0时，就将当前位置置为1，表示当前位置可以插入

public class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        int cnt = 0;
        for (int i = 0; i < flowerbed.length && cnt < n; i++) {
            if (flowerbed[i] == 0) {
                int next = i == flowerbed.length - 1 ? 0 : flowerbed[i + 1];
                int prev = i == 0 ? 0 : flowerbed[i - 1];
                if (prev == 0 && next == 0) {
                    flowerbed[i] = 1;
                    cnt++;
                }
            }
        }
        return cnt == n;
    }
}