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/check-if-n-and-its-double-exist.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"37.7K\", \"totalSubmission\": \"90.2K\", \"totalAcceptedRaw\": 37718, \"totalSubmissionRaw\": 90239, \"acRate\": \"41.8%\"}",
"stats": "{\"totalAccepted\": \"37.7K\", \"totalSubmission\": \"90.2K\", \"totalAcceptedRaw\": 37720, \"totalSubmissionRaw\": 90241, \"acRate\": \"41.8%\"}",
"hints": [
"Loop from i = 0 to arr.length, maintaining in a hashTable the array elements from [0, i - 1].",
"On each step of the loop check if we have seen the element 2 * arr[i] so far or arr[i] / 2 was seen if arr[i] % 2 == 0."