mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 13:00:22 +08:00
Merge pull request #2101 from fwqaaq/patch-15
Update 0474.一和零.md about rust
This commit is contained in:
@ -507,6 +507,33 @@ object Solution {
|
|||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
### Rust
|
||||||
|
|
||||||
|
```rust
|
||||||
|
impl Solution {
|
||||||
|
pub fn find_max_form(strs: Vec<String>, m: i32, n: i32) -> i32 {
|
||||||
|
let (m, n) = (m as usize, n as usize);
|
||||||
|
let mut dp = vec![vec![0; n + 1]; m + 1];
|
||||||
|
for s in strs {
|
||||||
|
let (mut one_num, mut zero_num) = (0, 0);
|
||||||
|
for c in s.chars() {
|
||||||
|
match c {
|
||||||
|
'0' => zero_num += 1,
|
||||||
|
'1' => one_num += 1,
|
||||||
|
_ => (),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for i in (zero_num..=m).rev() {
|
||||||
|
for j in (one_num..=n).rev() {
|
||||||
|
dp[i][j] = dp[i][j].max(dp[i - zero_num][j - one_num] + 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
dp[m][n]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
<p align="center">
|
<p align="center">
|
||||||
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
|
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
|
||||||
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
|
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
|
||||||
|
Reference in New Issue
Block a user