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/power-of-heroes.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"44.3K\", \"totalAcceptedRaw\": 18493, \"totalSubmissionRaw\": 44340, \"acRate\": \"41.7%\"}",
"stats": "{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"44.3K\", \"totalAcceptedRaw\": 18495, \"totalSubmissionRaw\": 44343, \"acRate\": \"41.7%\"}",
"hints": [
"Try something with sorting the array.",
"For a pair of array elements nums[i] and nums[j] (i < j), the power would be nums[i]*nums[j]^2 regardless of how many elements in between are included.",