mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-02-05 07:00:25 +08:00
185 lines
20 KiB
JSON
185 lines
20 KiB
JSON
|
{
|
|||
|
|
"data": {
|
|||
|
|
"question": {
|
|||
|
|
"questionId": "3389",
|
|||
|
|
"questionFrontendId": "3112",
|
|||
|
|
"boundTopicId": null,
|
|||
|
|
"title": "Minimum Time to Visit Disappearing Nodes",
|
|||
|
|
"titleSlug": "minimum-time-to-visit-disappearing-nodes",
|
|||
|
|
"content": "<p>There is an undirected graph of <code>n</code> nodes. You are given a 2D array <code>edges</code>, where <code>edges[i] = [u<sub>i</sub>, v<sub>i</sub>, length<sub>i</sub>]</code> describes an edge between node <code>u<sub>i</sub></code> and node <code>v<sub>i</sub></code> with a traversal time of <code>length<sub>i</sub></code> units.</p>\n\n<p>Additionally, you are given an array <code>disappear</code>, where <code>disappear[i]</code> denotes the time when the node <code>i</code> disappears from the graph and you won't be able to visit it.</p>\n\n<p><strong>Notice</strong> that the graph might be disconnected and might contain multiple edges.</p>\n\n<p>Return the array <code>answer</code>, with <code>answer[i]</code> denoting the <strong>minimum</strong> units of time required to reach node <code>i</code> from node 0. If node <code>i</code> is <strong>unreachable</strong> from node 0 then <code>answer[i]</code> is <code>-1</code>.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<p><img 10px=\"\" alt=\"\" padding:=\"\" src=\"https://assets.leetcode.com/uploads/2024/03/09/example1.png\" style=\"width: 350px; height: 210px;\" /></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\"> n = 3, edges = [[0,1,2],[1,2,1],[0,2,4]], disappear = [1,1,5]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\"> [0,-1,4]</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p>We are starting our journey from node 0, and our goal is to find the minimum time required to reach each node before it disappears.</p>\n\n<ul>\n\t<li>For node 0, we don't need any time as it is our starting point.</li>\n\t<li>For node 1, we need at least 2 units of time to traverse <code>edges[0]</code>. Unfortunately, it disappears at that moment, so we won't be able to visit it.</li>\n\t<li>For node 2, we need at least 4 units of time to traverse <code>edges[2]</code>.</li>\n</ul>\n</div>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<p><img 10px=\"\" alt=\"\" padding:=\"\" src=\"https://assets.leetcode.com/uploads/2024/03/09/example2.png\" style=\"width: 350px; height: 210px;\" /></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\"> n = 3, edges = [[0,1,2],[1,2,1],[0,2,4]], disappear = [1,3,5]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\"> [0,2,3]</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p>We are starting our journey from node 0, and our goal is to find the minimum time required to reach each node before it disappears.</p>\n\n<ul>\n\t<li>For node 0, we don't need any time as it is the starting point.</li>\n\t<li>For node 1, we need at least 2 units of time to traverse <code>edges[0]</code>.</li>\n\t<li>For node 2, we need at least 3 units of time to traverse <code>edges[0]</code> and <code>edges[1]</code>.</li>\n</ul>\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 = 2, edges = [[0,1,1]], disappear = [1,1]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">[0,-1]</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<p>Exactly when we reach node 1, it disappears.</p>\n</div>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 5 * 10<sup>4</sup></code></li>\n\t<li><code>0 <= edges.length <= 10<sup>5</sup></code></li>\n\t<li><code>edges[i] == [u<sub>i</sub>, v<sub>i</sub>, length<sub>i</sub>]</code></li>\n\t<li><code>0 <= u<sub>i</sub>, v<sub>i</sub> <= n - 1</code></li>\n\t<li><code>1 <= length<sub>i</sub> <= 10<sup>5</sup></code></li>\n\t<li><code>disappear.length == n</code></li>\n\t<li><code>1 <= disappear[i] <= 10<sup>5</sup></code></li>\n</ul>\n",
|
|||
|
|
"translatedTitle": null,
|
|||
|
|
"translatedContent": null,
|
|||
|
|
"isPaidOnly": false,
|
|||
|
|
"difficulty": "Medium",
|
|||
|
|
"likes": 108,
|
|||
|
|
"dislikes": 18,
|
|||
|
|
"isLiked": null,
|
|||
|
|
"similarQuestions": "[]",
|
|||
|
|
"exampleTestcases": "3\n[[0,1,2],[1,2,1],[0,2,4]]\n[1,1,5]\n3\n[[0,1,2],[1,2,1],[0,2,4]]\n[1,3,5]\n2\n[[0,1,1]]\n[1,1]",
|
|||
|
|
"categoryTitle": "Algorithms",
|
|||
|
|
"contributors": [],
|
|||
|
|
"topicTags": [
|
|||
|
|
{
|
|||
|
|
"name": "Array",
|
|||
|
|
"slug": "array",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Graph",
|
|||
|
|
"slug": "graph",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Heap (Priority Queue)",
|
|||
|
|
"slug": "heap-priority-queue",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Shortest Path",
|
|||
|
|
"slug": "shortest-path",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
}
|
|||
|
|
],
|
|||
|
|
"companyTagStats": null,
|
|||
|
|
"codeSnippets": [
|
|||
|
|
{
|
|||
|
|
"lang": "C++",
|
|||
|
|
"langSlug": "cpp",
|
|||
|
|
"code": "class Solution {\npublic:\n vector<int> minimumTime(int n, vector<vector<int>>& edges, vector<int>& disappear) {\n \n }\n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Java",
|
|||
|
|
"langSlug": "java",
|
|||
|
|
"code": "class Solution {\n public int[] minimumTime(int n, int[][] edges, int[] disappear) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Python",
|
|||
|
|
"langSlug": "python",
|
|||
|
|
"code": "class Solution(object):\n def minimumTime(self, n, edges, disappear):\n \"\"\"\n :type n: int\n :type edges: List[List[int]]\n :type disappear: List[int]\n :rtype: List[int]\n \"\"\"\n ",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Python3",
|
|||
|
|
"langSlug": "python3",
|
|||
|
|
"code": "class Solution:\n def minimumTime(self, n: int, edges: List[List[int]], disappear: List[int]) -> List[int]:\n ",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "C",
|
|||
|
|
"langSlug": "c",
|
|||
|
|
"code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* minimumTime(int n, int** edges, int edgesSize, int* edgesColSize, int* disappear, int disappearSize, int* returnSize) {\n \n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "C#",
|
|||
|
|
"langSlug": "csharp",
|
|||
|
|
"code": "public class Solution {\n public int[] MinimumTime(int n, int[][] edges, int[] disappear) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "JavaScript",
|
|||
|
|
"langSlug": "javascript",
|
|||
|
|
"code": "/**\n * @param {number} n\n * @param {number[][]} edges\n * @param {number[]} disappear\n * @return {number[]}\n */\nvar minimumTime = function(n, edges, disappear) {\n \n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "TypeScript",
|
|||
|
|
"langSlug": "typescript",
|
|||
|
|
"code": "function minimumTime(n: number, edges: number[][], disappear: number[]): number[] {\n \n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "PHP",
|
|||
|
|
"langSlug": "php",
|
|||
|
|
"code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $edges\n * @param Integer[] $disappear\n * @return Integer[]\n */\n function minimumTime($n, $edges, $disappear) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Swift",
|
|||
|
|
"langSlug": "swift",
|
|||
|
|
"code": "class Solution {\n func minimumTime(_ n: Int, _ edges: [[Int]], _ disappear: [Int]) -> [Int] {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Kotlin",
|
|||
|
|
"langSlug": "kotlin",
|
|||
|
|
"code": "class Solution {\n fun minimumTime(n: Int, edges: Array<IntArray>, disappear: IntArray): IntArray {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Dart",
|
|||
|
|
"langSlug": "dart",
|
|||
|
|
"code": "class Solution {\n List<int> minimumTime(int n, List<List<int>> edges, List<int> disappear) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Go",
|
|||
|
|
"langSlug": "golang",
|
|||
|
|
"code": "func minimumTime(n int, edges [][]int, disappear []int) []int {\n \n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Ruby",
|
|||
|
|
"langSlug": "ruby",
|
|||
|
|
"code": "# @param {Integer} n\n# @param {Integer[][]} edges\n# @param {Integer[]} disappear\n# @return {Integer[]}\ndef minimum_time(n, edges, disappear)\n \nend",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Scala",
|
|||
|
|
"langSlug": "scala",
|
|||
|
|
"code": "object Solution {\n def minimumTime(n: Int, edges: Array[Array[Int]], disappear: Array[Int]): Array[Int] = {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Rust",
|
|||
|
|
"langSlug": "rust",
|
|||
|
|
"code": "impl Solution {\n pub fn minimum_time(n: i32, edges: Vec<Vec<i32>>, disappear: Vec<i32>) -> Vec<i32> {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Racket",
|
|||
|
|
"langSlug": "racket",
|
|||
|
|
"code": "(define/contract (minimum-time n edges disappear)\n (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?) (listof exact-integer?))\n )",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Erlang",
|
|||
|
|
"langSlug": "erlang",
|
|||
|
|
"code": "-spec minimum_time(N :: integer(), Edges :: [[integer()]], Disappear :: [integer()]) -> [integer()].\nminimum_time(N, Edges, Disappear) ->\n .",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Elixir",
|
|||
|
|
"langSlug": "elixir",
|
|||
|
|
"code": "defmodule Solution do\n @spec minimum_time(n :: integer, edges :: [[integer]], disappear :: [integer]) :: [integer]\n def minimum_time(n, edges, disappear) do\n \n end\nend",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
}
|
|||
|
|
],
|
|||
|
|
"stats": "{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"43.5K\", \"totalAcceptedRaw\": 14425, \"totalSubmissionRaw\": 43545, \"acRate\": \"33.1%\"}",
|
|||
|
|
"hints": [
|
|||
|
|
"Use Dijkstra’s algorithm, but only visit nodes if you can reach them before disappearance."
|
|||
|
|
],
|
|||
|
|
"solution": null,
|
|||
|
|
"status": null,
|
|||
|
|
"sampleTestCase": "3\n[[0,1,2],[1,2,1],[0,2,4]]\n[1,1,5]",
|
|||
|
|
"metaData": "{\n \"name\": \"minimumTime\",\n \"params\": [\n {\n \"type\": \"integer\",\n \"name\": \"n\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"edges\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"disappear\"\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++ 20 standard, and <code>libstdc++</code> provided by GCC 11.</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 11</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"
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|