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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 1252, \"totalSubmissionRaw\": 1798, \"acRate\": \"69.6%\"}",
"stats": "{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.9K\", \"totalAcceptedRaw\": 1295, \"totalSubmissionRaw\": 1860, \"acRate\": \"69.6%\"}",
"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."