LeetCodePractice/problem605.cpp at main · Johnsonchan105/LeetCodePractice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
class Solution
{
public:
    bool canPlaceFlowers(vector<int> &flowerbed, int n)
    {
        int plantable = 0;
        if (flowerbed.size() == 1)
        {
            if (flowerbed[0] == 0)
                plantable++;
            return plantable >= n;
        }
        if (flowerbed[0] == 0 && flowerbed[1] == 0)
        {
            flowerbed[0] = 1;
            plantable++;
        }
        for (int i = 1; i < flowerbed.size() - 1; i++)
        {
            if (flowerbed[i] == 0 && flowerbed[i - 1] != 1 && flowerbed[i + 1] != 1)
            {
                flowerbed[i] = 1;
                plantable++;
            }
            if (plantable >= n)
                return true;
        }
        if (flowerbed[flowerbed.size() - 1] == 0 && flowerbed[flowerbed.size() - 2] == 0)
            plantable++;
        return plantable >= n;
    }
};