474. Ones and Zeroes
来源:互联网 发布:马甲网络收货平台 编辑:程序博客网 时间:2024/06/05 19:42
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 100The size of given string array won't exceed 600.Example 1:Input: Array = {"10", "0001", "111001", "1", "0"}, m = 5, n = 3Output: 4Explanation: 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 = 1Output: 2Explanation: You could form "10", but then you'd have nothing left. Better form "0" and "1".
- -
class Solution {public: int findMaxForm(vector<string>& strs, int m, int n) { vector<vector<int>> memo(m+1, vector<int>(n+1, 0)); int numZeroes, numOnes; for (auto &s : strs) { numZeroes = numOnes = 0; // count number of zeroes and ones in current string for (auto c : s) { if (c == '0') numZeroes++; else if (c == '1') numOnes++; } // memo[i][j] = 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 // Why? If a cell in the memo is updated(because s is selected), // we should be adding 1 to memo[i][j] from the previous iteration (when we were not considering s) // If we go from top left to bottom right, we would be using results from this iteration => overcounting for (int i = m; i >= numZeroes; i--) { for (int j = n; j >= numOnes; j--) { memo[i][j] = max(memo[i][j], memo[i - numZeroes][j - numOnes] + 1); } } } return memo[m][n]; }};
阅读全文
0 0
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- 474. Ones and Zeroes
- Publishing failed with multiple errors Could not delete *,May be locked by another process.
- Typora-changelog-0.9.37 (beta)
- 刷题记录
- StateListDrawable资源
- 全球最受欢迎的五大生产制造管理系统
- 474. Ones and Zeroes
- pytorch实现VAE
- technology
- phpstorm 设置注释
- 现代OpenGL+Qt学习笔记之八:GLSL双面渲染
- Git C# ignore文件
- LinkedHashMap 源码解析
- 阿里云ubuntu 14.04 搭建lamp开发环境的实践记录
- Boolan 设计模式 第一周