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-cn/originData/smallest-subarrays-with-maximum-bitwise-or.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"11.7K\", \"totalAcceptedRaw\": 5184, \"totalSubmissionRaw\": 11676, \"acRate\": \"44.4%\"}",
"stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"11.7K\", \"totalAcceptedRaw\": 5186, \"totalSubmissionRaw\": 11678, \"acRate\": \"44.4%\"}",
"hints": [
"Consider trying to solve the problem for each bit position separately.",
"For each bit position, find the position of the next number that has a 1 in that position, if any.",