Leetcode 474. Ones and Zeroes (Medium) (cpp)
来源:互联网 发布:surge for mac 教程 编辑:程序博客网 时间:2024/06/07 20:44
Leetcode 474. Ones and Zeroes (Medium) (cpp)
Tag: Dynamic Programming
Difficulty: Medium
/*474. Ones and Zeroes (Medium)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;for (auto c : s) {if (c == '0') {numZeroes++;}else if (c == '1') {numOnes++;}}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
- Leetcode 474. Ones and Zeroes (Medium) (cpp)
- 474. Ones and Zeroes -Medium
- 474. Ones and Zeroes Medium
- LeetCode 474. Ones and Zeroes
- [leetcode] 474. Ones and Zeroes
- LeetCode 474. Ones and Zeroes
- Leetcode-474. Ones and Zeroes
- [LeetCode]474. Ones and Zeroes
- 【LeetCode】 474. Ones and Zeroes
- LeetCode 474. Ones and Zeroes
- [leetcode]474. Ones and Zeroes
- Leetcode 474. Ones and Zeroes
- Leetcode 474. Ones and Zeroes
- leetcode 474. Ones and Zeroes
- [LeetCode] 474. Ones and Zeroes
- LeetCode: Ones and Zeroes
- [LeetCode] Ones and Zeroes
- 第十一周:[Leetcode]474. Ones and Zeroes
- Spark(三): 安装与配置
- linux设置时间同步命令
- pdo笔记
- addScalar的用法与作用
- windows7局域网文件夹共享
- Leetcode 474. Ones and Zeroes (Medium) (cpp)
- Java核心技术点之多线程
- Spark(四): Spark-sql 读hbase
- Nginx基本功能极速入门
- 阿里淘宝架构学习:聊一聊淘宝首页和它背后的一套
- 摇一摇震动或播放音频案例以及分析详情
- 标签机打印程序研究(二)
- Qt5.7 + VS2015 环境搭建
- struts2的国际化