贪
心
贪心
贪心
class Solution {
public:
bool canPlaceFlowers(vector<int>& flowerbed, int n) {
for(int i = 0; i < flowerbed.size(); i++)
{
if(flowerbed[i] == 0)
{
if((i-1 < 0 || flowerbed[i-1] == 0) && (i+1>=flowerbed.size() || flowerbed[i+1] == 0))
{
flowerbed[i] = 1;
n--;
}
}
}
return n <= 0;
}
};
作者:陈平安
链接:https://www.acwing.com/activity/content/code/content/2012446/
来源:AcWing
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。