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,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1397,
|
||||
"likes": 1398,
|
||||
"dislikes": 109,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Find Score of an Array After Marking All Elements\", \"titleSlug\": \"find-score-of-an-array-after-marking-all-elements\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"86.1K\", \"totalSubmission\": \"123.1K\", \"totalAcceptedRaw\": 86081, \"totalSubmissionRaw\": 123079, \"acRate\": \"69.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"86.1K\", \"totalSubmission\": \"123.1K\", \"totalAcceptedRaw\": 86091, \"totalSubmissionRaw\": 123091, \"acRate\": \"69.9%\"}",
|
||||
"hints": [
|
||||
"Use dynamic programming to get the power of each integer of the intervals.",
|
||||
"Sort all the integers of the interval by the power value and return the k-th in the sorted list."
|
||||
|
Reference in New Issue
Block a user