Check If N and Its Double Exist LeetCode solution in Java

1
class Solution {
2
  public boolean checkIfExist(int[] arr) {
3
    int n = arr.length;
4
    for (int i = 0; i < n; i++)
5
      for (int j = 0; j < n; j++) if (i != j && arr[i] == 2 * arr[j]) return true;
6

7
    return false;
8
  }
9
}
10

11
// TC: O(n ^ 2), SC: O(1)