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

4
leetcode/originData/maximum-length-of-repeated-subarray.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 3650,
"likes": 3656,
"dislikes": 87,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Size Subarray Sum\", \"titleSlug\": \"minimum-size-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Common Subpath\", \"titleSlug\": \"longest-common-subpath\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"165K\", \"totalSubmission\": \"321.4K\", \"totalAcceptedRaw\": 165047, \"totalSubmissionRaw\": 321373, \"acRate\": \"51.4%\"}",
"stats": "{\"totalAccepted\": \"165.4K\", \"totalSubmission\": \"322K\", \"totalAcceptedRaw\": 165409, \"totalSubmissionRaw\": 322039, \"acRate\": \"51.4%\"}",
"hints": [
"Use dynamic programming. dp[i][j] will be the answer for inputs A[i:], B[j:]."
],