coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07: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/the-k-strongest-values-in-an-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 395,
"dislikes": 92,
"likes": 405,
"dislikes": 94,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4,5]\n2\n[1,1,3,5,5]\n2\n[6,7,11,7,6,8]\n5",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"26.9K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 26907, \"totalSubmissionRaw\": 45045, \"acRate\": \"59.7%\"}",
"stats": "{\"totalAccepted\": \"27.3K\", \"totalSubmission\": \"45.6K\", \"totalAcceptedRaw\": 27265, \"totalSubmissionRaw\": 45628, \"acRate\": \"59.8%\"}",
"hints": [
"Calculate the median of the array as defined in the statement.",
"Use custom sort function to sort values (Strongest first), then slice the first k."