clang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n\\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\\n2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n\\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\\n3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\nlodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\nWith bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+ "book": null,
+ "isSubscribed": false,
+ "isDailyQuestion": false,
+ "dailyRecordStatus": null,
+ "editorType": "CKEDITOR",
+ "ugcQuestionId": null,
+ "style": "LEETCODE",
+ "exampleTestcases": "[1,2,3,4,5]\n[1,2,3,4,6]\n[2,3,2]\n[2,2,3]\n[3,4,3]\n[4,3,2]",
+ "__typename": "QuestionNode"
+ }
+ }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/count-the-number-of-houses-at-a-certain-distance-i.json b/leetcode-cn/originData/count-the-number-of-houses-at-a-certain-distance-i.json
new file mode 100644
index 00000000..7f557e13
--- /dev/null
+++ b/leetcode-cn/originData/count-the-number-of-houses-at-a-certain-distance-i.json
@@ -0,0 +1,182 @@
+{
+ "data": {
+ "question": {
+ "questionId": "3271",
+ "questionFrontendId": "3015",
+ "categoryTitle": "Algorithms",
+ "boundTopicId": 2611695,
+ "title": "Count the Number of Houses at a Certain Distance I",
+ "titleSlug": "count-the-number-of-houses-at-a-certain-distance-i",
+ "content": "
You are given three positive integers n, x, and y.
\n\nIn a city, there exist houses numbered 1 to n connected by n streets. There is a street connecting the house numbered i with the house numbered i + 1 for all 1 <= i <= n - 1 . An additional street connects the house numbered x with the house numbered y.
\n\nFor each k, such that 1 <= k <= n, you need to find the number of pairs of houses (house1, house2) such that the minimum number of streets that need to be traveled to reach house2 from house1 is k.
\n\nReturn a 1-indexed array result of length n where result[k] represents the total number of pairs of houses such that the minimum streets required to reach one house from the other is k.
\n\nNote that x and y can be equal.
\n\n
\nExample 1:
\n![\"\"](\"https://assets.leetcode.com/uploads/2023/12/20/example2.png\")
\n\nInput: n = 3, x = 1, y = 3\nOutput: [6,0,0]\nExplanation: Let's look at each pair of houses:\n- For the pair (1, 2), we can go from house 1 to house 2 directly.\n- For the pair (2, 1), we can go from house 2 to house 1 directly.\n- For the pair (1, 3), we can go from house 1 to house 3 directly.\n- For the pair (3, 1), we can go from house 3 to house 1 directly.\n- For the pair (2, 3), we can go from house 2 to house 3 directly.\n- For the pair (3, 2), we can go from house 3 to house 2 directly.\n
\n\nExample 2:
\n![\"\"](\"https://assets.leetcode.com/uploads/2023/12/20/example3.png\")
\n\nInput: n = 5, x = 2, y = 4\nOutput: [10,8,2,0,0]\nExplanation: For each distance k the pairs are:\n- For k == 1, the pairs are (1, 2), (2, 1), (2, 3), (3, 2), (2, 4), (4, 2), (3, 4), (4, 3), (4, 5), and (5, 4).\n- For k == 2, the pairs are (1, 3), (3, 1), (1, 4), (4, 1), (2, 5), (5, 2), (3, 5), and (5, 3).\n- For k == 3, the pairs are (1, 5), and (5, 1).\n- For k == 4 and k == 5, there are no pairs.\n
\n\nExample 3:
\n![\"\"](\"https://assets.leetcode.com/uploads/2023/12/20/example5.png\")
\n\nInput: n = 4, x = 1, y = 1\nOutput: [6,4,2,0]\nExplanation: For each distance k the pairs are:\n- For k == 1, the pairs are (1, 2), (2, 1), (2, 3), (3, 2), (3, 4), and (4, 3).\n- For k == 2, the pairs are (1, 3), (3, 1), (2, 4), and (4, 2).\n- For k == 3, the pairs are (1, 4), and (4, 1).\n- For k == 4, there are no pairs.\n
\n\n
\nConstraints:
\n\n\n\t2 <= n <= 1001 <= x, y <= n
\n",
+ "translatedTitle": "按距离统计房屋对数目 I",
+ "translatedContent": "给你三个 正整数 n 、x 和 y 。
\n\n在城市中，存在编号从 1 到 n 的房屋，由 n 条街道相连。对所有 1 <= i < n ，都存在一条街道连接编号为 i 的房屋与编号为 i + 1 的房屋。另存在一条街道连接编号为 x 的房屋与编号为 y 的房屋。
\n\n对于每个 k（1 <= k <= n），你需要找出所有满足要求的 房屋对 [house1, house2] ，即从 house1 到 house2 需要经过的 最少 街道数为 k 。
\n\n返回一个下标从 1 开始且长度为 n 的数组 result ，其中 result[k] 表示所有满足要求的房屋对的数量，即从一个房屋到另一个房屋需要经过的 最少 街道数为 k 。
\n\n注意，x 与 y 可以 相等 。
\n\n
\n\n示例 1：
\n\n\n输入：n = 3, x = 1, y = 3\n输出：[6,0,0]\n解释：让我们检视每个房屋对\n- 对于房屋对 (1, 2)，可以直接从房屋 1 到房屋 2。\n- 对于房屋对 (2, 1)，可以直接从房屋 2 到房屋 1。\n- 对于房屋对 (1, 3)，可以直接从房屋 1 到房屋 3。\n- 对于房屋对 (3, 1)，可以直接从房屋 3 到房屋 1。\n- 对于房屋对 (2, 3)，可以直接从房屋 2 到房屋 3。\n- 对于房屋对 (3, 2)，可以直接从房屋 3 到房屋 2。\n
\n\n示例 2：
\n\n\n输入：n = 5, x = 2, y = 4\n输出：[10,8,2,0,0]\n解释：对于每个距离 k ，满足要求的房屋对如下：\n- 对于 k == 1，满足要求的房屋对有 (1, 2), (2, 1), (2, 3), (3, 2), (2, 4), (4, 2), (3, 4), (4, 3), (4, 5), 以及 (5, 4)。\n- 对于 k == 2，满足要求的房屋对有 (1, 3), (3, 1), (1, 4), (4, 1), (2, 5), (5, 2), (3, 5), 以及 (5, 3)。\n- 对于 k == 3，满足要求的房屋对有 (1, 5)，以及 (5, 1) 。\n- 对于 k == 4 和 k == 5，不存在满足要求的房屋对。\n
\n\n示例 3：
\n\n\n输入：n = 4, x = 1, y = 1\n输出：[6,4,2,0]\n解释：对于每个距离 k ，满足要求的房屋对如下：\n- 对于 k == 1，满足要求的房屋对有 (1, 2), (2, 1), (2, 3), (3, 2), (3, 4), 以及 (4, 3)。\n- 对于 k == 2，满足要求的房屋对有 (1, 3), (3, 1), (2, 4), 以及 (4, 2)。\n- 对于 k == 3，满足要求的房屋对有 (1, 4), 以及 (4, 1)。\n- 对于 k == 4，不存在满足要求的房屋对。\n
\n\n
\n\n提示：
\n\n\n\t2 <= n <= 1001 <= x, y <= n
\n",
+ "isPaidOnly": false,
+ "difficulty": "Medium",
+ "likes": 4,
+ "dislikes": 0,
+ "isLiked": null,
+ "similarQuestions": "[]",
+ "contributors": [],
+ "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+ "topicTags": [
+ {
+ "name": "Breadth-First Search",
+ "slug": "breadth-first-search",
+ "translatedName": "广度优先搜索",
+ "__typename": "TopicTagNode"
+ },
+ {
+ "name": "Graph",
+ "slug": "graph",
+ "translatedName": "图",
+ "__typename": "TopicTagNode"
+ },
+ {
+ "name": "Prefix Sum",
+ "slug": "prefix-sum",
+ "translatedName": "前缀和",
+ "__typename": "TopicTagNode"
+ }
+ ],
+ "companyTagStats": null,
+ "codeSnippets": [
+ {
+ "lang": "C++",
+ "langSlug": "cpp",
+ "code": "class Solution {\npublic:\n vector countOfPairs(int n, int x, int y) {\n \n }\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Java",
+ "langSlug": "java",
+ "code": "class Solution {\n public int[] countOfPairs(int n, int x, int y) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python",
+ "langSlug": "python",
+ "code": "class Solution(object):\n def countOfPairs(self, n, x, y):\n \"\"\"\n :type n: int\n :type x: int\n :type y: int\n :rtype: List[int]\n \"\"\"",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python3",
+ "langSlug": "python3",
+ "code": "class Solution:\n def countOfPairs(self, n: int, x: int, y: int) -> List[int]:",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C",
+ "langSlug": "c",
+ "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* countOfPairs(int n, int x, int y, int* returnSize) {\n \n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C#",
+ "langSlug": "csharp",
+ "code": "public class Solution {\n public int[] CountOfPairs(int n, int x, int y) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "JavaScript",
+ "langSlug": "javascript",
+ "code": "/**\n * @param {number} n\n * @param {number} x\n * @param {number} y\n * @return {number[]}\n */\nvar countOfPairs = function(n, x, y) {\n\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "TypeScript",
+ "langSlug": "typescript",
+ "code": "function countOfPairs(n: number, x: number, y: number): number[] {\n \n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "PHP",
+ "langSlug": "php",
+ "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $x\n * @param Integer $y\n * @return Integer[]\n */\n function countOfPairs($n, $x, $y) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Swift",
+ "langSlug": "swift",
+ "code": "class Solution {\n func countOfPairs(_ n: Int, _ x: Int, _ y: Int) -> [Int] {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Kotlin",
+ "langSlug": "kotlin",
+ "code": "class Solution {\n fun countOfPairs(n: Int, x: Int, y: Int): IntArray {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Dart",
+ "langSlug": "dart",
+ "code": "class Solution {\n List countOfPairs(int n, int x, int y) {\n \n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Go",
+ "langSlug": "golang",
+ "code": "func countOfPairs(n int, x int, y int) []int {\n\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Ruby",
+ "langSlug": "ruby",
+ "code": "# @param {Integer} n\n# @param {Integer} x\n# @param {Integer} y\n# @return {Integer[]}\ndef count_of_pairs(n, x, y)\n \nend",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Scala",
+ "langSlug": "scala",
+ "code": "object Solution {\n def countOfPairs(n: Int, x: Int, y: Int): Array[Int] = {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Rust",
+ "langSlug": "rust",
+ "code": "impl Solution {\n pub fn count_of_pairs(n: i32, x: i32, y: i32) -> Vec {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Racket",
+ "langSlug": "racket",
+ "code": "(define/contract (count-of-pairs n x y)\n (-> exact-integer? exact-integer? exact-integer? (listof exact-integer?))\n )",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Erlang",
+ "langSlug": "erlang",
+ "code": "-spec count_of_pairs(N :: integer(), X :: integer(), Y :: integer()) -> [integer()].\ncount_of_pairs(N, X, Y) ->\n .",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Elixir",
+ "langSlug": "elixir",
+ "code": "defmodule Solution do\n @spec count_of_pairs(n :: integer, x :: integer, y :: integer) :: [integer]\n def count_of_pairs(n, x, y) do\n \n end\nend",
+ "__typename": "CodeSnippetNode"
+ }
+ ],
+ "stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"6.2K\", \"totalAcceptedRaw\": 2852, \"totalSubmissionRaw\": 6182, \"acRate\": \"46.1%\"}",
+ "hints": [
+ "Start from each house, run a BFS to get all the distances from this house to all the other houses."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "3\n1\n3",
+ "metaData": "{\n \"name\": \"countOfPairs\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"x\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"y\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "envInfo": "{\"cpp\":[\"C++\",\"\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n\\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\\n2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n\\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\\n3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\nlodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\nWith bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+ "book": null,
+ "isSubscribed": false,
+ "isDailyQuestion": false,
+ "dailyRecordStatus": null,
+ "editorType": "CKEDITOR",
+ "ugcQuestionId": null,
+ "style": "LEETCODE",
+ "exampleTestcases": "3\n1\n3\n5\n2\n4\n4\n1\n1",
+ "__typename": "QuestionNode"
+ }
+ }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/count-the-number-of-houses-at-a-certain-distance-ii.json b/leetcode-cn/originData/count-the-number-of-houses-at-a-certain-distance-ii.json
new file mode 100644
index 00000000..d4014c5a
--- /dev/null
+++ b/leetcode-cn/originData/count-the-number-of-houses-at-a-certain-distance-ii.json
@@ -0,0 +1,185 @@
+{
+ "data": {
+ "question": {
+ "questionId": "3310",
+ "questionFrontendId": "3017",
+ "categoryTitle": "Algorithms",
+ "boundTopicId": 2611693,
+ "title": "Count the Number of Houses at a Certain Distance II",
+ "titleSlug": "count-the-number-of-houses-at-a-certain-distance-ii",
+ "content": "
You are given three positive integers n, x, and y.
\n\nIn a city, there exist houses numbered 1 to n connected by n streets. There is a street connecting the house numbered i with the house numbered i + 1 for all 1 <= i <= n - 1 . An additional street connects the house numbered x with the house numbered y.
\n\nFor each k, such that 1 <= k <= n, you need to find the number of pairs of houses (house1, house2) such that the minimum number of streets that need to be traveled to reach house2 from house1 is k.
\n\nReturn a 1-indexed array result of length n where result[k] represents the total number of pairs of houses such that the minimum streets required to reach one house from the other is k.
\n\nNote that x and y can be equal.
\n\n
\nExample 1:
\n\n\nInput: n = 3, x = 1, y = 3\nOutput: [6,0,0]\nExplanation: Let's look at each pair of houses:\n- For the pair (1, 2), we can go from house 1 to house 2 directly.\n- For the pair (2, 1), we can go from house 2 to house 1 directly.\n- For the pair (1, 3), we can go from house 1 to house 3 directly.\n- For the pair (3, 1), we can go from house 3 to house 1 directly.\n- For the pair (2, 3), we can go from house 2 to house 3 directly.\n- For the pair (3, 2), we can go from house 3 to house 2 directly.\n
\n\nExample 2:
\n\n\nInput: n = 5, x = 2, y = 4\nOutput: [10,8,2,0,0]\nExplanation: For each distance k the pairs are:\n- For k == 1, the pairs are (1, 2), (2, 1), (2, 3), (3, 2), (2, 4), (4, 2), (3, 4), (4, 3), (4, 5), and (5, 4).\n- For k == 2, the pairs are (1, 3), (3, 1), (1, 4), (4, 1), (2, 5), (5, 2), (3, 5), and (5, 3).\n- For k == 3, the pairs are (1, 5), and (5, 1).\n- For k == 4 and k == 5, there are no pairs.\n
\n\nExample 3:
\n\n\nInput: n = 4, x = 1, y = 1\nOutput: [6,4,2,0]\nExplanation: For each distance k the pairs are:\n- For k == 1, the pairs are (1, 2), (2, 1), (2, 3), (3, 2), (3, 4), and (4, 3).\n- For k == 2, the pairs are (1, 3), (3, 1), (2, 4), and (4, 2).\n- For k == 3, the pairs are (1, 4), and (4, 1).\n- For k == 4, there are no pairs.\n
\n\n
\nConstraints:
\n\n\n\t2 <= n <= 1051 <= x, y <= n
\n",
+ "translatedTitle": "按距离统计房屋对数目 II",
+ "translatedContent": "给你三个 正整数 n 、x 和 y 。
\n\n在城市中，存在编号从 1 到 n 的房屋，由 n 条街道相连。对所有 1 <= i < n ，都存在一条街道连接编号为 i 的房屋与编号为 i + 1 的房屋。另存在一条街道连接编号为 x 的房屋与编号为 y 的房屋。
\n\n对于每个 k（1 <= k <= n），你需要找出所有满足要求的 房屋对 [house1, house2] ，即从 house1 到 house2 需要经过的 最少 街道数为 k 。
\n\n返回一个下标从 1 开始且长度为 n 的数组 result ，其中 result[k] 表示所有满足要求的房屋对的数量，即从一个房屋到另一个房屋需要经过的 最少 街道数为 k 。
\n\n注意，x 与 y 可以 相等 。
\n\n
\n\n示例 1：
\n\n\n输入：n = 3, x = 1, y = 3\n输出：[6,0,0]\n解释：让我们检视每个房屋对\n- 对于房屋对 (1, 2)，可以直接从房屋 1 到房屋 2。\n- 对于房屋对 (2, 1)，可以直接从房屋 2 到房屋 1。\n- 对于房屋对 (1, 3)，可以直接从房屋 1 到房屋 3。\n- 对于房屋对 (3, 1)，可以直接从房屋 3 到房屋 1。\n- 对于房屋对 (2, 3)，可以直接从房屋 2 到房屋 3。\n- 对于房屋对 (3, 2)，可以直接从房屋 3 到房屋 2。\n
\n\n示例 2：
\n\n\n输入：n = 5, x = 2, y = 4\n输出：[10,8,2,0,0]\n解释：对于每个距离 k ，满足要求的房屋对如下：\n- 对于 k == 1，满足要求的房屋对有 (1, 2), (2, 1), (2, 3), (3, 2), (2, 4), (4, 2), (3, 4), (4, 3), (4, 5), 以及 (5, 4)。\n- 对于 k == 2，满足要求的房屋对有 (1, 3), (3, 1), (1, 4), (4, 1), (2, 5), (5, 2), (3, 5), 以及 (5, 3)。\n- 对于 k == 3，满足要求的房屋对有 (1, 5)，以及 (5, 1) 。\n- 对于 k == 4 和 k == 5，不存在满足要求的房屋对。\n
\n\n示例 3：
\n\n\n输入：n = 4, x = 1, y = 1\n输出：[6,4,2,0]\n解释：对于每个距离 k ，满足要求的房屋对如下：\n- 对于 k == 1，满足要求的房屋对有 (1, 2), (2, 1), (2, 3), (3, 2), (3, 4), 以及 (4, 3)。\n- 对于 k == 2，满足要求的房屋对有 (1, 3), (3, 1), (2, 4), 以及 (4, 2)。\n- 对于 k == 3，满足要求的房屋对有 (1, 4), 以及 (4, 1)。\n- 对于 k == 4，不存在满足要求的房屋对。\n
\n\n
\n\n提示：
\n\n\n\t2 <= n <= 1051 <= x, y <= n
\n",
+ "isPaidOnly": false,
+ "difficulty": "Hard",
+ "likes": 8,
+ "dislikes": 0,
+ "isLiked": null,
+ "similarQuestions": "[]",
+ "contributors": [],
+ "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+ "topicTags": [
+ {
+ "name": "Breadth-First Search",
+ "slug": "breadth-first-search",
+ "translatedName": "广度优先搜索",
+ "__typename": "TopicTagNode"
+ },
+ {
+ "name": "Graph",
+ "slug": "graph",
+ "translatedName": "图",
+ "__typename": "TopicTagNode"
+ },
+ {
+ "name": "Prefix Sum",
+ "slug": "prefix-sum",
+ "translatedName": "前缀和",
+ "__typename": "TopicTagNode"
+ }
+ ],
+ "companyTagStats": null,
+ "codeSnippets": [
+ {
+ "lang": "C++",
+ "langSlug": "cpp",
+ "code": "class Solution {\npublic:\n vector countOfPairs(int n, int x, int y) {\n \n }\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Java",
+ "langSlug": "java",
+ "code": "class Solution {\n public long[] countOfPairs(int n, int x, int y) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python",
+ "langSlug": "python",
+ "code": "class Solution(object):\n def countOfPairs(self, n, x, y):\n \"\"\"\n :type n: int\n :type x: int\n :type y: int\n :rtype: List[int]\n \"\"\"",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python3",
+ "langSlug": "python3",
+ "code": "class Solution:\n def countOfPairs(self, n: int, x: int, y: int) -> List[int]:",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C",
+ "langSlug": "c",
+ "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nlong long* countOfPairs(int n, int x, int y, int* returnSize) {\n \n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C#",
+ "langSlug": "csharp",
+ "code": "public class Solution {\n public long[] CountOfPairs(int n, int x, int y) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "JavaScript",
+ "langSlug": "javascript",
+ "code": "/**\n * @param {number} n\n * @param {number} x\n * @param {number} y\n * @return {number[]}\n */\nvar countOfPairs = function(n, x, y) {\n\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "TypeScript",
+ "langSlug": "typescript",
+ "code": "function countOfPairs(n: number, x: number, y: number): number[] {\n \n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "PHP",
+ "langSlug": "php",
+ "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $x\n * @param Integer $y\n * @return Integer[]\n */\n function countOfPairs($n, $x, $y) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Swift",
+ "langSlug": "swift",
+ "code": "class Solution {\n func countOfPairs(_ n: Int, _ x: Int, _ y: Int) -> [Int] {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Kotlin",
+ "langSlug": "kotlin",
+ "code": "class Solution {\n fun countOfPairs(n: Int, x: Int, y: Int): LongArray {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Dart",
+ "langSlug": "dart",
+ "code": "class Solution {\n List countOfPairs(int n, int x, int y) {\n \n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Go",
+ "langSlug": "golang",
+ "code": "func countOfPairs(n int, x int, y int) []int64 {\n\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Ruby",
+ "langSlug": "ruby",
+ "code": "# @param {Integer} n\n# @param {Integer} x\n# @param {Integer} y\n# @return {Integer[]}\ndef count_of_pairs(n, x, y)\n\nend",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Scala",
+ "langSlug": "scala",
+ "code": "object Solution {\n def countOfPairs(n: Int, x: Int, y: Int): Array[Long] = {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Rust",
+ "langSlug": "rust",
+ "code": "impl Solution {\n pub fn count_of_pairs(n: i32, x: i32, y: i32) -> Vec {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Racket",
+ "langSlug": "racket",
+ "code": "(define/contract (count-of-pairs n x y)\n (-> exact-integer? exact-integer? exact-integer? (listof exact-integer?))\n )",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Erlang",
+ "langSlug": "erlang",
+ "code": "-spec count_of_pairs(N :: integer(), X :: integer(), Y :: integer()) -> [integer()].\ncount_of_pairs(N, X, Y) ->\n .",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Elixir",
+ "langSlug": "elixir",
+ "code": "defmodule Solution do\n @spec count_of_pairs(n :: integer, x :: integer, y :: integer) :: [integer]\n def count_of_pairs(n, x, y) do\n \n end\nend",
+ "__typename": "CodeSnippetNode"
+ }
+ ],
+ "stats": "{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"4.2K\", \"totalAcceptedRaw\": 1235, \"totalSubmissionRaw\": 4216, \"acRate\": \"29.3%\"}",
+ "hints": [
+ "If there were no additional street connecting house x to house y, there would be 2 * (n - i) pairs of houses at distance i.",
+ "The shortest distance between house i and house j (j < i) is along one of these paths:\r\n- i -> j\r\n- i -> y---x -> j",
+ "Try to change the distances calculated by path i ->j to the other path.",
+ "Can we use prefix sums to compute the answer?"
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "3\n1\n3",
+ "metaData": "{\n \"name\": \"countOfPairs\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"x\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"y\"\n }\n ],\n \"return\": {\n \"type\": \"long[]\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "envInfo": "{\"cpp\":[\"C++\",\"\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n\\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\\n2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n\\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\\n3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\nlodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"\\u7248\\u672c\\uff1aScala 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\nWith bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+ "book": null,
+ "isSubscribed": false,
+ "isDailyQuestion": false,
+ "dailyRecordStatus": null,
+ "editorType": "CKEDITOR",
+ "ugcQuestionId": null,
+ "style": "LEETCODE",
+ "exampleTestcases": "3\n1\n3\n5\n2\n4\n4\n1\n1",
+ "__typename": "QuestionNode"
+ }
+ }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/divide-an-array-into-subarrays-with-minimum-cost-i.json b/leetcode-cn/originData/divide-an-array-into-subarrays-with-minimum-cost-i.json
new file mode 100644
index 00000000..d89722d1
--- /dev/null
+++ b/leetcode-cn/originData/divide-an-array-into-subarrays-with-minimum-cost-i.json
@@ -0,0 +1,180 @@
+{
+ "data": {
+ "question": {
+ "questionId": "3263",
+ "questionFrontendId": "3010",
+ "categoryTitle": "Algorithms",
+ "boundTopicId": 2611705,
+ "title": "Divide an Array Into Subarrays With Minimum Cost I",
+ "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-i",
+ "content": "
You are given an array of integers nums of length n.
\n\nThe cost of an array is the value of its first element. For example, the cost of [1,2,3] is 1 while the cost of [3,4,1] is 3.
\n\nYou need to divide nums into 3 disjoint contiguous subarrays.
\n\nReturn the minimum possible sum of the cost of these subarrays.
\n\n
\nExample 1:
\n\n\nInput: nums = [1,2,3,12]\nOutput: 6\nExplanation: The best possible way to form 3 subarrays is: [1], [2], and [3,12] at a total cost of 1 + 2 + 3 = 6.\nThe other possible ways to form 3 subarrays are:\n- [1], [2,3], and [12] at a total cost of 1 + 2 + 12 = 15.\n- [1,2], [3], and [12] at a total cost of 1 + 3 + 12 = 16.\n
\n\nExample 2:
\n\n\nInput: nums = [5,4,3]\nOutput: 12\nExplanation: The best possible way to form 3 subarrays is: [5], [4], and [3] at a total cost of 5 + 4 + 3 = 12.\nIt can be shown that 12 is the minimum cost achievable.\n
\n\nExample 3:
\n\n\nInput: nums = [10,3,1,1]\nOutput: 12\nExplanation: The best possible way to form 3 subarrays is: [10,3], [1], and [1] at a total cost of 10 + 1 + 1 = 12.\nIt can be shown that 12 is the minimum cost achievable.\n
\n\n
\nConstraints:
\n\n\n\t3 <= n <= 501 <= nums[i] <= 50
\n",
+ "translatedTitle": "将数组分成最小总代价的子数组 I",
+ "translatedContent": "给你一个长度为 n 的整数数组 nums 。
\n\n一个数组的 代价 是它的 第一个 元素。比方说，[1,2,3] 的代价是 1 ，[3,4,1] 的代价是 3 。
\n\n你需要将 nums 分成 3 个 连续且没有交集 的子数组。
\n\n请你返回这些子数组的 最小 代价 总和 。
\n\n
\n\n示例 1：
\n\n\n输入：nums = [1,2,3,12]\n输出：6\n解释：最佳分割成 3 个子数组的方案是：[1] ，[2] 和 [3,12] ，总代价为 1 + 2 + 3 = 6 。\n其他得到 3 个子数组的方案是：\n- [1] ，[2,3] 和 [12] ，总代价是 1 + 2 + 12 = 15 。\n- [1,2] ，[3] 和 [12] ，总代价是 1 + 3 + 12 = 16 。\n
\n\n示例 2：
\n\n\n输入：nums = [5,4,3]\n输出：12\n解释：最佳分割成 3 个子数组的方案是：[5] ，[4] 和 [3] ，总代价为 5 + 4 + 3 = 12 。\n12 是所有分割方案里的最小总代价。\n
\n\n示例 3：
\n\n\n输入：nums = [10,3,1,1]\n输出：12\n解释：最佳分割成 3 个子数组的方案是：[10,3] ，[1] 和 [1] ，总代价为 10 + 1 + 1 = 12 。\n12 是所有分割方案里的最小总代价。\n
\n\n
\n\n提示：
\n\n\n\t3 <= n <= 501 <= nums[i] <= 50
\n",
+ "isPaidOnly": false,
+ "difficulty": "Easy",
+ "likes": 2,
+ "dislikes": 0,
+ "isLiked": null,
+ "similarQuestions": "[]",
+ "contributors": [],
+ "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+ "topicTags": [
+ {
+ "name": "Array",
+ "slug": "array",
+ "translatedName": "数组",
+ "__typename": "TopicTagNode"
+ },
+ {
+ "name": "Enumeration",
+ "slug": "enumeration",
+ "translatedName": "枚举",
+ "__typename": "TopicTagNode"
+ },
+ {
+ "name": "Sorting",
+ "slug": "sorting",
+ "translatedName": "排序",
+ "__typename": "TopicTagNode"
+ }
+ ],
+ "companyTagStats": null,
+ "codeSnippets": [
+ {
+ "lang": "C++",
+ "langSlug": "cpp",
+ "code": "class Solution {\npublic:\n int minimumCost(vector& nums) {\n \n }\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Java",
+ "langSlug": "java",
+ "code": "class Solution {\n public int minimumCost(int[] nums) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python",
+ "langSlug": "python",
+ "code": "class Solution(object):\n def minimumCost(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python3",
+ "langSlug": "python3",
+ "code": "class Solution:\n def minimumCost(self, nums: List[int]) -> int:",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C",
+ "langSlug": "c",
+ "code": "int minimumCost(int* nums, int numsSize) {\n \n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C#",
+ "langSlug": "csharp",
+ "code": "public class Solution {\n public int MinimumCost(int[] nums) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "JavaScript",
+ "langSlug": "javascript",
+ "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar minimumCost = function(nums) {\n\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "TypeScript",
+ "langSlug": "typescript",
+ "code": "function minimumCost(nums: number[]): number {\n \n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "PHP",
+ "langSlug": "php",
+ "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @return Integer\n */\n function minimumCost($nums) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Swift",
+ "langSlug": "swift",
+ "code": "class Solution {\n func minimumCost(_ nums: [Int]) -> Int {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Kotlin",
+ "langSlug": "kotlin",
+ "code": "class Solution {\n fun minimumCost(nums: IntArray): Int {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Dart",
+ "langSlug": "dart",
+ "code": "class Solution {\n int minimumCost(List nums) {\n \n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Go",
+ "langSlug": "golang",
+ "code": "func minimumCost(nums []int) int {\n\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Ruby",
+ "langSlug": "ruby",
+ "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef minimum_cost(nums)\n \nend",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Scala",
+ "langSlug": "scala",
+ "code": "object Solution {\n def minimumCost(nums: Array[Int]): Int = {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Rust",
+ "langSlug": "rust",
+ "code": "impl Solution {\n pub fn minimum_cost(nums: Vec) -> i32 {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Racket",
+ "langSlug": "racket",
+ "code": "(define/contract (minimum-cost nums)\n (-> (listof exact-integer?) exact-integer?)\n )",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Erlang",
+ "langSlug": "erlang",
+ "code": "-spec minimum_cost(Nums :: [integer()]) -> integer().\nminimum_cost(Nums) ->\n .",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Elixir",
+ "langSlug": "elixir",
+ "code": "defmodule Solution do\n @spec minimum_cost(nums :: [integer]) :: integer\n def minimum_cost(nums) do\n \n end\nend",
+ "__typename": "CodeSnippetNode"
+ }
+ ],
+ "stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"3.9K\", \"totalAcceptedRaw\": 2817, \"totalSubmissionRaw\": 3913, \"acRate\": \"72.0%\"}",
+ "hints": [],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,2,3,12]",
+ "metaData": "{\n \"name\": \"minimumCost\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "envInfo": "{\"cpp\":[\"C++\",\"\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n