mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 5893,
|
||||
"dislikes": 244,
|
||||
"likes": 5900,
|
||||
"dislikes": 245,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Create Maximum Number\", \"titleSlug\": \"create-maximum-number\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Monotone Increasing Digits\", \"titleSlug\": \"monotone-increasing-digits\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find the Most Competitive Subsequence\", \"titleSlug\": \"find-the-most-competitive-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Append K Integers With Minimal Sum\", \"titleSlug\": \"append-k-integers-with-minimal-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "\"1432219\"\n3\n\"10200\"\n1\n\"10\"\n2",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"256K\", \"totalSubmission\": \"840K\", \"totalAcceptedRaw\": 256001, \"totalSubmissionRaw\": 840036, \"acRate\": \"30.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"256.3K\", \"totalSubmission\": \"840.9K\", \"totalAcceptedRaw\": 256257, \"totalSubmissionRaw\": 840894, \"acRate\": \"30.5%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "768",
|
||||
|
Reference in New Issue
Block a user