coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 14:28:56 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/find-longest-subarray-lcci.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"17.2K\", \"totalAcceptedRaw\": 6758, \"totalSubmissionRaw\": 17152, \"acRate\": \"39.4%\"}",
"stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"17.2K\", \"totalAcceptedRaw\": 6791, \"totalSubmissionRaw\": 17248, \"acRate\": \"39.4%\"}",
"hints": [
"是哪个字母或数字并不重要。你可以把该问题简化为只包含 A 和 B 的数组。然后寻找具有相同数量的 A 和 B 的最长子数组。",
"从蛮力解法开始。",