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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8K\", \"totalSubmission\": \"14.6K\", \"totalAcceptedRaw\": 8007, \"totalSubmissionRaw\": 14640, \"acRate\": \"54.7%\"}",
"stats": "{\"totalAccepted\": \"8K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 8015, \"totalSubmissionRaw\": 14651, \"acRate\": \"54.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."