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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 2080,
"dislikes": 39,
"likes": 2156,
"dislikes": 41,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Common Subsequence\", \"titleSlug\": \"longest-common-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "\"abac\"\n\"cab\"\n\"aaaaaaaa\"\n\"aaaaaaaa\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"42.6K\", \"totalSubmission\": \"76.4K\", \"totalAcceptedRaw\": 42602, \"totalSubmissionRaw\": 76391, \"acRate\": \"55.8%\"}",
"stats": "{\"totalAccepted\": \"44.2K\", \"totalSubmission\": \"79K\", \"totalAcceptedRaw\": 44237, \"totalSubmissionRaw\": 79045, \"acRate\": \"56.0%\"}",
"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."
],