coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/the-k-strongest-values-in-an-array.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 394,
"likes": 395,
"dislikes": 92,
"isLiked": null,
"similarQuestions": "[]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"26.9K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 26880, \"totalSubmissionRaw\": 45011, \"acRate\": \"59.7%\"}",
"stats": "{\"totalAccepted\": \"26.9K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 26907, \"totalSubmissionRaw\": 45045, \"acRate\": \"59.7%\"}",
"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."