LeetCode 474. Ones and Zeroes

最新推荐文章于 2024-07-25 20:26:57 发布

jmspan

最新推荐文章于 2024-07-25 20:26:57 发布

阅读量1.5k

点赞数 1

CC 4.0 BY-SA版权

分类专栏：动态规划求解的数量文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/jmspan/article/details/53662087

动态规划同时被 2 个专栏收录

63 篇文章

订阅专栏

求解的数量

10 篇文章

订阅专栏

本文介绍了一道LeetCode题目，目标是在给定数量的0和1下，从字符串数组中选取最多数量的字符串，每个0和1只能使用一次。通过动态规划的方法解决此问题，并提供了Java和Python两种实现方式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题网址：https://leetcode.com/problems/ones-and-zeroes/

In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.

For now, suppose you are a dominator of m 0s and n 1s respectively. On the other hand, there is an array with strings consisting of only 0sand 1s.

Now your task is to find the maximum number of strings that you can form with given m 0s and n 1s. Each 0 and 1 can be used at most once.

Note:

The given numbers of 0s and 1s will both not exceed 100
The size of given string array won't exceed 600.

Example 1:

Input: Array = {"10", "0001", "111001", "1", "0"}, m = 5, n = 3
Output: 4

Explanation: This are totally 4 strings can be formed by the using of 5 0s and 3 1s, which are “10,”0001”,”1”,”0”

Example 2:

Input: Array = {"10", "0", "1"}, m = 1, n = 1
Output: 2

Explanation: You could form "10", but then you'd have nothing left. Better form "0" and "1".

方法：动态规划。

Java代码：

public class Solution {
    public int findMaxForm(String[] strs, int m, int n) {
        int[][] max = new int[m+1][n+1];
        for(String str : strs) {
            int[] counts = count(str);
            for(int i = m; i >= counts[0]; i--) {
                for(int j = n; j >= counts[1]; j--) {
                    max[i][j] = Math.max(max[i][j], 1 + max[i - counts[0]][j - counts[1]]);
                }
            }
        }
        return max[m][n];
        
    }
    private int[] count(String str) {
        char[] sa = str.toCharArray();
        int[] counts = new int[2];
        for(int i = 0; i < sa.length; i++) {
            counts[sa[i] - '0'] ++;
        }
        return counts;
    }
}

Python代码：

class Solution(object):
    def findMaxForm(self, strs, m, n):
        """
        :type strs: List[str]
        :type m: int
        :type n: int
        :rtype: int
        """
        dp = [[0 for x in range(n + 1)] for y in range(m + 1)]
        for str in strs:
            c0, c1 = str.count("0"), str.count("1")
            for i in range(m, c0 - 1, -1):
                for j in range(n, c1 - 1, -1):
                    dp[i][j] = max(dp[i][j], 1 + dp[i - c0][j - c1])
        return dp[m][n]