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/shortest-common-supersequence.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 2074,
"likes": 2080,
"dislikes": 39,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Common Subsequence\", \"titleSlug\": \"longest-common-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"42.5K\", \"totalSubmission\": \"76.2K\", \"totalAcceptedRaw\": 42480, \"totalSubmissionRaw\": 76191, \"acRate\": \"55.8%\"}",
"stats": "{\"totalAccepted\": \"42.6K\", \"totalSubmission\": \"76.4K\", \"totalAcceptedRaw\": 42602, \"totalSubmissionRaw\": 76391, \"acRate\": \"55.8%\"}",
"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."
],