zoukankan      html  css  js  c++  java
  • 474. 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:

    1. The given numbers of 0s and 1s will both not exceed 100
    2. 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".

    Approach #1: DP. [C++]

    class Solution {
    public:
        int findMaxForm(vector<string>& strs, int m, int n) {
            vector<vector<int>> memo(m+1, vector<int>(n+1, 0));
            int countOfZeros, countOfOnes;
            for (auto& s : strs) {
                countOfZeros = 0, countOfOnes = 0;
                for (auto c : s) {
                    if (c == '0') countOfZeros++;
                    else if (c == '1') countOfOnes++;
                }
                
                for (int i = m; i >= countOfZeros; --i) {
                    for (int j = n; j >= countOfOnes; --j) {
                        memo[i][j] = max(memo[i][j], memo[i-countOfZeros][j-countOfOnes] + 1);
                    }
                }
            }
            return memo[m][n];
        }
    };
    

      

    Analysis:

    memo[i][j] represent the max number of strings that can be formed with i 0's and j 1's.

    from the first few strings up to the current string s

    Catch: have to go from bottom right to top left

    If we go from top left to bottom right, we would be using results from this iteration => overcounting

    Reference:

    https://leetcode.com/problems/ones-and-zeroes/discuss/95814/c%2B%2B-DP-solution-with-comments

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    SQL 通配符
    SQL 中定义别名
    SQL 语句执行顺序
    将汉字散列存储
    FileStream写文本文档时候显示其他进程正在访问的问题
    向数据库中添加含有单引号的数据
    整词二分、逐字二分的分词词典机制
    C# 集合类总结(Array,Arraylist,List,Hashtable,Dictionary,Stack,Queue)
    固定表格宽度
    对于交叉表的实现及多重表头的应用
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10486251.html
Copyright © 2011-2022 走看看