clang 11<\\/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": "2\n5\n5\n7",
+ "__typename": "QuestionNode"
+ }
+ }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/[no content]symmetric-coordinates.json b/leetcode-cn/originData/[no content]symmetric-coordinates.json
new file mode 100644
index 00000000..870b0e21
--- /dev/null
+++ b/leetcode-cn/originData/[no content]symmetric-coordinates.json
@@ -0,0 +1,55 @@
+{
+ "data": {
+ "question": {
+ "questionId": "3253",
+ "questionFrontendId": "2978",
+ "categoryTitle": "Database",
+ "boundTopicId": 2579780,
+ "title": "Symmetric Coordinates",
+ "titleSlug": "symmetric-coordinates",
+ "content": null,
+ "translatedTitle": null,
+ "translatedContent": null,
+ "isPaidOnly": true,
+ "difficulty": "Medium",
+ "likes": 0,
+ "dislikes": 0,
+ "isLiked": null,
+ "similarQuestions": "[]",
+ "contributors": [],
+ "langToValidPlayground": null,
+ "topicTags": [],
+ "companyTagStats": null,
+ "codeSnippets": null,
+ "stats": "{\"totalAccepted\": \"20\", \"totalSubmission\": \"32\", \"totalAcceptedRaw\": 20, \"totalSubmissionRaw\": 32, \"acRate\": \"62.5%\"}",
+ "hints": [],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "{\"headers\":{\"Coordinates\":[\"X\",\"Y\"]},\"rows\":{\"Coordinates\":[[20,20],[20,20],[20,21],[23,22],[22,23],[21,20]]}}",
+ "metaData": "{\"mysql\":[\"Create table If Not Exists Coordinates (X int, Y int)\"],\"mssql\":[\"Create table Coordinates (X int,Y int)\"],\"oraclesql\":[\"Create table Coordinates (X int,Y int)\"],\"database\":true,\"name\":\"symmetric_pairs\",\"pythondata\":[\"Coordinates = pd.DataFrame([], columns=['X', 'Y']).astype({'X':'Int64', 'Y':'Int64'})\"],\"postgresql\":[\"Create table If Not Exists Coordinates (X int, Y int)\"],\"database_schema\":{\"Coordinates\":{\"X\":\"INT\",\"Y\":\"INT\"}}}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [
+ "Create table If Not Exists Coordinates (X int, Y int)",
+ "Truncate table Coordinates",
+ "insert into Coordinates (X, Y) values ('20', '20')",
+ "insert into Coordinates (X, Y) values ('20', '20')",
+ "insert into Coordinates (X, Y) values ('20', '21')",
+ "insert into Coordinates (X, Y) values ('23', '22')",
+ "insert into Coordinates (X, Y) values ('22', '23')",
+ "insert into Coordinates (X, Y) values ('21', '20')"
+ ],
+ "enableRunCode": true,
+ "envInfo": "{\"mysql\":[\"MySQL\",\"
\\u7248\\u672c\\uff1aMySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\"
Oracle Sql 11.2.<\\/p>\"],\"pythondata\":[\"Pandas\",\"
Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0<\\/p>\"],\"postgresql\":[\"PostgreSQL\",\"
PostgreSQL 16<\\/p>\"]}",
+ "book": null,
+ "isSubscribed": false,
+ "isDailyQuestion": false,
+ "dailyRecordStatus": null,
+ "editorType": "CKEDITOR",
+ "ugcQuestionId": null,
+ "style": "LEETCODE",
+ "exampleTestcases": "{\"headers\":{\"Coordinates\":[\"X\",\"Y\"]},\"rows\":{\"Coordinates\":[[20,20],[20,20],[20,21],[23,22],[22,23],[21,20]]}}",
+ "__typename": "QuestionNode"
+ }
+ }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/count-the-number-of-incremovable-subarrays-i.json b/leetcode-cn/originData/count-the-number-of-incremovable-subarrays-i.json
new file mode 100644
index 00000000..a2f7e74c
--- /dev/null
+++ b/leetcode-cn/originData/count-the-number-of-incremovable-subarrays-i.json
@@ -0,0 +1,163 @@
+{
+ "data": {
+ "question": {
+ "questionId": "3252",
+ "questionFrontendId": "2970",
+ "categoryTitle": "Algorithms",
+ "boundTopicId": 2575513,
+ "title": "Count the Number of Incremovable Subarrays I",
+ "titleSlug": "count-the-number-of-incremovable-subarrays-i",
+ "content": "
You are given a 0-indexed array of positive integers nums.
\n\nA subarray of nums is called incremovable if nums becomes strictly increasing on removing the subarray. For example, the subarray [3, 4] is an incremovable subarray of [5, 3, 4, 6, 7] because removing this subarray changes the array [5, 3, 4, 6, 7] to [5, 6, 7] which is strictly increasing.
\n\nReturn the total number of incremovable subarrays of nums.
\n\nNote that an empty array is considered strictly increasing.
\n\nA subarray is a contiguous non-empty sequence of elements within an array.
\n\n
\nExample 1:
\n\n\nInput: nums = [1,2,3,4]\nOutput: 10\nExplanation: The 10 incremovable subarrays are: [1], [2], [3], [4], [1,2], [2,3], [3,4], [1,2,3], [2,3,4], and [1,2,3,4], because on removing any one of these subarrays nums becomes strictly increasing. Note that you cannot select an empty subarray.\n
\n\nExample 2:
\n\n\nInput: nums = [6,5,7,8]\nOutput: 7\nExplanation: The 7 incremovable subarrays are: [5], [6], [5,7], [6,5], [5,7,8], [6,5,7] and [6,5,7,8].\nIt can be shown that there are only 7 incremovable subarrays in nums.\n
\n\nExample 3:
\n\n\nInput: nums = [8,7,6,6]\nOutput: 3\nExplanation: The 3 incremovable subarrays are: [8,7,6], [7,6,6], and [8,7,6,6]. Note that [8,7] is not an incremovable subarray because after removing [8,7] nums becomes [6,6], which is sorted in ascending order but not strictly increasing.\n
\n\n
\nConstraints:
\n\n\n\t1 <= nums.length <= 501 <= nums[i] <= 50
\n",
+ "translatedTitle": "统计移除递增子数组的数目 I",
+ "translatedContent": "给你一个下标从 0 开始的 正 整数数组 nums 。
\n\n如果 nums 的一个子数组满足：移除这个子数组后剩余元素 严格递增 ，那么我们称这个子数组为 移除递增 子数组。比方说，[5, 3, 4, 6, 7] 中的 [3, 4] 是一个移除递增子数组，因为移除该子数组后，[5, 3, 4, 6, 7] 变为 [5, 6, 7] ，是严格递增的。
\n\n请你返回 nums 中 移除递增 子数组的总数目。
\n\n注意 ，剩余元素为空的数组也视为是递增的。
\n\n子数组 指的是一个数组中一段连续的元素序列。
\n\n
\n\n示例 1：
\n\n\n输入：nums = [1,2,3,4]\n输出：10\n解释：10 个移除递增子数组分别为：[1], [2], [3], [4], [1,2], [2,3], [3,4], [1,2,3], [2,3,4] 和 [1,2,3,4]。移除任意一个子数组后，剩余元素都是递增的。注意，空数组不是移除递增子数组。\n
\n\n示例 2：
\n\n\n输入：nums = [6,5,7,8]\n输出：7\n解释：7 个移除递增子数组分别为：[5], [6], [5,7], [6,5], [5,7,8], [6,5,7] 和 [6,5,7,8] 。\nnums 中只有这 7 个移除递增子数组。\n
\n\n示例 3：
\n\n\n输入：nums = [8,7,6,6]\n输出：3\n解释：3 个移除递增子数组分别为：[8,7,6], [7,6,6] 和 [8,7,6,6] 。注意 [8,7] 不是移除递增子数组因为移除 [8,7] 后 nums 变为 [6,6] ，它不是严格递增的。\n
\n\n
\n\n提示：
\n\n\n\t1 <= nums.length <= 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": [],
+ "companyTagStats": null,
+ "codeSnippets": [
+ {
+ "lang": "C++",
+ "langSlug": "cpp",
+ "code": "class Solution {\npublic:\n int incremovableSubarrayCount(vector& nums) {\n \n }\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Java",
+ "langSlug": "java",
+ "code": "class Solution {\n public int incremovableSubarrayCount(int[] nums) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python",
+ "langSlug": "python",
+ "code": "class Solution(object):\n def incremovableSubarrayCount(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python3",
+ "langSlug": "python3",
+ "code": "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C",
+ "langSlug": "c",
+ "code": "int incremovableSubarrayCount(int* nums, int numsSize) {\n \n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C#",
+ "langSlug": "csharp",
+ "code": "public class Solution {\n public int IncremovableSubarrayCount(int[] nums) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "JavaScript",
+ "langSlug": "javascript",
+ "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar incremovableSubarrayCount = function(nums) {\n\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "TypeScript",
+ "langSlug": "typescript",
+ "code": "function incremovableSubarrayCount(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 incremovableSubarrayCount($nums) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Swift",
+ "langSlug": "swift",
+ "code": "class Solution {\n func incremovableSubarrayCount(_ nums: [Int]) -> Int {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Kotlin",
+ "langSlug": "kotlin",
+ "code": "class Solution {\n fun incremovableSubarrayCount(nums: IntArray): Int {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Dart",
+ "langSlug": "dart",
+ "code": "class Solution {\n int incremovableSubarrayCount(List nums) {\n \n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Go",
+ "langSlug": "golang",
+ "code": "func incremovableSubarrayCount(nums []int) int {\n\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Ruby",
+ "langSlug": "ruby",
+ "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef incremovable_subarray_count(nums)\n\nend",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Scala",
+ "langSlug": "scala",
+ "code": "object Solution {\n def incremovableSubarrayCount(nums: Array[Int]): Int = {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Rust",
+ "langSlug": "rust",
+ "code": "impl Solution {\n pub fn incremovable_subarray_count(nums: Vec) -> i32 {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Racket",
+ "langSlug": "racket",
+ "code": "(define/contract (incremovable-subarray-count nums)\n (-> (listof exact-integer?) exact-integer?)\n )",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Erlang",
+ "langSlug": "erlang",
+ "code": "-spec incremovable_subarray_count(Nums :: [integer()]) -> integer().\nincremovable_subarray_count(Nums) ->\n .",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Elixir",
+ "langSlug": "elixir",
+ "code": "defmodule Solution do\n @spec incremovable_subarray_count(nums :: [integer]) :: integer\n def incremovable_subarray_count(nums) do\n \n end\nend",
+ "__typename": "CodeSnippetNode"
+ }
+ ],
+ "stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"3.5K\", \"totalAcceptedRaw\": 2047, \"totalSubmissionRaw\": 3490, \"acRate\": \"58.7%\"}",
+ "hints": [
+ "Use two loops to check all the subarrays."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,2,3,4]",
+ "metaData": "{\n \"name\": \"incremovableSubarrayCount\",\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 11<\\/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]\n[6,5,7,8]\n[8,7,6,6]",
+ "__typename": "QuestionNode"
+ }
+ }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/count-the-number-of-incremovable-subarrays-ii.json b/leetcode-cn/originData/count-the-number-of-incremovable-subarrays-ii.json
new file mode 100644
index 00000000..3eb4a3ae
--- /dev/null
+++ b/leetcode-cn/originData/count-the-number-of-incremovable-subarrays-ii.json
@@ -0,0 +1,167 @@
+{
+ "data": {
+ "question": {
+ "questionId": "3248",
+ "questionFrontendId": "2972",
+ "categoryTitle": "Algorithms",
+ "boundTopicId": 2575514,
+ "title": "Count the Number of Incremovable Subarrays II",
+ "titleSlug": "count-the-number-of-incremovable-subarrays-ii",
+ "content": "
You are given a 0-indexed array of positive integers nums.
\n\nA subarray of nums is called incremovable if nums becomes strictly increasing on removing the subarray. For example, the subarray [3, 4] is an incremovable subarray of [5, 3, 4, 6, 7] because removing this subarray changes the array [5, 3, 4, 6, 7] to [5, 6, 7] which is strictly increasing.
\n\nReturn the total number of incremovable subarrays of nums.
\n\nNote that an empty array is considered strictly increasing.
\n\nA subarray is a contiguous non-empty sequence of elements within an array.
\n\n
\nExample 1:
\n\n\nInput: nums = [1,2,3,4]\nOutput: 10\nExplanation: The 10 incremovable subarrays are: [1], [2], [3], [4], [1,2], [2,3], [3,4], [1,2,3], [2,3,4], and [1,2,3,4], because on removing any one of these subarrays nums becomes strictly increasing. Note that you cannot select an empty subarray.\n
\n\nExample 2:
\n\n\nInput: nums = [6,5,7,8]\nOutput: 7\nExplanation: The 7 incremovable subarrays are: [5], [6], [5,7], [6,5], [5,7,8], [6,5,7] and [6,5,7,8].\nIt can be shown that there are only 7 incremovable subarrays in nums.\n
\n\nExample 3:
\n\n\nInput: nums = [8,7,6,6]\nOutput: 3\nExplanation: The 3 incremovable subarrays are: [8,7,6], [7,6,6], and [8,7,6,6]. Note that [8,7] is not an incremovable subarray because after removing [8,7] nums becomes [6,6], which is sorted in ascending order but not strictly increasing.\n
\n\n
\nConstraints:
\n\n\n\t1 <= nums.length <= 1051 <= nums[i] <= 109
\n",
+ "translatedTitle": "统计移除递增子数组的数目 II",
+ "translatedContent": "给你一个下标从 0 开始的 正 整数数组 nums 。
\n\n如果 nums 的一个子数组满足：移除这个子数组后剩余元素 严格递增 ，那么我们称这个子数组为 移除递增 子数组。比方说，[5, 3, 4, 6, 7] 中的 [3, 4] 是一个移除递增子数组，因为移除该子数组后，[5, 3, 4, 6, 7] 变为 [5, 6, 7] ，是严格递增的。
\n\n请你返回 nums 中 移除递增 子数组的总数目。
\n\n注意 ，剩余元素为空的数组也视为是递增的。
\n\n子数组 指的是一个数组中一段连续的元素序列。
\n\n
\n\n示例 1：
\n\n\n输入：nums = [1,2,3,4]\n输出：10\n解释：10 个移除递增子数组分别为：[1], [2], [3], [4], [1,2], [2,3], [3,4], [1,2,3], [2,3,4] 和 [1,2,3,4]。移除任意一个子数组后，剩余元素都是递增的。注意，空数组不是移除递增子数组。\n
\n\n示例 2：
\n\n\n输入：nums = [6,5,7,8]\n输出：7\n解释：7 个移除递增子数组分别为：[5], [6], [5,7], [6,5], [5,7,8], [6,5,7] 和 [6,5,7,8] 。\nnums 中只有这 7 个移除递增子数组。\n
\n\n示例 3：
\n\n\n输入：nums = [8,7,6,6]\n输出：3\n解释：3 个移除递增子数组分别为：[8,7,6], [7,6,6] 和 [8,7,6,6] 。注意 [8,7] 不是移除递增子数组因为移除 [8,7] 后 nums 变为 [6,6] ，它不是严格递增的。\n
\n\n
\n\n提示：
\n\n\n\t1 <= nums.length <= 1051 <= nums[i] <= 109
\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": [],
+ "companyTagStats": null,
+ "codeSnippets": [
+ {
+ "lang": "C++",
+ "langSlug": "cpp",
+ "code": "class Solution {\npublic:\n long long incremovableSubarrayCount(vector& nums) {\n \n }\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Java",
+ "langSlug": "java",
+ "code": "class Solution {\n public long incremovableSubarrayCount(int[] nums) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python",
+ "langSlug": "python",
+ "code": "class Solution(object):\n def incremovableSubarrayCount(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python3",
+ "langSlug": "python3",
+ "code": "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C",
+ "langSlug": "c",
+ "code": "long long incremovableSubarrayCount(int* nums, int numsSize) {\n \n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C#",
+ "langSlug": "csharp",
+ "code": "public class Solution {\n public long IncremovableSubarrayCount(int[] nums) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "JavaScript",
+ "langSlug": "javascript",
+ "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar incremovableSubarrayCount = function(nums) {\n\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "TypeScript",
+ "langSlug": "typescript",
+ "code": "function incremovableSubarrayCount(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 incremovableSubarrayCount($nums) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Swift",
+ "langSlug": "swift",
+ "code": "class Solution {\n func incremovableSubarrayCount(_ nums: [Int]) -> Int {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Kotlin",
+ "langSlug": "kotlin",
+ "code": "class Solution {\n fun incremovableSubarrayCount(nums: IntArray): Long {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Dart",
+ "langSlug": "dart",
+ "code": "class Solution {\n int incremovableSubarrayCount(List nums) {\n \n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Go",
+ "langSlug": "golang",
+ "code": "func incremovableSubarrayCount(nums []int) int64 {\n\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Ruby",
+ "langSlug": "ruby",
+ "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef incremovable_subarray_count(nums)\n\nend",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Scala",
+ "langSlug": "scala",
+ "code": "object Solution {\n def incremovableSubarrayCount(nums: Array[Int]): Long = {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Rust",
+ "langSlug": "rust",
+ "code": "impl Solution {\n pub fn incremovable_subarray_count(nums: Vec) -> i64 {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Racket",
+ "langSlug": "racket",
+ "code": "(define/contract (incremovable-subarray-count nums)\n (-> (listof exact-integer?) exact-integer?)\n )",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Erlang",
+ "langSlug": "erlang",
+ "code": "-spec incremovable_subarray_count(Nums :: [integer()]) -> integer().\nincremovable_subarray_count(Nums) ->\n .",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Elixir",
+ "langSlug": "elixir",
+ "code": "defmodule Solution do\n @spec incremovable_subarray_count(nums :: [integer]) :: integer\n def incremovable_subarray_count(nums) do\n \n end\nend",
+ "__typename": "CodeSnippetNode"
+ }
+ ],
+ "stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 1684, \"totalSubmissionRaw\": 3299, \"acRate\": \"51.0%\"}",
+ "hints": [
+ "Calculate the largest x such that nums[0..x] is strictly increasing.",
+ "Calculate the smallest y such that nums[y..nums.length-1] is strictly increasing.",
+ "For each i in [0, x], select the smallest j in [y, nums.length - 1]. Then we can keep the prefix with any suffix of [j, nums.length - 1] (including the empty one).",
+ "Note that when i increases, j won’t decrease. Use two-pointers.",
+ "Note that we cannot delete an empty array, but we can delete the whole array."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[1,2,3,4]",
+ "metaData": "{\n \"name\": \"incremovableSubarrayCount\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "envInfo": "{\"cpp\":[\"C++\",\"\\u7248\\u672c\\uff1aclang 11<\\/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]\n[6,5,7,8]\n[8,7,6,6]",
+ "__typename": "QuestionNode"
+ }
+ }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-number-of-coins-to-place-in-tree-nodes.json b/leetcode-cn/originData/find-number-of-coins-to-place-in-tree-nodes.json
new file mode 100644
index 00000000..50cc8ae6
--- /dev/null
+++ b/leetcode-cn/originData/find-number-of-coins-to-place-in-tree-nodes.json
@@ -0,0 +1,166 @@
+{
+ "data": {
+ "question": {
+ "questionId": "3218",
+ "questionFrontendId": "2973",
+ "categoryTitle": "Algorithms",
+ "boundTopicId": 2575542,
+ "title": "Find Number of Coins to Place in Tree Nodes",
+ "titleSlug": "find-number-of-coins-to-place-in-tree-nodes",
+ "content": "
You are given an undirected tree with n nodes labeled from 0 to n - 1, and rooted at node 0. You are given a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.
\n\nYou are also given a 0-indexed integer array cost of length n, where cost[i] is the cost assigned to the ith node.
\n\nYou need to place some coins on every node of the tree. The number of coins to be placed at node i can be calculated as:
\n\n\n\t- If size of the subtree of node
i is less than 3, place 1 coin. \n\t- Otherwise, place an amount of coins equal to the maximum product of cost values assigned to
3 distinct nodes in the subtree of node i. If this product is negative, place 0 coins. \n
\n\nReturn an array coin of size n such that coin[i] is the number of coins placed at node i.
\n\n
\nExample 1:
\n![\"\"](\"https://assets.leetcode.com/uploads/2023/11/09/screenshot-2023-11-10-012641.png\")
\n\nInput: edges = [[0,1],[0,2],[0,3],[0,4],[0,5]], cost = [1,2,3,4,5,6]\nOutput: [120,1,1,1,1,1]\nExplanation: For node 0 place 6 * 5 * 4 = 120 coins. All other nodes are leaves with subtree of size 1, place 1 coin on each of them.\n
\n\nExample 2:
\n![\"\"](\"https://assets.leetcode.com/uploads/2023/11/09/screenshot-2023-11-10-012614.png\")
\n\nInput: edges = [[0,1],[0,2],[1,3],[1,4],[1,5],[2,6],[2,7],[2,8]], cost = [1,4,2,3,5,7,8,-4,2]\nOutput: [280,140,32,1,1,1,1,1,1]\nExplanation: The coins placed on each node are:\n- Place 8 * 7 * 5 = 280 coins on node 0.\n- Place 7 * 5 * 4 = 140 coins on node 1.\n- Place 8 * 2 * 2 = 32 coins on node 2.\n- All other nodes are leaves with subtree of size 1, place 1 coin on each of them.\n
\n\nExample 3:
\n![\"\"](\"https://assets.leetcode.com/uploads/2023/11/09/screenshot-2023-11-10-012513.png\")
\n\nInput: edges = [[0,1],[0,2]], cost = [1,2,-2]\nOutput: [0,1,1]\nExplanation: Node 1 and 2 are leaves with subtree of size 1, place 1 coin on each of them. For node 0 the only possible product of cost is 2 * 1 * -2 = -4. Hence place 0 coins on node 0.\n
\n\n
\nConstraints:
\n\n\n\t2 <= n <= 2 * 104edges.length == n - 1edges[i].length == 20 <= ai, bi < ncost.length == n1 <= |cost[i]| <= 104- The input is generated such that
edges represents a valid tree. \n
\n",
+ "translatedTitle": "树中每个节点放置的金币数目",
+ "translatedContent": "给你一棵 n 个节点的 无向 树，节点编号为 0 到 n - 1 ，树的根节点在节点 0 处。同时给你一个长度为 n - 1 的二维整数数组 edges ，其中 edges[i] = [ai, bi] 表示树中节点 ai 和 bi 之间有一条边。
\n\n给你一个长度为 n 下标从 0 开始的整数数组 cost ，其中 cost[i] 是第 i 个节点的 开销 。
\n\n你需要在树中每个节点都放置金币，在节点 i 处的金币数目计算方法如下：
\n\n\n\t- 如果节点
i 对应的子树中的节点数目小于 3 ，那么放 1 个金币。 \n\t- 否则，计算节点
i 对应的子树内 3 个不同节点的开销乘积的 最大值 ，并在节点 i 处放置对应数目的金币。如果最大乘积是 负数 ，那么放置 0 个金币。 \n
\n\n请你返回一个长度为 n 的数组 coin ，coin[i]是节点 i 处的金币数目。
\n\n
\n\n示例 1：
\n\n
\n\n\n输入：edges = [[0,1],[0,2],[0,3],[0,4],[0,5]], cost = [1,2,3,4,5,6]\n输出：[120,1,1,1,1,1]\n解释：在节点 0 处放置 6 * 5 * 4 = 120 个金币。所有其他节点都是叶子节点，子树中只有 1 个节点，所以其他每个节点都放 1 个金币。\n
\n\n示例 2：
\n\n
\n\n\n输入：edges = [[0,1],[0,2],[1,3],[1,4],[1,5],[2,6],[2,7],[2,8]], cost = [1,4,2,3,5,7,8,-4,2]\n输出：[280,140,32,1,1,1,1,1,1]\n解释：每个节点放置的金币数分别为：\n- 节点 0 处放置 8 * 7 * 5 = 280 个金币。\n- 节点 1 处放置 7 * 5 * 4 = 140 个金币。\n- 节点 2 处放置 8 * 2 * 2 = 32 个金币。\n- 其他节点都是叶子节点，子树内节点数目为 1 ，所以其他每个节点都放 1 个金币。\n
\n\n示例 3：
\n\n
\n\n\n输入：edges = [[0,1],[0,2]], cost = [1,2,-2]\n输出：[0,1,1]\n解释：节点 1 和 2 都是叶子节点，子树内节点数目为 1 ，各放置 1 个金币。节点 0 处唯一的开销乘积是 2 * 1 * -2 = -4 。所以在节点 0 处放置 0 个金币。\n
\n\n
\n\n提示：
\n\n\n\t2 <= n <= 2 * 104edges.length == n - 1edges[i].length == 20 <= ai, bi < ncost.length == n1 <= |cost[i]| <= 104edges 一定是一棵合法的树。
\n",
+ "isPaidOnly": false,
+ "difficulty": "Hard",
+ "likes": 6,
+ "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": [],
+ "companyTagStats": null,
+ "codeSnippets": [
+ {
+ "lang": "C++",
+ "langSlug": "cpp",
+ "code": "class Solution {\npublic:\n vector placedCoins(vector>& edges, vector& cost) {\n \n }\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Java",
+ "langSlug": "java",
+ "code": "class Solution {\n public long[] placedCoins(int[][] edges, int[] cost) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python",
+ "langSlug": "python",
+ "code": "class Solution(object):\n def placedCoins(self, edges, cost):\n \"\"\"\n :type edges: List[List[int]]\n :type cost: List[int]\n :rtype: List[int]\n \"\"\"",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Python3",
+ "langSlug": "python3",
+ "code": "class Solution:\n def placedCoins(self, edges: List[List[int]], cost: List[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* placedCoins(int** edges, int edgesSize, int* edgesColSize, int* cost, int costSize, int* returnSize) {\n \n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "C#",
+ "langSlug": "csharp",
+ "code": "public class Solution {\n public long[] PlacedCoins(int[][] edges, int[] cost) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "JavaScript",
+ "langSlug": "javascript",
+ "code": "/**\n * @param {number[][]} edges\n * @param {number[]} cost\n * @return {number[]}\n */\nvar placedCoins = function(edges, cost) {\n\n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "TypeScript",
+ "langSlug": "typescript",
+ "code": "function placedCoins(edges: number[][], cost: number[]): number[] {\n \n};",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "PHP",
+ "langSlug": "php",
+ "code": "class Solution {\n\n /**\n * @param Integer[][] $edges\n * @param Integer[] $cost\n * @return Integer[]\n */\n function placedCoins($edges, $cost) {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Swift",
+ "langSlug": "swift",
+ "code": "class Solution {\n func placedCoins(_ edges: [[Int]], _ cost: [Int]) -> [Int] {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Kotlin",
+ "langSlug": "kotlin",
+ "code": "class Solution {\n fun placedCoins(edges: Array, cost: IntArray): LongArray {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Dart",
+ "langSlug": "dart",
+ "code": "class Solution {\n List placedCoins(List> edges, List cost) {\n \n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Go",
+ "langSlug": "golang",
+ "code": "func placedCoins(edges [][]int, cost []int) []int64 {\n\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Ruby",
+ "langSlug": "ruby",
+ "code": "# @param {Integer[][]} edges\n# @param {Integer[]} cost\n# @return {Integer[]}\ndef placed_coins(edges, cost)\n\nend",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Scala",
+ "langSlug": "scala",
+ "code": "object Solution {\n def placedCoins(edges: Array[Array[Int]], cost: Array[Int]): Array[Long] = {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Rust",
+ "langSlug": "rust",
+ "code": "impl Solution {\n pub fn placed_coins(edges: Vec>, cost: Vec) -> Vec {\n\n }\n}",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Racket",
+ "langSlug": "racket",
+ "code": "(define/contract (placed-coins edges cost)\n (-> (listof (listof exact-integer?)) (listof exact-integer?) (listof exact-integer?))\n )",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Erlang",
+ "langSlug": "erlang",
+ "code": "-spec placed_coins(Edges :: [[integer()]], Cost :: [integer()]) -> [integer()].\nplaced_coins(Edges, Cost) ->\n .",
+ "__typename": "CodeSnippetNode"
+ },
+ {
+ "lang": "Elixir",
+ "langSlug": "elixir",
+ "code": "defmodule Solution do\n @spec placed_coins(edges :: [[integer]], cost :: [integer]) :: [integer]\n def placed_coins(edges, cost) do\n \n end\nend",
+ "__typename": "CodeSnippetNode"
+ }
+ ],
+ "stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1402, \"totalSubmissionRaw\": 3031, \"acRate\": \"46.3%\"}",
+ "hints": [
+ "Use DFS on the whole tree, for each subtree, save the largest three positive costs and the smallest three non-positive costs. This can be done by using two Heaps with the size of at most three.",
+ "You need to store at most six values at each subtree.",
+ "If there are more than three values in total, we can sort them. Let’s call the resultant array A, the maximum product of three is max(A[0] * A[1] * A[n - 1], A[n - 1] * A[n - 2] * A[n - 3]). Don’t forget to set the result to 0 if the value is negative.",
+ "If there are less than three values for a subtree, set its result to 1."
+ ],
+ "solution": null,
+ "status": null,
+ "sampleTestCase": "[[0,1],[0,2],[0,3],[0,4],[0,5]]\n[1,2,3,4,5,6]",
+ "metaData": "{\n \"name\": \"placedCoins\",\n \"params\": [\n {\n \"name\": \"edges\",\n \"type\": \"integer[][]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"cost\"\n }\n ],\n \"return\": {\n \"type\": \"long[]\"\n }\n}",
+ "judgerAvailable": true,
+ "judgeType": "large",
+ "mysqlSchemas": [],
+ "enableRunCode": true,
+ "envInfo": "{\"cpp\":[\"C++\",\"\\u7248\\u672c\\uff1aclang 11<\\/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\\u6d4b