coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/range-product-queries-of-powers.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"12.3K\", \"totalAcceptedRaw\": 5176, \"totalSubmissionRaw\": 12313, \"acRate\": \"42.0%\"}",
"stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"12.3K\", \"totalAcceptedRaw\": 5177, \"totalSubmissionRaw\": 12315, \"acRate\": \"42.0%\"}",
"hints": [
"The <code>powers</code> array can be created using the binary representation of <code>n</code>.",
"Once <code>powers</code> is formed, the products can be taken using brute force."