#1346
Check If N and Its Double Exist
pupil · 485 · lc easy +27 · verified · 41.7% accepted · 2,517 likes · top 22%
Description
Given an integer array arr, determine whether there exist two distinct indices i and j (with i != j, both in bounds) such that arr[i] == 2 * arr[j].
Example 1:
Input: arr = [10,2,5,3]
Output: true
Explanation: For i = 0 and j = 2, arr[i] == 10 == 2 * 5 == 2 * arr[j]
Example 2:
Input: arr = [3,1,7,11]
Output: false
Explanation: There is no i and j that satisfy the conditions.
Code
1
2
3