coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/check-if-n-and-its-double-exist.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 795,
"dislikes": 109,
"likes": 879,
"dislikes": 115,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Keep Multiplying Found Values by Two\", \"titleSlug\": \"keep-multiplying-found-values-by-two\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[10,2,5,3]\n[7,1,14,11]\n[3,1,7,11]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"181.2K\", \"totalSubmission\": \"510.8K\", \"totalAcceptedRaw\": 181164, \"totalSubmissionRaw\": 510758, \"acRate\": \"35.5%\"}",
"stats": "{\"totalAccepted\": \"189.3K\", \"totalSubmission\": \"531.6K\", \"totalAcceptedRaw\": 189350, \"totalSubmissionRaw\": 531631, \"acRate\": \"35.6%\"}",
"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."