Commit 519ff75

authored

feat: add ts solution to lc problem: No.0605 (#1722)

No.0605.Can Place Flowers

1 parent 101906c commit 519ff75Copy full SHA for 519ff75

File tree

+56

-0

lines changed

+56

-0

lines changed

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -43,6 +43,10 @@`
`43`	`43`
`44`	`44`	`方法一:贪心`
`45`	`45`
	`46`	`+我们直接遍历数组 $flowerbed,ドル对于每个位置 $i,ドル如果 $flowerbed[i]=0,ドル并且其左右相邻位置都为 0ドル,ドル则我们可以在该位置种花,否则不能。最后我们统计可以种下的花的数量,如果其不小于 $n,ドル则返回 $true,ドル否则返回 $false$。`
	`47`	`+`
	`48`	`+时间复杂度 $O(n),ドル其中 $n$ 是数组 $flowerbed$ 的长度。我们只需要遍历数组一次。空间复杂度 $O(1)$。`
	`49`	`+`
`46`	`50`	`<!-- tabs:start -->`
`47`	`51`
`48`	`52`	`### Python3`
`@@ -123,6 +127,23 @@ func canPlaceFlowers(flowerbed []int, n int) bool {`
`123`	`127`	`}`
`124`	`128`	```
`125`	`129`
	`130`	`+### TypeScript`
	`131`	`+`
	`132`	+```ts
	`133`	`+function canPlaceFlowers(flowerbed: number[], n: number): boolean {`
	`134`	`+ const m = flowerbed.length;`
	`135`	`+ for (let i = 0; i < m; ++i) {`
	`136`	`+ const l = i === 0 ? 0 : flowerbed[i - 1];`
	`137`	`+ const r = i === m - 1 ? 0 : flowerbed[i + 1];`
	`138`	`+ if (l + flowerbed[i] + r === 0) {`
	`139`	`+ flowerbed[i] = 1;`
	`140`	`+ --n;`
	`141`	`+ }`
	`142`	`+ }`
	`143`	`+ return n <= 0;`
	`144`	`+}`
	`145`	+```
	`146`	`+`
`126`	`147`	`### PHP`
`127`	`148`
`128`	`149`	```php

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -28,6 +28,12 @@`
`28`	`28`
`29`	`29`	`## Solutions`
`30`	`30`
	`31`	`+Solution 1: Greedy`
	`32`	`+`
	`33`	`+We directly traverse the array $flowerbed$. For each position $i,ドル if $flowerbed[i]=0$ and its adjacent positions on the left and right are also 0ドル,ドル then we can plant a flower at this position. Otherwise, we cannot. Finally, we count the number of flowers that can be planted. If it is not less than $n,ドル we return $true,ドル otherwise we return $false$.`
	`34`	`+`
	`35`	`+The time complexity is $O(n),ドル where $n$ is the length of the array $flowerbed$. We only need to traverse the array once. The space complexity is $O(1)$.`
	`36`	`+`
`31`	`37`	`<!-- tabs:start -->`
`32`	`38`
`33`	`39`	`### Python3`
`@@ -104,6 +110,23 @@ func canPlaceFlowers(flowerbed []int, n int) bool {`
`104`	`110`	`}`
`105`	`111`	```
`106`	`112`
	`113`	`+### TypeScript`
	`114`	`+`
	`115`	+```ts
	`116`	`+function canPlaceFlowers(flowerbed: number[], n: number): boolean {`
	`117`	`+ const m = flowerbed.length;`
	`118`	`+ for (let i = 0; i < m; ++i) {`
	`119`	`+ const l = i === 0 ? 0 : flowerbed[i - 1];`
	`120`	`+ const r = i === m - 1 ? 0 : flowerbed[i + 1];`
	`121`	`+ if (l + flowerbed[i] + r === 0) {`
	`122`	`+ flowerbed[i] = 1;`
	`123`	`+ --n;`
	`124`	`+ }`
	`125`	`+ }`
	`126`	`+ return n <= 0;`
	`127`	`+}`
	`128`	+```
	`129`	`+`
`107`	`130`	`### PHP`
`108`	`131`
`109`	`132`	```php

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+function canPlaceFlowers(flowerbed: number[], n: number): boolean {`
	`2`	`+ const m = flowerbed.length;`
	`3`	`+ for (let i = 0; i < m; ++i) {`
	`4`	`+ const l = i === 0 ? 0 : flowerbed[i - 1];`
	`5`	`+ const r = i === m - 1 ? 0 : flowerbed[i + 1];`
	`6`	`+ if (l + flowerbed[i] + r === 0) {`
	`7`	`+ flowerbed[i] = 1;`
	`8`	`+ --n;`
	`9`	`+ }`
	`10`	`+ }`
	`11`	`+ return n <= 0;`
	`12`	`+}`

Comments

(0)