題目
Given an array arr of integers, check if there exist two indices i and j such that :
- i != j
- 0 <= i, j < arr.length
- arr[i] == 2 * arr[j]
Example 1
1
2
3
| 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
1
2
3
| Input: arr = [3,1,7,11]
Output: false
Explanation: There is no i and j that satisfy the conditions.
|
Constraints:
- 2 <= arr.length <= 500
- -103 <= arr[i] <= 103
我的解題
1
2
3
4
5
6
7
8
9
10
11
| class Solution {
public boolean checkIfExist(int[] arr) {
for (int i=0;i<arr.length;i++){
for(int j=0;j<arr.length;j++){
if(i !=j && arr[i] == 2 * arr[j]){
return true;
}
}
}return false;
}
}
|