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-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

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

@@ -12,7 +12,7 @@
"isPaidOnly": true,
"difficulty": "Easy",
"likes": 64,
"dislikes": 81,
"dislikes": 82,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,4,5,2,3]\n3\n[1,4,5,2,3]\n4\n[1,4,5,2,3]\n1",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"8.3K\", \"totalAcceptedRaw\": 5284, \"totalSubmissionRaw\": 8318, \"acRate\": \"63.5%\"}",
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 5444, \"totalSubmissionRaw\": 8558, \"acRate\": \"63.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."