存量题库数据更新

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

@@ -11,17 +11,30 @@
             "translatedContent": null,
             "isPaidOnly": true,
             "difficulty": "Hard",
-            "likes": 4,
+            "likes": 7,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
             "exampleTestcases": "[10,2,3,4]\n[100,2,7,10]\n[1,2,3,4,5]\n[1,5,3,4,6]\n[4,3,2,1]\n[33,20,19,87]",
             "categoryTitle": "Algorithms",
             "contributors": [],
-            "topicTags": [],
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": null,
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Binary Indexed Tree",
+                    "slug": "binary-indexed-tree",
+                    "translatedName": null,
+                    "__typename": "TopicTagNode"
+                }
+            ],
             "companyTagStats": null,
             "codeSnippets": null,
-            "stats": "{\"totalAccepted\": \"101\", \"totalSubmission\": \"163\", \"totalAcceptedRaw\": 101, \"totalSubmissionRaw\": 163, \"acRate\": \"62.0%\"}",
+            "stats": "{\"totalAccepted\": \"257\", \"totalSubmission\": \"450\", \"totalAcceptedRaw\": 257, \"totalSubmissionRaw\": 450, \"acRate\": \"57.1%\"}",
             "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>.",