coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 22:13:28 +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/shortest-common-supersequence.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 3212, \"totalSubmissionRaw\": 6367, \"acRate\": \"50.4%\"}",
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 3221, \"totalSubmissionRaw\": 6376, \"acRate\": \"50.5%\"}",
"hints": [
"We can find the length of the longest common subsequence between str1[i:] and str2[j:] (for all (i, j)) by using dynamic programming. We can use this information to recover the longest common supersequence."
],