Leet-Code-prog/Easy/FlowerBed_problem/flowerbed.cpp

class Solution {
public:
    bool canPlaceFlowers(vector<int>& flowerbed, int n) {

        int y = 0;
        for (int x = 0; x < n; x++)
        {
            for (int i = 0; i < (flowerbed.size()); i++)
            {
                bool leftEmpty = (i == 0) || (flowerbed[i-1] != 1);
                bool rightEmpty = (i == flowerbed.size()-1) || (flowerbed[i+1] != 1);
                bool currentEmpty = (flowerbed[i] != 1);

                if (leftEmpty == true && rightEmpty == true && currentEmpty == true)
                {
                    flowerbed[i] = 1; y++;
                }
            }
        }

        if (n <= y) return true; 
        else return false;
    }
};