coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 08:21: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/longest-subarray-with-maximum-bitwise-and.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"21.1K\", \"totalAcceptedRaw\": 9025, \"totalSubmissionRaw\": 21088, \"acRate\": \"42.8%\"}",
"stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"21.1K\", \"totalAcceptedRaw\": 9028, \"totalSubmissionRaw\": 21093, \"acRate\": \"42.8%\"}",
"hints": [
"Notice that the bitwise AND of two different numbers will always be strictly less than the maximum of those two numbers.",
"What does that tell us about the nature of the subarray that we should choose?"