mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"49.6K\", \"totalSubmission\": \"99.4K\", \"totalAcceptedRaw\": 49640, \"totalSubmissionRaw\": 99424, \"acRate\": \"49.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"49.7K\", \"totalSubmission\": \"99.5K\", \"totalAcceptedRaw\": 49656, \"totalSubmissionRaw\": 99461, \"acRate\": \"49.9%\"}",
|
||||
"hints": [
|
||||
"Can you reduce this problem to a classic problem?",
|
||||
"The problem is equivalent to finding any palindromic subsequence of length at least N-K where N is the length of the string.",
|
||||
|
Reference in New Issue
Block a user