存量题库数据更新

leetcode/originData/minimum-operations-to-maximize-last-elements-in-arrays.json

@@ -11,14 +11,27 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 44,
-            "dislikes": 8,
+            "likes": 149,
+            "dislikes": 12,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Minimum Swaps To Make Sequences Increasing\", \"titleSlug\": \"minimum-swaps-to-make-sequences-increasing\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,2,7]\n[4,5,3]\n[2,3,4,5,9]\n[8,8,4,4,4]\n[1,5,4]\n[2,5,3]",
             "categoryTitle": "Algorithms",
             "contributors": [],
-            "topicTags": [],
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": null,
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Greedy",
+                    "slug": "greedy",
+                    "translatedName": null,
+                    "__typename": "TopicTagNode"
+                }
+            ],
             "companyTagStats": null,
             "codeSnippets": [
                 {
@@ -136,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"14K\", \"totalAcceptedRaw\": 5457, \"totalSubmissionRaw\": 14007, \"acRate\": \"39.0%\"}",
+            "stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"22.3K\", \"totalAcceptedRaw\": 9831, \"totalSubmissionRaw\": 22303, \"acRate\": \"44.1%\"}",
             "hints": [
                 "Consider how to calculate the minimum number of operations when <code>nums1[n - 1]</code> and <code>nums2[n - 1]</code> are fixed (they are not swapped).",
                 "For each index <code>i</code>, there are only <code>3</code> possibilities: <ul>\r\n<li><code>nums1[i] <= nums1[n - 1] && nums2[i] <= nums2[n - 1]</code>. We don't need to swap them.</li>\r\n<li><code>nums1[i] <= nums2[n - 1] && nums2[i] <= nums1[n - 1]</code>. We have to swap them.</li>\r\n<li>Otherwise, there is no solution.</li>\r\n</ul>",