coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/find-subsequence-of-length-k-with-the-largest-sum.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 386,
"dislikes": 32,
"likes": 421,
"dislikes": 39,
"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}]",
"exampleTestcases": "[2,1,3,3]\n2\n[-1,-2,3,4]\n3\n[3,4,3,3]\n2",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.1K\", \"totalSubmission\": \"32.2K\", \"totalAcceptedRaw\": 14149, \"totalSubmissionRaw\": 32186, \"acRate\": \"44.0%\"}",
"stats": "{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"35.4K\", \"totalAcceptedRaw\": 15445, \"totalSubmissionRaw\": 35414, \"acRate\": \"43.6%\"}",
"hints": [
"From a greedy perspective, what k elements should you pick?",
"Could you sort the array while maintaining the index?"