mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
178 lines
17 KiB
JSON
178 lines
17 KiB
JSON
|
{
|
||
|
|
"data": {
|
||
|
|
"question": {
|
||
|
|
"questionId": "474",
|
||
|
|
"questionFrontendId": "474",
|
||
|
|
"boundTopicId": null,
|
||
|
|
"title": "Ones and Zeroes",
|
||
|
|
"titleSlug": "ones-and-zeroes",
|
||
|
|
"content": "<p>You are given an array of binary strings <code>strs</code> and two integers <code>m</code> and <code>n</code>.</p>\n\n<p>Return <em>the size of the largest subset of <code>strs</code> such that there are <strong>at most</strong> </em><code>m</code><em> </em><code>0</code><em>'s and </em><code>n</code><em> </em><code>1</code><em>'s in the subset</em>.</p>\n\n<p>A set <code>x</code> is a <strong>subset</strong> of a set <code>y</code> if all elements of <code>x</code> are also elements of <code>y</code>.</p>\n\n<p> </p>\n<p><strong>Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> strs = ["10","0001","111001","1","0"], m = 5, n = 3\n<strong>Output:</strong> 4\n<strong>Explanation:</strong> The largest subset with at most 5 0's and 3 1's is {"10", "0001", "1", "0"}, so the answer is 4.\nOther valid but smaller subsets include {"0001", "1"} and {"10", "1", "0"}.\n{"111001"} is an invalid subset because it contains 4 1's, greater than the maximum of 3.\n</pre>\n\n<p><strong>Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> strs = ["10","0","1"], m = 1, n = 1\n<strong>Output:</strong> 2\n<b>Explanation:</b> The largest subset is {"0", "1"}, so the answer is 2.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= strs.length <= 600</code></li>\n\t<li><code>1 <= strs[i].length <= 100</code></li>\n\t<li><code>strs[i]</code> consists only of digits <code>'0'</code> and <code>'1'</code>.</li>\n\t<li><code>1 <= m, n <= 100</code></li>\n</ul>\n",
|
||
|
|
"translatedTitle": null,
|
||
|
|
"translatedContent": null,
|
||
|
|
"isPaidOnly": false,
|
||
|
|
"difficulty": "Medium",
|
||
|
|
"likes": 2748,
|
||
|
|
"dislikes": 320,
|
||
|
|
"isLiked": null,
|
||
|
|
"similarQuestions": "[{\"title\": \"Count Subarrays With More Ones Than Zeros\", \"titleSlug\": \"count-subarrays-with-more-ones-than-zeros\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Non-negative Integers without Consecutive Ones\", \"titleSlug\": \"non-negative-integers-without-consecutive-ones\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"All Divisions With the Highest Score of a Binary Array\", \"titleSlug\": \"all-divisions-with-the-highest-score-of-a-binary-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||
|
|
"exampleTestcases": "[\"10\",\"0001\",\"111001\",\"1\",\"0\"]\n5\n3\n[\"10\",\"0\",\"1\"]\n1\n1",
|
||
|
|
"categoryTitle": "Algorithms",
|
||
|
|
"contributors": [],
|
||
|
|
"topicTags": [
|
||
|
|
{
|
||
|
|
"name": "Array",
|
||
|
|
"slug": "array",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"name": "String",
|
||
|
|
"slug": "string",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"name": "Dynamic Programming",
|
||
|
|
"slug": "dynamic-programming",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
}
|
||
|
|
],
|
||
|
|
"companyTagStats": null,
|
||
|
|
"codeSnippets": [
|
||
|
|
{
|
||
|
|
"lang": "C++",
|
||
|
|
"langSlug": "cpp",
|
||
|
|
"code": "class Solution {\npublic:\n int findMaxForm(vector<string>& strs, int m, int n) {\n \n }\n};",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Java",
|
||
|
|
"langSlug": "java",
|
||
|
|
"code": "class Solution {\n public int findMaxForm(String[] strs, int m, int n) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Python",
|
||
|
|
"langSlug": "python",
|
||
|
|
"code": "class Solution(object):\n def findMaxForm(self, strs, m, n):\n \"\"\"\n :type strs: List[str]\n :type m: int\n :type n: int\n :rtype: int\n \"\"\"\n ",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Python3",
|
||
|
|
"langSlug": "python3",
|
||
|
|
"code": "class Solution:\n def findMaxForm(self, strs: List[str], m: int, n: int) -> int:\n ",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "C",
|
||
|
|
"langSlug": "c",
|
||
|
|
"code": "\n\nint findMaxForm(char ** strs, int strsSize, int m, int n){\n\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "C#",
|
||
|
|
"langSlug": "csharp",
|
||
|
|
"code": "public class Solution {\n public int FindMaxForm(string[] strs, int m, int n) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "JavaScript",
|
||
|
|
"langSlug": "javascript",
|
||
|
|
"code": "/**\n * @param {string[]} strs\n * @param {number} m\n * @param {number} n\n * @return {number}\n */\nvar findMaxForm = function(strs, m, n) {\n \n};",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Ruby",
|
||
|
|
"langSlug": "ruby",
|
||
|
|
"code": "# @param {String[]} strs\n# @param {Integer} m\n# @param {Integer} n\n# @return {Integer}\ndef find_max_form(strs, m, n)\n \nend",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Swift",
|
||
|
|
"langSlug": "swift",
|
||
|
|
"code": "class Solution {\n func findMaxForm(_ strs: [String], _ m: Int, _ n: Int) -> Int {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Go",
|
||
|
|
"langSlug": "golang",
|
||
|
|
"code": "func findMaxForm(strs []string, m int, n int) int {\n \n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Scala",
|
||
|
|
"langSlug": "scala",
|
||
|
|
"code": "object Solution {\n def findMaxForm(strs: Array[String], m: Int, n: Int): Int = {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Kotlin",
|
||
|
|
"langSlug": "kotlin",
|
||
|
|
"code": "class Solution {\n fun findMaxForm(strs: Array<String>, m: Int, n: Int): Int {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Rust",
|
||
|
|
"langSlug": "rust",
|
||
|
|
"code": "impl Solution {\n pub fn find_max_form(strs: Vec<String>, m: i32, n: i32) -> i32 {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "PHP",
|
||
|
|
"langSlug": "php",
|
||
|
|
"code": "class Solution {\n\n /**\n * @param String[] $strs\n * @param Integer $m\n * @param Integer $n\n * @return Integer\n */\n function findMaxForm($strs, $m, $n) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "TypeScript",
|
||
|
|
"langSlug": "typescript",
|
||
|
|
"code": "function findMaxForm(strs: string[], m: number, n: number): number {\n\n};",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Racket",
|
||
|
|
"langSlug": "racket",
|
||
|
|
"code": "(define/contract (find-max-form strs m n)\n (-> (listof string?) exact-integer? exact-integer? exact-integer?)\n\n )",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Erlang",
|
||
|
|
"langSlug": "erlang",
|
||
|
|
"code": "-spec find_max_form(Strs :: [unicode:unicode_binary()], M :: integer(), N :: integer()) -> integer().\nfind_max_form(Strs, M, N) ->\n .",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Elixir",
|
||
|
|
"langSlug": "elixir",
|
||
|
|
"code": "defmodule Solution do\n @spec find_max_form(strs :: [String.t], m :: integer, n :: integer) :: integer\n def find_max_form(strs, m, n) do\n\n end\nend",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
}
|
||
|
|
],
|
||
|
|
"stats": "{\"totalAccepted\": \"104.4K\", \"totalSubmission\": \"234.8K\", \"totalAcceptedRaw\": 104410, \"totalSubmissionRaw\": 234791, \"acRate\": \"44.5%\"}",
|
||
|
|
"hints": [],
|
||
|
|
"solution": {
|
||
|
|
"id": "112",
|
||
|
|
"canSeeDetail": false,
|
||
|
|
"paidOnly": true,
|
||
|
|
"hasVideoSolution": false,
|
||
|
|
"paidOnlyVideo": true,
|
||
|
|
"__typename": "ArticleNode"
|
||
|
|
},
|
||
|
|
"status": null,
|
||
|
|
"sampleTestCase": "[\"10\",\"0001\",\"111001\",\"1\",\"0\"]\n5\n3",
|
||
|
|
"metaData": "{\n \"name\": \"findMaxForm\",\n \"params\": [\n {\n \"name\": \"strs\",\n \"type\": \"string[]\"\n },\n {\n \"name\": \"m\",\n \"type\": \"integer\"\n },\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}\n",
|
||
|
|
"judgerAvailable": true,
|
||
|
|
"judgeType": "large",
|
||
|
|
"mysqlSchemas": [],
|
||
|
|
"enableRunCode": true,
|
||
|
|
"enableTestMode": false,
|
||
|
|
"enableDebugger": true,
|
||
|
|
"envInfo": "{\"cpp\": [\"C++\", \"<p>Compiled with <code> clang 11 </code> using the latest C++ 17 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level two optimization (<code>-O2</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\"], \"java\": [\"Java\", \"<p><code> OpenJDK 17 </code>. Java 8 features such as lambda expressions and stream API can be used. </p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n<p>Includes <code>Pair</code> class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.</p>\"], \"python\": [\"Python\", \"<p><code>Python 2.7.12</code>.</p>\\r\\n\\r\\n<p>Most libraries are already imported automatically for your convenience, such as <a href=\\\"https://docs.python.org/2/library/array.html\\\" target=\\\"_blank\\\">array</a>, <a href=\\\"https://docs.python.org/2/library/bisect.html\\\" target=\\\"_blank\\\">bisect</a>, <a href=\\\"https://docs.python.org/2/library/collections.html\\\" target=\\\"_blank\\\">collections</a>. If you need more libraries, you can import it yourself.</p>\\r\\n\\r\\n<p>For Map/TreeMap data structure, you may use <a href=\\\"http://www.grantjenks.com/docs/sortedcontainers/\\\" target=\\\"_blank\\\">sortedcontainers</a> library.</p>\\r\\n\\r\\n<p>Note that Python 2.7 <a href=\\\"https://www.python.org/dev/peps/pep-0373/\\\" target=\\\"_blank\\\">will not be maintained past 2020</a>. For the latest Python, please choose Python3 instead.</p>\"], \"c\": [\"C\", \"<p>Compiled with <code>gcc 8.2</code> using the gnu99 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level one optimization (<code>-O1</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n\\r\\n<p>For hash table operations, you may use <a href=\\\"https://troydhanson.github.io/uthash/\\\" target=\\\"_blank\\\">uthash</a>. \\\"uthash.h\\\" is included by default. Below are some examples:</p>\\r\\n\\r\\n<p><b>1. Adding an item to a hash.</b>\\r\\n<pre>\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>2. Looking up an item in a hash:</b>\\r\\n<pre>\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>3. Deleting an item in a hash:</b>\\r\\n<pre>\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n</pre>\\r\\n</p>\"], \"csharp\": [\"C#\", \"<p><a href=\\\"https://docs.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-9\\\" target=\\\"_blank\\\">C# 10 with .NET 6 runtime</a></p>\\r\\n\\r\\n<p>Your code is compiled with debug flag enabled (<code>/debug</code>).</p>\"], \"javascript\": [\"JavaScript\", \"<p><code>Node.js 16.13.2</code>.</p>\\r\\n\\r\\n<p>Your code is run with <code>--harmony</code> flag, enabling <a href=\\\"http://node.green/\\\" target=\\\"_blank\\\">new ES6 features</a>.</p>\\r\\n\\r\\n<p><a href=\\\"https://lodash.com\\\" target=\\\"_blank\\\">lodash.js</a> library is included by default.</p>\\r\\n\\r\\n<p>For Priority Queue / Queue data structures, you may use <a href=\\\"https://github.com/datastructures-js/priority-queue\\\" target=\\\"_blank\\\">datastructures-js/priority-queue</a> and <a href=\\\"https:
|
||
|
|
"libraryUrl": null,
|
||
|
|
"adminUrl": null,
|
||
|
|
"challengeQuestion": null,
|
||
|
|
"__typename": "QuestionNode"
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|