mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 2327,
|
||||
"dislikes": 1602,
|
||||
"likes": 2553,
|
||||
"dislikes": 1624,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Find Peak Element\", \"titleSlug\": \"find-peak-element\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find in Mountain Array\", \"titleSlug\": \"find-in-mountain-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Removals to Make Mountain Array\", \"titleSlug\": \"minimum-number-of-removals-to-make-mountain-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[0,1,0]\n[0,2,1,0]\n[0,10,5,2]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"340.6K\", \"totalSubmission\": \"480.9K\", \"totalAcceptedRaw\": 340575, \"totalSubmissionRaw\": 480940, \"acRate\": \"70.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"359.3K\", \"totalSubmission\": \"509.6K\", \"totalAcceptedRaw\": 359307, \"totalSubmissionRaw\": 509555, \"acRate\": \"70.5%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "488",
|
||||
|
Reference in New Issue
Block a user