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/find-palindrome-with-fixed-length.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.1K\", \"totalSubmission\": \"49.5K\", \"totalAcceptedRaw\": 17080, \"totalSubmissionRaw\": 49520, \"acRate\": \"34.5%\"}",
"stats": "{\"totalAccepted\": \"17.1K\", \"totalSubmission\": \"49.5K\", \"totalAcceptedRaw\": 17082, \"totalSubmissionRaw\": 49533, \"acRate\": \"34.5%\"}",
"hints": [
"For any value of queries[i] and intLength, how can you check if there exists at least queries[i] palindromes of length intLength?",
"Since a palindrome reads the same forwards and backwards, consider how you can efficiently find the first half (ceil(intLength/2) digits) of the palindrome."