mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
181 lines
17 KiB
JSON
181 lines
17 KiB
JSON
|
{
|
||
|
|
"data": {
|
||
|
|
"question": {
|
||
|
|
"questionId": "1487",
|
||
|
|
"questionFrontendId": "1386",
|
||
|
|
"boundTopicId": null,
|
||
|
|
"title": "Cinema Seat Allocation",
|
||
|
|
"titleSlug": "cinema-seat-allocation",
|
||
|
|
"content": "<p><img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/02/14/cinema_seats_1.png\" style=\"width: 400px; height: 149px;\" /></p>\n\n<p>A cinema has <code>n</code> rows of seats, numbered from 1 to <code>n</code> and there are ten seats in each row, labelled from 1 to 10 as shown in the figure above.</p>\n\n<p>Given the array <code>reservedSeats</code> containing the numbers of seats already reserved, for example, <code>reservedSeats[i] = [3,8]</code> means the seat located in row <strong>3</strong> and labelled with <b>8</b> is already reserved.</p>\n\n<p><em>Return the maximum number of four-person groups you can assign on the cinema seats.</em> A four-person group occupies four adjacent seats <strong>in one single row</strong>. Seats across an aisle (such as [3,3] and [3,4]) are not considered to be adjacent, but there is an exceptional case on which an aisle split a four-person group, in that case, the aisle split a four-person group in the middle, which means to have two people on each side.</p>\n\n<p> </p>\n<p><strong>Example 1:</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/02/14/cinema_seats_3.png\" style=\"width: 400px; height: 96px;\" /></p>\n\n<pre>\n<strong>Input:</strong> n = 3, reservedSeats = [[1,2],[1,3],[1,8],[2,6],[3,1],[3,10]]\n<strong>Output:</strong> 4\n<strong>Explanation:</strong> The figure above shows the optimal allocation for four groups, where seats mark with blue are already reserved and contiguous seats mark with orange are for one group.\n</pre>\n\n<p><strong>Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 2, reservedSeats = [[2,1],[1,8],[2,6]]\n<strong>Output:</strong> 2\n</pre>\n\n<p><strong>Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> n = 4, reservedSeats = [[4,3],[1,4],[4,6],[1,7]]\n<strong>Output:</strong> 4\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 10^9</code></li>\n\t<li><code>1 <= reservedSeats.length <= min(10*n, 10^4)</code></li>\n\t<li><code>reservedSeats[i].length == 2</code></li>\n\t<li><code>1 <= reservedSeats[i][0] <= n</code></li>\n\t<li><code>1 <= reservedSeats[i][1] <= 10</code></li>\n\t<li>All <code>reservedSeats[i]</code> are distinct.</li>\n</ul>\n",
|
||
|
|
"translatedTitle": null,
|
||
|
|
"translatedContent": null,
|
||
|
|
"isPaidOnly": false,
|
||
|
|
"difficulty": "Medium",
|
||
|
|
"likes": 444,
|
||
|
|
"dislikes": 237,
|
||
|
|
"isLiked": null,
|
||
|
|
"similarQuestions": "[]",
|
||
|
|
"exampleTestcases": "3\n[[1,2],[1,3],[1,8],[2,6],[3,1],[3,10]]\n2\n[[2,1],[1,8],[2,6]]\n4\n[[4,3],[1,4],[4,6],[1,7]]",
|
||
|
|
"categoryTitle": "Algorithms",
|
||
|
|
"contributors": [],
|
||
|
|
"topicTags": [
|
||
|
|
{
|
||
|
|
"name": "Array",
|
||
|
|
"slug": "array",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"name": "Hash Table",
|
||
|
|
"slug": "hash-table",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"name": "Greedy",
|
||
|
|
"slug": "greedy",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"name": "Bit Manipulation",
|
||
|
|
"slug": "bit-manipulation",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
}
|
||
|
|
],
|
||
|
|
"companyTagStats": null,
|
||
|
|
"codeSnippets": [
|
||
|
|
{
|
||
|
|
"lang": "C++",
|
||
|
|
"langSlug": "cpp",
|
||
|
|
"code": "class Solution {\npublic:\n int maxNumberOfFamilies(int n, vector<vector<int>>& reservedSeats) {\n \n }\n};",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Java",
|
||
|
|
"langSlug": "java",
|
||
|
|
"code": "class Solution {\n public int maxNumberOfFamilies(int n, int[][] reservedSeats) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Python",
|
||
|
|
"langSlug": "python",
|
||
|
|
"code": "class Solution(object):\n def maxNumberOfFamilies(self, n, reservedSeats):\n \"\"\"\n :type n: int\n :type reservedSeats: List[List[int]]\n :rtype: int\n \"\"\"\n ",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Python3",
|
||
|
|
"langSlug": "python3",
|
||
|
|
"code": "class Solution:\n def maxNumberOfFamilies(self, n: int, reservedSeats: List[List[int]]) -> int:\n ",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "C",
|
||
|
|
"langSlug": "c",
|
||
|
|
"code": "\n\nint maxNumberOfFamilies(int n, int** reservedSeats, int reservedSeatsSize, int* reservedSeatsColSize){\n\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "C#",
|
||
|
|
"langSlug": "csharp",
|
||
|
|
"code": "public class Solution {\n public int MaxNumberOfFamilies(int n, int[][] reservedSeats) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "JavaScript",
|
||
|
|
"langSlug": "javascript",
|
||
|
|
"code": "/**\n * @param {number} n\n * @param {number[][]} reservedSeats\n * @return {number}\n */\nvar maxNumberOfFamilies = function(n, reservedSeats) {\n \n};",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Ruby",
|
||
|
|
"langSlug": "ruby",
|
||
|
|
"code": "# @param {Integer} n\n# @param {Integer[][]} reserved_seats\n# @return {Integer}\ndef max_number_of_families(n, reserved_seats)\n \nend",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Swift",
|
||
|
|
"langSlug": "swift",
|
||
|
|
"code": "class Solution {\n func maxNumberOfFamilies(_ n: Int, _ reservedSeats: [[Int]]) -> Int {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Go",
|
||
|
|
"langSlug": "golang",
|
||
|
|
"code": "func maxNumberOfFamilies(n int, reservedSeats [][]int) int {\n \n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Scala",
|
||
|
|
"langSlug": "scala",
|
||
|
|
"code": "object Solution {\n def maxNumberOfFamilies(n: Int, reservedSeats: Array[Array[Int]]): Int = {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Kotlin",
|
||
|
|
"langSlug": "kotlin",
|
||
|
|
"code": "class Solution {\n fun maxNumberOfFamilies(n: Int, reservedSeats: Array<IntArray>): Int {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Rust",
|
||
|
|
"langSlug": "rust",
|
||
|
|
"code": "impl Solution {\n pub fn max_number_of_families(n: i32, reserved_seats: Vec<Vec<i32>>) -> i32 {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "PHP",
|
||
|
|
"langSlug": "php",
|
||
|
|
"code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $reservedSeats\n * @return Integer\n */\n function maxNumberOfFamilies($n, $reservedSeats) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "TypeScript",
|
||
|
|
"langSlug": "typescript",
|
||
|
|
"code": "function maxNumberOfFamilies(n: number, reservedSeats: number[][]): number {\n\n};",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Racket",
|
||
|
|
"langSlug": "racket",
|
||
|
|
"code": "(define/contract (max-number-of-families n reservedSeats)\n (-> exact-integer? (listof (listof exact-integer?)) exact-integer?)\n\n )",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Erlang",
|
||
|
|
"langSlug": "erlang",
|
||
|
|
"code": "-spec max_number_of_families(N :: integer(), ReservedSeats :: [[integer()]]) -> integer().\nmax_number_of_families(N, ReservedSeats) ->\n .",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Elixir",
|
||
|
|
"langSlug": "elixir",
|
||
|
|
"code": "defmodule Solution do\n @spec max_number_of_families(n :: integer, reserved_seats :: [[integer]]) :: integer\n def max_number_of_families(n, reserved_seats) do\n\n end\nend",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
}
|
||
|
|
],
|
||
|
|
"stats": "{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"56.2K\", \"totalAcceptedRaw\": 22082, \"totalSubmissionRaw\": 56199, \"acRate\": \"39.3%\"}",
|
||
|
|
"hints": [
|
||
|
|
"Note you can allocate at most two families in one row.",
|
||
|
|
"Greedily check if you can allocate seats for two families, one family or none.",
|
||
|
|
"Process only rows that appear in the input, for other rows you can always allocate seats for two families."
|
||
|
|
],
|
||
|
|
"solution": null,
|
||
|
|
"status": null,
|
||
|
|
"sampleTestCase": "3\n[[1,2],[1,3],[1,8],[2,6],[3,1],[3,10]]",
|
||
|
|
"metaData": "{\n \"name\": \"maxNumberOfFamilies\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"reservedSeats\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\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"
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|