mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
188 lines
20 KiB
JSON
188 lines
20 KiB
JSON
|
{
|
||
|
|
"data": {
|
||
|
|
"question": {
|
||
|
|
"questionId": "3578",
|
||
|
|
"questionFrontendId": "3311",
|
||
|
|
"boundTopicId": null,
|
||
|
|
"title": "Construct 2D Grid Matching Graph Layout",
|
||
|
|
"titleSlug": "construct-2d-grid-matching-graph-layout",
|
||
|
|
"content": "<p>You are given a 2D integer array <code>edges</code> representing an <strong>undirected</strong> graph having <code>n</code> nodes, where <code>edges[i] = [u<sub>i</sub>, v<sub>i</sub>]</code> denotes an edge between nodes <code>u<sub>i</sub></code> and <code>v<sub>i</sub></code>.</p>\n\n<p>Construct a 2D grid that satisfies these conditions:</p>\n\n<ul>\n\t<li>The grid contains <strong>all nodes</strong> from <code>0</code> to <code>n - 1</code> in its cells, with each node appearing exactly <strong>once</strong>.</li>\n\t<li>Two nodes should be in adjacent grid cells (<strong>horizontally</strong> or <strong>vertically</strong>) <strong>if and only if</strong> there is an edge between them in <code>edges</code>.</li>\n</ul>\n\n<p>It is guaranteed that <code>edges</code> can form a 2D grid that satisfies the conditions.</p>\n\n<p>Return a 2D integer array satisfying the conditions above. If there are multiple solutions, return <em>any</em> of them.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">n = 4, edges = [[0,1],[0,2],[1,3],[2,3]]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">[[3,1],[2,0]]</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode.com/uploads/2024/08/11/screenshot-from-2024-08-11-14-07-59.png\" style=\"width: 133px; height: 92px;\" /></p>\n</div>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">n = 5, edges = [[0,1],[1,3],[2,3],[2,4]]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">[[4,2,3,1,0]]</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p><img src=\"https://assets.leetcode.com/uploads/2024/08/11/screenshot-from-2024-08-11-14-06-02.png\" style=\"width: 325px; height: 50px;\" /></p>\n</div>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">n = 9, edges = [[0,1],[0,4],[0,5],[1,7],[2,3],[2,4],[2,5],[3,6],[4,6],[4,7],[6,8],[7,8]]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">[[8,6,3],[7,4,2],[1,0,5]]</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode.com/uploads/2024/08/11/screenshot-from-2024-08-11-14-06-38.png\" style=\"width: 198px; height: 133px;\" /></p>\n</div>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>2 <= n <= 5 * 10<sup>4</sup></code></li>\n\t<li><code>1 <= edges.length <= 10<sup>5</sup></code></li>\n\t<li><code>edges[i] = [u<sub>i</sub>, v<sub>i</sub>]</code></li>\n\t<li><code>0 <= u<sub>i</sub> < v<sub>i</sub> < n</code></li>\n\t<li>All the edges are distinct.</li>\n\t<li>The input is generated such that <code>edges</code> can form a 2D grid that satisfies the conditions.</li>\n</ul>\n",
|
||
|
|
"translatedTitle": null,
|
||
|
|
"translatedContent": null,
|
||
|
|
"isPaidOnly": false,
|
||
|
|
"difficulty": "Hard",
|
||
|
|
"likes": 47,
|
||
|
|
"dislikes": 8,
|
||
|
|
"isLiked": null,
|
||
|
|
"similarQuestions": "[]",
|
||
|
|
"exampleTestcases": "4\n[[0,1],[0,2],[1,3],[2,3]]\n5\n[[0,1],[1,3],[2,3],[2,4]]\n9\n[[0,1],[0,4],[0,5],[1,7],[2,3],[2,4],[2,5],[3,6],[4,6],[4,7],[6,8],[7,8]]",
|
||
|
|
"categoryTitle": "Algorithms",
|
||
|
|
"contributors": [],
|
||
|
|
"topicTags": [
|
||
|
|
{
|
||
|
|
"name": "Array",
|
||
|
|
"slug": "array",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"name": "Hash Table",
|
||
|
|
"slug": "hash-table",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"name": "Graph",
|
||
|
|
"slug": "graph",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"name": "Matrix",
|
||
|
|
"slug": "matrix",
|
||
|
|
"translatedName": null,
|
||
|
|
"__typename": "TopicTagNode"
|
||
|
|
}
|
||
|
|
],
|
||
|
|
"companyTagStats": null,
|
||
|
|
"codeSnippets": [
|
||
|
|
{
|
||
|
|
"lang": "C++",
|
||
|
|
"langSlug": "cpp",
|
||
|
|
"code": "class Solution {\npublic:\n vector<vector<int>> constructGridLayout(int n, vector<vector<int>>& edges) {\n \n }\n};",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Java",
|
||
|
|
"langSlug": "java",
|
||
|
|
"code": "class Solution {\n public int[][] constructGridLayout(int n, int[][] edges) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Python",
|
||
|
|
"langSlug": "python",
|
||
|
|
"code": "class Solution(object):\n def constructGridLayout(self, n, edges):\n \"\"\"\n :type n: int\n :type edges: List[List[int]]\n :rtype: List[List[int]]\n \"\"\"\n ",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Python3",
|
||
|
|
"langSlug": "python3",
|
||
|
|
"code": "class Solution:\n def constructGridLayout(self, n: int, edges: List[List[int]]) -> List[List[int]]:\n ",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "C",
|
||
|
|
"langSlug": "c",
|
||
|
|
"code": "/**\n * Return an array of arrays of size *returnSize.\n * The sizes of the arrays are returned as *returnColumnSizes array.\n * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().\n */\nint** constructGridLayout(int n, int** edges, int edgesSize, int* edgesColSize, int* returnSize, int** returnColumnSizes) {\n \n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "C#",
|
||
|
|
"langSlug": "csharp",
|
||
|
|
"code": "public class Solution {\n public int[][] ConstructGridLayout(int n, int[][] edges) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "JavaScript",
|
||
|
|
"langSlug": "javascript",
|
||
|
|
"code": "/**\n * @param {number} n\n * @param {number[][]} edges\n * @return {number[][]}\n */\nvar constructGridLayout = function(n, edges) {\n \n};",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "TypeScript",
|
||
|
|
"langSlug": "typescript",
|
||
|
|
"code": "function constructGridLayout(n: number, edges: number[][]): number[][] {\n \n};",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "PHP",
|
||
|
|
"langSlug": "php",
|
||
|
|
"code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $edges\n * @return Integer[][]\n */\n function constructGridLayout($n, $edges) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Swift",
|
||
|
|
"langSlug": "swift",
|
||
|
|
"code": "class Solution {\n func constructGridLayout(_ n: Int, _ edges: [[Int]]) -> [[Int]] {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Kotlin",
|
||
|
|
"langSlug": "kotlin",
|
||
|
|
"code": "class Solution {\n fun constructGridLayout(n: Int, edges: Array<IntArray>): Array<IntArray> {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Dart",
|
||
|
|
"langSlug": "dart",
|
||
|
|
"code": "class Solution {\n List<List<int>> constructGridLayout(int n, List<List<int>> edges) {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Go",
|
||
|
|
"langSlug": "golang",
|
||
|
|
"code": "func constructGridLayout(n int, edges [][]int) [][]int {\n \n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Ruby",
|
||
|
|
"langSlug": "ruby",
|
||
|
|
"code": "# @param {Integer} n\n# @param {Integer[][]} edges\n# @return {Integer[][]}\ndef construct_grid_layout(n, edges)\n \nend",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Scala",
|
||
|
|
"langSlug": "scala",
|
||
|
|
"code": "object Solution {\n def constructGridLayout(n: Int, edges: Array[Array[Int]]): Array[Array[Int]] = {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Rust",
|
||
|
|
"langSlug": "rust",
|
||
|
|
"code": "impl Solution {\n pub fn construct_grid_layout(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {\n \n }\n}",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Racket",
|
||
|
|
"langSlug": "racket",
|
||
|
|
"code": "(define/contract (construct-grid-layout n edges)\n (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)))\n )",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Erlang",
|
||
|
|
"langSlug": "erlang",
|
||
|
|
"code": "-spec construct_grid_layout(N :: integer(), Edges :: [[integer()]]) -> [[integer()]].\nconstruct_grid_layout(N, Edges) ->\n .",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
},
|
||
|
|
{
|
||
|
|
"lang": "Elixir",
|
||
|
|
"langSlug": "elixir",
|
||
|
|
"code": "defmodule Solution do\n @spec construct_grid_layout(n :: integer, edges :: [[integer]]) :: [[integer]]\n def construct_grid_layout(n, edges) do\n \n end\nend",
|
||
|
|
"__typename": "CodeSnippetNode"
|
||
|
|
}
|
||
|
|
],
|
||
|
|
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"8.3K\", \"totalAcceptedRaw\": 2204, \"totalSubmissionRaw\": 8293, \"acRate\": \"26.6%\"}",
|
||
|
|
"hints": [
|
||
|
|
"Observe the indegrees of the nodes.",
|
||
|
|
"The case where there are two nodes with an indegree of 1, and all the others have an indegree of 2 can be handled separately.",
|
||
|
|
"The nodes with the smallest degrees are the corners.",
|
||
|
|
"You can simulate the grid creation process using BFS or a similar approach after making some observations on the indegrees."
|
||
|
|
],
|
||
|
|
"solution": null,
|
||
|
|
"status": null,
|
||
|
|
"sampleTestCase": "4\n[[0,1],[0,2],[1,3],[2,3]]",
|
||
|
|
"metaData": "{\n \"name\": \"constructGridLayout\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"edges\"\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 17 </code> using the latest C++ 23 standard, and <code>libstdc++</code> provided by GCC 13.</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 21</code>. Using compile arguments: <code>--enable-preview --release 21</code></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 13</code> using the gnu11 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level one 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>\\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://learn.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-12\\\" target=\\\"_blank\\\">C# 12</a> with .NET 8 runtime</p>\"], \"javascript\": [\"JavaScript\", \"<p><code>Node.js 20.10.0</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 5.4.0 version of <a href=\\\"https://github.com/datastructures-js/priority-queue/blob/v5/README.md\\\" target=\\\"_blank\\\">datastructures-js/priority-queue</a> and 4.2.3 version of <a href=\\\
|
||
|
|
"libraryUrl": null,
|
||
|
|
"adminUrl": null,
|
||
|
|
"challengeQuestion": null,
|
||
|
|
"__typename": "QuestionNode"
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|