class Solution {
public:
int hammingWeight(int n) {
int sum = 0;
while(n > 0)
{
sum += n % 2;
n /= 2;
}
return sum;
}
};
class Solution {
public:
bool canPlaceFlowers(vector<int>& flowerbed, int n) {
int m = flowerbed.size();
for(int i = 0;i<m;i++)
{
if((i==0 || flowerbed[i-1]==0) && flowerbed[i]==0 && (i==m-1 ||flowerbed[i+1]==0))
{
flowerbed[i]=1;
n--;
}
}
if(n<=0) return true;
return false;
}
};