coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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-cn/originData/find-longest-awesome-substring.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 4776, \"totalSubmissionRaw\": 10641, \"acRate\": \"44.9%\"}",
"stats": "{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 4778, \"totalSubmissionRaw\": 10645, \"acRate\": \"44.9%\"}",
"hints": [
"Given the character counts, under what conditions can a palindrome be formed ?",
"From left to right, use bitwise xor-operation to compute for any prefix the number of times modulo 2 of each digit. (mask ^= (1<<(s[i]-'0')).",