Can Place Flowers
来源:互联网 发布:java在线学习网站源码 编辑:程序博客网 时间:2024/06/05 09:41
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
Note:
- The input array won't violate no-adjacent-flowers rule.
- The input array size is in the range of [1, 20000].
- n is a non-negative integer which won't exceed the input array size.
判断一下相邻的元素是否为0.
代码:
public boolean canPlaceFlowers(int[] flowerbed, int n) { if(n == 0) return true; if(flowerbed == null || flowerbed.length == 0) return false; if(flowerbed.length == 1) return n<=1 && flowerbed[0] ==0; int index = 0; while(index<flowerbed.length) { if(isValid(flowerbed, index)) { if(index<flowerbed.length) { flowerbed[index] = 1; n--; } } index++; } return n<=0; } private boolean isValid(int[] flowerbed, int index) { if(index<0 || index>flowerbed.length-1) return false; if(index == 0) return flowerbed[1] == 0 && flowerbed[0] == 0; if(index == flowerbed.length-1) return flowerbed[flowerbed.length-1] == 0 && flowerbed[flowerbed.length-2] ==0; return flowerbed[index-1]==0 && flowerbed[index]==0 && flowerbed[index+1]==0; }
阅读全文
0 0
- 605. Can Place Flowers
- Can Place Flowers
- 605. Can Place Flowers
- 605Can Place Flowers
- 605. Can Place Flowers
- leetcode605. Can Place Flowers
- 605. Can Place Flowers
- 605. Can Place Flowers
- 605. Can Place Flowers
- Can Place Flowers
- leetcode[Can Place Flowers]
- 605. Can Place Flowers
- Can Place Flowers
- 605. Can Place Flowers
- leetcode-Can Place Flowers
- Can Place Flowers
- 605. Can Place Flowers
- leetCode-Can Place Flowers
- Ubuntu Qt5.6.2 ld -lGL Error solution
- 机械与编程我的人生路漫漫
- Brick Wall
- YP.1.6 Computers as Universal Computational Devices(双语)
- 关闭SSH不结束某希望进程结束,屏蔽SIGHUP信号--nohup
- Can Place Flowers
- YP.1.7 How Do We Get the Electrons to Do The Work?(双语)
- YP.1 Exercises
- 应优先大力发展智能环境安全可信度评价算法
- 花了一个通宵总算解决了sitemesh对于struts2转发地址不进行装饰的问题
- JS刷新当前页面的几种方法总结
- POSTMESSAGE与SENDMESSAGE的区别
- 数据整理实践指南
- 《Tableau数据可视化从入门到精通》之连接JSON文件