LeetCode刷题实战605:种花问题
示例 1:
输入:flowerbed = [1,0,0,0,1], n = 1
输出:true
示例 2:
输入:flowerbed = [1,0,0,0,1], n = 2
输出:false
解题
class Solution {
public:
bool canPlaceFlowers(vector<int>& flowerbed, int n) {
int len =flowerbed.size();
vector<int> v(len+2);
v[0]=0; v[len+1]=0; //将首尾赋值为0;
for(int i=0;iv[i+1]=flowerbed[i];
}
for(int i=1;i1;i++){
if(v[i]==0 && v[i-1]==0 && v[i+1]==0){
n--;
v[i]=1;
}
}
return n<=0;
}
};
评论