mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-25 03:11:41 +08:00
31 lines
507 B
Go
31 lines
507 B
Go
package leetcode
|
|
|
|
import "strings"
|
|
|
|
func findMaxForm(strs []string, m int, n int) int {
|
|
dp := make([][]int, m+1)
|
|
for i := 0; i < m+1; i++ {
|
|
dp[i] = make([]int, n+1)
|
|
}
|
|
for _, s := range strs {
|
|
zero := strings.Count(s, "0")
|
|
one := len(s) - zero
|
|
if zero > m || one > n {
|
|
continue
|
|
}
|
|
for i := m; i >= zero; i-- {
|
|
for j := n; j >= one; j-- {
|
|
dp[i][j] = max(dp[i][j], 1+dp[i-zero][j-one])
|
|
}
|
|
}
|
|
}
|
|
return dp[m][n]
|
|
}
|
|
|
|
func max(a int, b int) int {
|
|
if a > b {
|
|
return a
|
|
}
|
|
return b
|
|
}
|