LeetCode@Array_605_Can_Place_Flowers
来源:互联网 发布:sql 横向合并结果集 编辑:程序博客网 时间:2024/06/07 16:43
Suppose 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 - they would compete for water and both would die.
Given a flowerbed (represented as an array containing 0 and 1, where 0 means empty and 1 means not empty), and a number n, return if n new flowers can be planted in it without violating the no-adjacent-flowers rule.
Example 1:
Input: flowerbed = [1,0,0,0,1], n = 1Output: True
Example 2:
Input: flowerbed = [1,0,0,0,1], n = 2Output: False
java:
public class Solution { public boolean canPlaceFlowers(int[] flowerbed, int n){int res = 0;int len = flowerbed.length;for(int i = 0; i<len ;i++){if(flowerbed[i] == 0){int prev = (i == 0)? 0:flowerbed[i-1];int next = (i == len-1)? 0:flowerbed[i+1];if(prev == 0 && next == 0){res++;flowerbed[i] = 1;}}}return n <= res;}}
阅读全文
0 0
- LeetCode@Array_605_Can_Place_Flowers
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode:
- pytest的fixture
- python 队列
- 单点登录原理与简单实现
- SVN冲突
- Html5与Css3图像、锚(四)
- LeetCode@Array_605_Can_Place_Flowers
- SQL SERVER中表头的字段迁移到表体
- imageView的ContentModel
- 死锁的四个必要条件
- MySQL数据库优化
- 属性动画
- onclick 事件 和click()的区别
- LeetCode 46 Permutations
- 浙大PAT甲级-1011