mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 383,
|
||||
"likes": 386,
|
||||
"dislikes": 32,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Kth Largest Element in an Array\", \"titleSlug\": \"kth-largest-element-in-an-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximize Sum Of Array After K Negations\", \"titleSlug\": \"maximize-sum-of-array-after-k-negations\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Sort Integers by The Number of 1 Bits\", \"titleSlug\": \"sort-integers-by-the-number-of-1-bits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Difference in Sums After Removal of Elements\", \"titleSlug\": \"minimum-difference-in-sums-after-removal-of-elements\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"14K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 14048, \"totalSubmissionRaw\": 31931, \"acRate\": \"44.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"14.1K\", \"totalSubmission\": \"32.2K\", \"totalAcceptedRaw\": 14149, \"totalSubmissionRaw\": 32186, \"acRate\": \"44.0%\"}",
|
||||
"hints": [
|
||||
"From a greedy perspective, what k elements should you pick?",
|
||||
"Could you sort the array while maintaining the index?"
|
||||
|
Reference in New Issue
Block a user