请选择 进入手机版 | 继续访问电脑版

【LeetCode】605. Can Place Flowers 种花问题(Easy)(JAVA)每日一题

[复制链接]
小浣熊 发表于 2021-1-3 12:06:16 | 显示全部楼层 |阅读模式 打印 上一主题 下一主题
【LeetCode】605. Can Place Flowers 种花问题(Easy)(JAVA)

题目地点: https://leetcode.com/problems/can-place-flowers/
题目形貌:

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:
  1. Input: flowerbed = [1,0,0,0,1], n = 1Output: true
复制代码
Example 2:
  1. Input: flowerbed = [1,0,0,0,1], n = 2Output: false
复制代码
Constraints:
<ul>1
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

发布主题

专注素材教程免费分享
全国免费热线电话

18768367769

周一至周日9:00-23:00

反馈建议

27428564@qq.com 在线QQ咨询

扫描二维码关注我们

Powered by Discuz! X3.4© 2001-2013 Comsenz Inc.( 蜀ICP备2021001884号-1 )