474. Ones and Zeroes

Posted bernieloveslife

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了474. Ones and Zeroes相关的知识,希望对你有一定的参考价值。

  1. 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 0s and 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".

class Solution:
    def findMaxForm(self, strs, m, n):
        """
        :type strs: List[str]
        :type m: int
        :type n: int
        :rtype: int
        """
        dp = [[0 for i in range(n+1)] for j in range(m+1)]
        for s in strs:
            zero,one = s.count("0"),s.count("1")
            for i in range(m,zero-1,-1):
                for j in range(n,one-1,-1):
                    dp[i][j] = max(dp[i][j],1+dp[i-zero][j-one])
        print(dp)
        return dp[m][n]

这道题用python3总是超时,如果用Python2就不超时了。



以上是关于474. Ones and Zeroes的主要内容,如果未能解决你的问题,请参考以下文章

474. Ones and Zeroes

474. Ones and Zeroes

[leetcode-474-Ones and Zeroes]

[Algorithm] 474. Ones and Zeroes

算法: 1和0子集合的个数 474. Ones and Zeroes

leetcode 474. Ones and Zeroes 一和零(中等)