coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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

2
leetcode/originData/[no content]largest-subarray-length-k.json
View File

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"8.3K\", \"totalAcceptedRaw\": 5275, \"totalSubmissionRaw\": 8305, \"acRate\": \"63.5%\"}",
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"8.3K\", \"totalAcceptedRaw\": 5284, \"totalSubmissionRaw\": 8318, \"acRate\": \"63.5%\"}",
"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."