update

leetcode/originData/minimum-number-of-days-to-make-m-bouquets.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 1512,
-            "dislikes": 38,
+            "likes": 1583,
+            "dislikes": 40,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Maximize the Confusion of an Exam\", \"titleSlug\": \"maximize-the-confusion-of-an-exam\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Earliest Possible Day of Full Bloom\", \"titleSlug\": \"earliest-possible-day-of-full-bloom\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,10,3,10,2]\n3\n1\n[1,10,3,10,2]\n3\n2\n[7,7,7,7,12,7,7]\n2\n3",
@@ -125,7 +125,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"35.1K\", \"totalSubmission\": \"63.4K\", \"totalAcceptedRaw\": 35109, \"totalSubmissionRaw\": 63434, \"acRate\": \"55.3%\"}",
+            "stats": "{\"totalAccepted\": \"36.9K\", \"totalSubmission\": \"66.2K\", \"totalAcceptedRaw\": 36938, \"totalSubmissionRaw\": 66221, \"acRate\": \"55.8%\"}",
             "hints": [
                 "If we can make m or more bouquets at day x, then we can still make m or more bouquets at any day y > x.",
                 "We can check easily if we can make enough bouquets at day x if we can get group adjacent flowers at day x."