A Code

Description 中文 English Suppose you have a long flowerbed in which some of the pots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die. Given a flowerbed (represented as an array containing 0 and 1, where 0 means empty and 1 means not empty), and a number  n , return if  n  new flowers can be planted in it without violating the no-adjacent-flowers rule. bool canPlaceFlowers ( vector < int > &flowerbed, int n) { // Write your code here const int size = flowerbed.size(); if (size == 0 ){ return false ; } int count = 0 ; for ( int i = 0 ; i < size; i++){ if (flowerbed[i] == 0 && (flowerbed[i - 1 ] == 0 || i == 0 ) && (flowerbed[i + 1 ] == 0 || i == size - 1 )){ count++; flowerbed[i] = 1 ; } } return count ...

/** * // This is the interface that allows for creating nested lists. * // You should not implement it, or speculate about its implementation * class NestedInteger { * public: * // Return true if this NestedInteger holds a single integer, * // rather than a nested list. * bool isInteger() const; * * // Return the single integer that this NestedInteger holds, * // if it holds a single integer * // The result is undefined if this NestedInteger holds a nested list * int getInteger() const; * * // Return the nested list that this NestedInteger holds, * // if it holds a nested list * // The result is undefined if this NestedInteger holds a single integer * const vector<NestedInteger> &getList() const; * }; */ class Solution { public : int depthSum ( const vector <NestedInteger>& nestedList) { // Write your code here int res = 0 ; dfs(nestedList, res, 1 ); return ...