605. Can Place Flowers

难度: Easy

题目描述

You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.

Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise.

 

Example 1:

Input: flowerbed = [1,0,0,0,1], n = 1
Output: true

Example 2:

Input: flowerbed = [1,0,0,0,1], n = 2
Output: false

 

Constraints:

• 1 <= flowerbed.length <= 2 * 104
• flowerbed[i] is 0 or 1.
• There are no two adjacent flowers in flowerbed.
• 0 <= n <= flowerbed.length

解题思路

代码实现

解决方案

java

class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {

        int len = flowerbed.length;
        if (len == 1) {
            if(n<=0){
                return true;
            }
            if (flowerbed[0] == 0 && n == 1) {
                return true;
            }
            return false;

        }

        for (int i = 0; i < len; i++) {
            if (i == 0) {
                if (i + 1 < len) {
                    if (flowerbed[i] == 0 && flowerbed[i + 1] == 0) {
                        n--;
                        flowerbed[i] = 1;
                    }
                }
            } else if (i == len - 1) {
                if (i - 1 > -1) {
                    if (flowerbed[i] == 0 && flowerbed[i - 1] == 0) {
                        n--;
                        flowerbed[i] = 1;
                    }
                }
            } else {
                if (flowerbed[i] == 0) {
                    if (flowerbed[i - 1] == 0 && flowerbed[i + 1] == 0) {
                        n--;
                        flowerbed[i] = 1;
                    }
                }
            }

        }
        return n <= 0;

    }
}