題目

https://leetcode-cn.com/problems/can-place-flowers/

題解

class Solution {public boolean canPlaceFlowers(int[] flowerbed, int n) {int count = 0;int max = 0;boolean emptyHead = flowerbed[0] != 1;for (int i : flowerbed) {if (i == 0) {count++;} else {if (emptyHead) { // headmax += count / 2;emptyHead = false;} else { // midmax += (count - 1) / 2;}count = 0;}}// tailif (flowerbed[flowerbed.length - 1] == 0) {if (emptyHead) max += (count + 1) / 2; // absolutely emptyelse max += count / 2;}return max >= n;} }

總結(jié)

以上是生活随笔為你收集整理的leetcode 605. Can Place Flowers | 605. 种花问题的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。