存量题库数据更新

leetcode-cn/originData/[no content]maximum-profitable-triplets-with-increasing-prices-ii.json

@@ -8,20 +8,33 @@
             "title": "Maximum Profitable Triplets With Increasing Prices II",
             "titleSlug": "maximum-profitable-triplets-with-increasing-prices-ii",
             "content": null,
-            "translatedTitle": null,
+            "translatedTitle": "具有递增价格的最大利润三元组 II",
             "translatedContent": null,
             "isPaidOnly": true,
             "difficulty": "Hard",
-            "likes": 0,
+            "likes": 1,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
             "contributors": [],
             "langToValidPlayground": null,
-            "topicTags": [],
+            "topicTags": [
+                {
+                    "name": "Binary Indexed Tree",
+                    "slug": "binary-indexed-tree",
+                    "translatedName": "树状数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                }
+            ],
             "companyTagStats": null,
             "codeSnippets": null,
-            "stats": "{\"totalAccepted\": \"31\", \"totalSubmission\": \"33\", \"totalAcceptedRaw\": 31, \"totalSubmissionRaw\": 33, \"acRate\": \"93.9%\"}",
+            "stats": "{\"totalAccepted\": \"80\", \"totalSubmission\": \"101\", \"totalAcceptedRaw\": 80, \"totalSubmissionRaw\": 101, \"acRate\": \"79.2%\"}",
             "hints": [
                 "Let's fix the middle chosen item for instance index <code>j</code>.",
                 "Let’s define an array <code>max_right</code>, where <code>max_right[j]</code> represents the maximum <code>profit[k]</code> for every index <code>k > j</code> such that <code>prices[k] > prices[j]</code>.",