zoukankan      html  css  js  c++  java
  • 0605. Can Place Flowers (E)

    Can Place Flowers (E)

    题目

    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 if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule.

    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

    题意

    在一排土地上种花,每株花不能相邻,问能否种下n株花。

    思路

    贪心,从左到右遍历,只要符合条件就种花。


    代码实现

    Java

    class Solution {
        public boolean canPlaceFlowers(int[] flowerbed, int n) {
            if (n == 0) {
                return true;
            }
            
            for (int i = 0; i < flowerbed.length; i++) {
                if (flowerbed[i] == 0 && (i == 0 || flowerbed[i - 1] == 0) && (i == flowerbed.length - 1 || flowerbed[i + 1] == 0)) {
                    flowerbed[i] = 1;
                    n--;
                    if (n == 0) {
                        return true;
                    }
                }
            }
            return false;
        }
    }
    
  • 相关阅读:
    程序员数学
    [topcoder]FlowerGarden
    [leetcode]Trapping Rain Water
    [leetcode]Gray Code
    [leetcode]Unique Paths II
    hdu 4112 Break the Chocolate(ceil floor)
    【转】博弈-翻硬币游戏
    POJ 3710 Christmas Game
    hdu 3590 PP and QQ
    博弈进阶
  • 原文地址:https://www.cnblogs.com/mapoos/p/14091436.html
Copyright © 2011-2022 走看看