coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/originData/shortest-common-supersequence.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"97.8K\", \"totalSubmission\": \"166K\", \"totalAcceptedRaw\": 97759, \"totalSubmissionRaw\": 165968, \"acRate\": \"58.9%\"}",
"stats": "{\"totalAccepted\": \"97.8K\", \"totalSubmission\": \"166K\", \"totalAcceptedRaw\": 97781, \"totalSubmissionRaw\": 166011, \"acRate\": \"58.9%\"}",
"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 shortest common supersequence."