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

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 3656,
"dislikes": 87,
"likes": 3751,
"dislikes": 88,
"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}]",
"exampleTestcases": "[1,2,3,2,1]\n[3,2,1,4,7]\n[0,0,0,0,0]\n[0,0,0,0,0]",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"165.4K\", \"totalSubmission\": \"322K\", \"totalAcceptedRaw\": 165409, \"totalSubmissionRaw\": 322039, \"acRate\": \"51.4%\"}",
"stats": "{\"totalAccepted\": \"168.7K\", \"totalSubmission\": \"328.5K\", \"totalAcceptedRaw\": 168697, \"totalSubmissionRaw\": 328485, \"acRate\": \"51.4%\"}",
"hints": [
"Use dynamic programming. dp[i][j] will be the answer for inputs A[i:], B[j:]."
],