coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 14:28:56 +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

2
leetcode-cn/originData/find-longest-awesome-substring.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 3010, \"totalSubmissionRaw\": 7492, \"acRate\": \"40.2%\"}",
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 3078, \"totalSubmissionRaw\": 7644, \"acRate\": \"40.3%\"}",
"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')).",