update

leetcode/originData/[no content]minimum-number-of-lines-to-cover-points.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": true,
             "difficulty": "Medium",
-            "likes": 23,
-            "dislikes": 5,
+            "likes": 24,
+            "dislikes": 6,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Max Points on a Line\", \"titleSlug\": \"max-points-on-a-line\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Min Cost to Connect All Points\", \"titleSlug\": \"min-cost-to-connect-all-points\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[[0,1],[2,3],[4,5],[4,3]]\n[[0,2],[-2,-2],[1,4]]",
@@ -70,7 +70,7 @@
             ],
             "companyTagStats": null,
             "codeSnippets": null,
-            "stats": "{\"totalAccepted\": \"677\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 677, \"totalSubmissionRaw\": 1445, \"acRate\": \"46.9%\"}",
+            "stats": "{\"totalAccepted\": \"727\", \"totalSubmission\": \"1.6K\", \"totalAcceptedRaw\": 727, \"totalSubmissionRaw\": 1558, \"acRate\": \"46.7%\"}",
             "hints": [
                 "What is the highest possible answer for a set of n points?",
                 "The highest possible answer is n / 2 (rounded up). This is because you can cover at least two points with a line, and if n is odd, you need to add one extra line to cover the last point.",