coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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

2
leetcode/originData/count-different-palindromic-subsequences.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"26.1K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 26097, \"totalSubmissionRaw\": 59060, \"acRate\": \"44.2%\"}",
"stats": "{\"totalAccepted\": \"26.1K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 26121, \"totalSubmissionRaw\": 59107, \"acRate\": \"44.2%\"}",
"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."
],