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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1250,
"dislikes": 68,
"likes": 1275,
"dislikes": 69,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Palindromic Subsequence\", \"titleSlug\": \"longest-palindromic-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "\"bccb\"\n\"abcdabcdabcdabcdabcdabcdabcdabcddcbadcbadcbadcbadcbadcbadcbadcba\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"26.1K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 26121, \"totalSubmissionRaw\": 59107, \"acRate\": \"44.2%\"}",
"stats": "{\"totalAccepted\": \"26.5K\", \"totalSubmission\": \"59.9K\", \"totalAcceptedRaw\": 26519, \"totalSubmissionRaw\": 59853, \"acRate\": \"44.3%\"}",
"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."
],