mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
33 lines
913 B
HTML
33 lines
913 B
HTML
<p>Given an array <code>arr</code> of integers, check if there exist two indices <code>i</code> and <code>j</code> such that :</p>
|
|
|
|
<ul>
|
|
<li><code>i != j</code></li>
|
|
<li><code>0 <= i, j < arr.length</code></li>
|
|
<li><code>arr[i] == 2 * arr[j]</code></li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [10,2,5,3]
|
|
<strong>Output:</strong> true
|
|
<strong>Explanation:</strong> For i = 0 and j = 2, arr[i] == 10 == 2 * 5 == 2 * arr[j]
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [3,1,7,11]
|
|
<strong>Output:</strong> false
|
|
<strong>Explanation:</strong> There is no i and j that satisfy the conditions.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= arr.length <= 500</code></li>
|
|
<li><code>-10<sup>3</sup> <= arr[i] <= 10<sup>3</sup></code></li>
|
|
</ul>
|