coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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/originData/sum-of-squares-of-special-elements.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"47.5K\", \"totalSubmission\": \"59.9K\", \"totalAcceptedRaw\": 47455, \"totalSubmissionRaw\": 59892, \"acRate\": \"79.2%\"}",
"stats": "{\"totalAccepted\": \"47.5K\", \"totalSubmission\": \"59.9K\", \"totalAcceptedRaw\": 47500, \"totalSubmissionRaw\": 59938, \"acRate\": \"79.2%\"}",
"hints": [
"Iterate over all the elements of the array. For each index i, check if it is special using the modulo operator.",
"if n%i == 0, index i is special and you should add nums[i] to the answer."