Skip to content

Commit 89d3dd6

ifmagic ifmagic

authored

feat: add rust solution to lc problem: No.0096 (#1726)

No.0096.Unique Binary Search Trees

1 parent 7f063a1 commit 89d3dd6Copy full SHA for 89d3dd6

File tree

3 files changed

+49

-0

lines changed

solution/0000-0099/0096.Unique Binary Search Trees

3 files changed

+49

-0

lines changed

`‎solution/0000-0099/0096.Unique Binary Search Trees/README.md‎`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -107,6 +107,24 @@ func numTrees(n int) int {`
`107`	`107`	`}`
`108`	`108`	```
`109`	`109`
	`110`	`+### Rust`
	`111`	`+`
	`112`	+```rust
	`113`	`+impl Solution {`
	`114`	`+ pub fn num_trees(n: i32) -> i32 {`
	`115`	`+ let n = n as usize;`
	`116`	`+ let mut dp = vec![0; n + 1];`
	`117`	`+ dp[0] = 1;`
	`118`	`+ for i in 1..=n {`
	`119`	`+ for j in 0..i {`
	`120`	`+ dp[i] += dp[j] * dp[i - j - 1];`
	`121`	`+ }`
	`122`	`+ }`
	`123`	`+ dp[n] as i32`
	`124`	`+ }`
	`125`	`+}`
	`126`	+```
	`127`	`+`
`110`	`128`	`### ...`
`111`	`129`
`112`	`130`	```

`‎solution/0000-0099/0096.Unique Binary Search Trees/README_EN.md‎`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -95,6 +95,24 @@ func numTrees(n int) int {`
`95`	`95`	`}`
`96`	`96`	```
`97`	`97`
	`98`	`+### Rust`
	`99`	`+`
	`100`	+```rust
	`101`	`+impl Solution {`
	`102`	`+ pub fn num_trees(n: i32) -> i32 {`
	`103`	`+ let n = n as usize;`
	`104`	`+ let mut dp = vec![0; n + 1];`
	`105`	`+ dp[0] = 1;`
	`106`	`+ for i in 1..=n {`
	`107`	`+ for j in 0..i {`
	`108`	`+ dp[i] += dp[j] * dp[i - j - 1];`
	`109`	`+ }`
	`110`	`+ }`
	`111`	`+ dp[n] as i32`
	`112`	`+ }`
	`113`	`+}`
	`114`	+```
	`115`	`+`
`98`	`116`	`### ...`
`99`	`117`
`100`	`118`	```

`‎solution/0000-0099/0096.Unique Binary Search Trees/Solution.rs‎`

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+impl Solution {`
	`2`	`+ pub fn num_trees(n: i32) -> i32 {`
	`3`	`+ let n = n as usize;`
	`4`	`+ let mut dp = vec![0; n + 1];`
	`5`	`+ dp[0] = 1;`
	`6`	`+ for i in 1..=n {`
	`7`	`+ for j in 0..i {`
	`8`	`+ dp[i] += dp[j] * dp[i - j - 1];`
	`9`	`+ }`
	`10`	`+ }`
	`11`	`+ dp[n] as i32`
	`12`	`+ }`
	`13`	`+}`

0 commit comments

Comments

(0)