Check Whether More Flowers Fit without Adjacent Plants

### Problem flowerbed uses one for an existing flower and zero for an empty plot. Existing flowers are nonadjacent. Return whether n additional flowers can be planted so that no adjacent pair is occupied. ```cpp class Solution { public: bool canPlaceFlowers(vector<int>& flowerbed, int n); }; ``` ### Examples **Example 1:** ```text flowerbed = [0,0,1,0,0], n = 2 Output: true Explanation: Plant at both endpoints. ``` **Example 2:** ```text flowerbed = [0,1,0,0], n = 2 Output: false Explanation: Only the final plot can receive another flower. ``` ### Constraints - The bed has 1..20000 binary plots and begins without adjacent occupied plots. Requested new flowers n is in 0..flowerbed.length. ### Clarifying Questions Preserve existing flowers and check both endpoint and newly created adjacency. ```hint Read the boundary condition Can planting the leftmost currently valid plot ever reduce the best possible total? ``` ### Contract considerations Preserve existing flowers and check both endpoint and newly created adjacency.