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/maximize-palindrome-length-from-subsequences.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 10262, \"totalSubmissionRaw\": 28727, \"acRate\": \"35.7%\"}",
"stats": "{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 10270, \"totalSubmissionRaw\": 28743, \"acRate\": \"35.7%\"}",
"hints": [
"Let's ignore the non-empty subsequence constraint. We can concatenate the two strings and find the largest palindromic subsequence with dynamic programming.",
"Iterate through every pair of characters word1[i] and word2[j], and see if some palindrome begins with word1[i] and ends with word2[j]. This ensures that the subsequences are non-empty."