mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Hard",
|
||||
"likes": 45,
|
||||
"dislikes": 4,
|
||||
"dislikes": 5,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[1,2,3,1,2]\n[100,1,1,-3,1]\n[-1,-2,0,-1]",
|
||||
@@ -40,7 +40,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"2K\", \"totalAcceptedRaw\": 1334, \"totalSubmissionRaw\": 1987, \"acRate\": \"67.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.1K\", \"totalAcceptedRaw\": 1387, \"totalSubmissionRaw\": 2061, \"acRate\": \"67.3%\"}",
|
||||
"hints": [
|
||||
"Consider every possible beauty and its first and last index in flowers.",
|
||||
"Remove all flowers with negative beauties within those indices."
|
||||
|
Reference in New Issue
Block a user