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/palindrome-pairs.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"199.1K\", \"totalSubmission\": \"567.9K\", \"totalAcceptedRaw\": 199083, \"totalSubmissionRaw\": 567892, \"acRate\": \"35.1%\"}",
"stats": "{\"totalAccepted\": \"199.1K\", \"totalSubmission\": \"567.9K\", \"totalAcceptedRaw\": 199092, \"totalSubmissionRaw\": 567911, \"acRate\": \"35.1%\"}",
"hints": [
"Checking every two pairs will exceed the time limit. It will be O(n^2 * k). We need a faster way.",
"If we hash every string in the array, how can we check if two pairs form a palindrome after the concatenation?",