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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"36.3K\", \"totalSubmission\": \"59.6K\", \"totalAcceptedRaw\": 36259, \"totalSubmissionRaw\": 59585, \"acRate\": \"60.9%\"}",
"stats": "{\"totalAccepted\": \"36.3K\", \"totalSubmission\": \"59.6K\", \"totalAcceptedRaw\": 36263, \"totalSubmissionRaw\": 59589, \"acRate\": \"60.9%\"}",
"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."