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:
小墨
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-cn/originData/maximum-length-of-repeated-subarray.json
View File

@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"217.7K\", \"totalSubmission\": \"383.7K\", \"totalAcceptedRaw\": 217708, \"totalSubmissionRaw\": 383718, \"acRate\": \"56.7%\"}",
"stats": "{\"totalAccepted\": \"217.7K\", \"totalSubmission\": \"383.8K\", \"totalAcceptedRaw\": 217745, \"totalSubmissionRaw\": 383782, \"acRate\": \"56.7%\"}",
"hints": [
"Use dynamic programming. dp[i][j] will be the longest common prefix of A[i:] and B[j:].",
"The answer is max(dp[i][j]) over all i, j."