coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +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-cn/originData/longest-common-subsequence.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"395.1K\", \"totalSubmission\": \"608.2K\", \"totalAcceptedRaw\": 395132, \"totalSubmissionRaw\": 608161, \"acRate\": \"65.0%\"}",
"stats": "{\"totalAccepted\": \"395.2K\", \"totalSubmission\": \"608.3K\", \"totalAcceptedRaw\": 395202, \"totalSubmissionRaw\": 608296, \"acRate\": \"65.0%\"}",
"hints": [
"Try dynamic programming. \r\nDP[i][j] represents the longest common subsequence of text1[0 ... i] & text2[0 ... j].",
"DP[i][j] = DP[i - 1][j - 1] + 1 , if text1[i] == text2[j]\r\nDP[i][j] = max(DP[i - 1][j], DP[i][j - 1]) , otherwise"