Beautiful Arrangement

[leetcode]Ones and Zeroes

链接:https://leetcode.com/problems/ones-and-zeroes/description/

Question

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

Solution

class Solution {
public:
#define print(A) cout << #A << ": "<< A << endl;
#define inf 0x3fffffff
  int findMaxForm(vector<string>& strs, int m, int n) {
    int size = strs.size();
    int dp[110][110] = {};
    // 由于是求最大值,所以一开始初始化为一个最小的数
    for (int j = 0; j <= m; j++)
      for (int k = 0; k <= n; k++)
        dp[j][k] = 0;

    // 类似于0-1背包问题,减少一维的时候需要从后往前进行遍历,只是这里是两维而已
    for (int i = 0; i < size; i++) {
      int ones = count(strs[i].begin(), strs[i].end(), '1');
      int zeros = strs[i].size()-ones;
      for (int j = m; j >= zeros; j--)
        for (int k = n; k >= ones; k--)
          dp[j][k] = max(dp[j-zeros][k-ones]+1, dp[j][k]);
    }

    return dp[m][n];
  }
};

思路:类似于0-1背包问题,减少一维的时候需要从后往前进行遍历,只是这里是两维而已,如果还需要添加一维的话应该是位置i。由于这里是取最多的字符串数量,所以是取dp的最大值就可以了。

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/perdon123123/article/details/81591721
个人分类: leetcode 动态规划
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭