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:
小墨
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/[no content]largest-subarray-length-k.json
View File

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"12.3K\", \"totalAcceptedRaw\": 7888, \"totalSubmissionRaw\": 12274, \"acRate\": \"64.3%\"}",
"stats": "{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"12.3K\", \"totalAcceptedRaw\": 7889, \"totalSubmissionRaw\": 12275, \"acRate\": \"64.3%\"}",
"hints": [
"Search for the largest integer in the range [0, n - k]",
"This integer is the first element in the subarray. You should take it with the k - 1 elements after it."