You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.
Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule.
Input: flowerbed = [1,0,0,0,1], n = 1 Output: true
Input: flowerbed = [1,0,0,0,1], n = 2 Output: false
1 <= flowerbed.length <= 2 * 104 flowerbed[i] is 0 or 1. There are no two adjacent flowers in flowerbed. 0 <= n <= flowerbed.length
Characteristics of the solution (time and space complexity tests) can be view here: https://leetcode.com/problems/can-place-flowers/submissions/893220065/
Or see pictures:
To run tests in you environment:
- Clone googletest:
cd {YourWorkSpaceFolder}
git clone https://github.com/google/googletest.git
- Build:
cmake --build .
- Run CTests:
ctest
For more informative test results use this command in powershell:
."{YourWorkSpaceFolder}/build/tests/FLOWERS_TESTS.exe"