coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 14:28:56 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 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

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"43K\", \"totalAcceptedRaw\": 18496, \"totalSubmissionRaw\": 43016, \"acRate\": \"43.0%\"}",
"stats": "{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"43.1K\", \"totalAcceptedRaw\": 18539, \"totalSubmissionRaw\": 43130, \"acRate\": \"43.0%\"}",
"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."