Suppose 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 - 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.

**Example 1:**

**Example 2:**

package Solution

funcSolution(xbool)bool {

funcSolution(flowerbed []int,nint)bool {

l,count:=len(flowerbed),0

fori:=0;i<l;i++ {

ifflowerbed[i]==0&& (i==0||flowerbed[i-1]==0)&& (i==l-1||flowerbed[i+1]==0) {

flowerbed[i]=1

}

}

}

funcTestSolution(t*testing.T) {

cases:= []struct {

flowerbed []int

}{

{"TestCase",true,true},

{"TestCase",true,true},

{"TestCase",false,false},

{"TestCase", []int{1,0,0,0,1},1,true},

{"TestCase", []int{1,0,0,0,1},2,false},

{"TestCase", []int{1,0,1,0},0,true},

{"TestCase", []int{0},1,true},

{"TestCase", []int{1,0,1,0,1,0,1},1,false},

}

fori,c:=rangecases {

t.Run(c.name+" "+strconv.Itoa(i),func(t*testing.T) {

got:=Solution(c.inputs)

got:=Solution(c.flowerbed,c.n)

if!reflect.DeepEqual(got,c.expect) {

t.Fatalf("expected: %v, but got: %v, with inputs: %v",

c.expect,got,c.inputs)

t.Fatalf("expected: %v, but got: %v, with inputs: %v %v",

c.expect,got,c.flowerbed,c.n)

}

})

}