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/originData/count-different-palindromic-subsequences.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"35.1K\", \"totalSubmission\": \"78.1K\", \"totalAcceptedRaw\": 35111, \"totalSubmissionRaw\": 78076, \"acRate\": \"45.0%\"}",
"stats": "{\"totalAccepted\": \"35.1K\", \"totalSubmission\": \"78.1K\", \"totalAcceptedRaw\": 35113, \"totalSubmissionRaw\": 78080, \"acRate\": \"45.0%\"}",
"hints": [
"Let dp(i, j) be the answer for the string T = S[i:j+1] including the empty sequence. The answer is the number of unique characters in T, plus palindromes of the form \"a_a\", \"b_b\", \"c_c\", and \"d_d\", where \"_\" represents zero or more characters."
],