coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"21.4K\", \"totalAcceptedRaw\": 8682, \"totalSubmissionRaw\": 21441, \"acRate\": \"40.5%\"}",
"stats": "{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 8687, \"totalSubmissionRaw\": 21452, \"acRate\": \"40.5%\"}",
"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')).",