1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-09-19 17:56:55 +02:00

problems: add can place flowers

Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2022-01-18 13:38:21 +01:00
parent 2c664a305d
commit 5a9d67f37d
No known key found for this signature in database
GPG key ID: 332171FADF1DB90B

View file

@ -0,0 +1,44 @@
#include <cassert>
#include <vector>
using std::vector;
class Solution {
public:
bool canPlaceFlowers(vector<int> &flowerbed, int n) {
int count = 0;
int left = 0, right;
for (vector<int>::size_type i = 0; i < flowerbed.size(); i++) {
right = (i + 1 < flowerbed.size()) ? flowerbed[i + 1] : 0;
if (left == 0 && flowerbed[i] == 0 && right == 0) {
count++;
left = 1;
} else {
left = flowerbed[i];
}
}
return count >= n;
}
};
int main() {
Solution s;
std::vector flowers{1, 0, 0, 0, 1};
assert(s.canPlaceFlowers(flowers, 1));
assert(!s.canPlaceFlowers(flowers, 2));
flowers = {1, 0, 0, 0, 0, 1};
assert(!s.canPlaceFlowers(flowers, 2));
flowers = {1, 0, 0, 0, 1, 0, 0};
assert(s.canPlaceFlowers(flowers, 2));
flowers = {0, 0, 1, 0, 0};
assert(s.canPlaceFlowers(flowers, 1));
return 0;
}