问案例[-2,0,10，-19,4,6，-8]数组搜索失败的原因

EN

Given an array arr of integers, check if there exists two integers N and M such that N is the double of M ( i.e. N = 2 * M).
More formally check if there exists two indices i and j such that :
i != j
0 <= i, j < arr.length
arr[i] == 2 * arr[j]

class Solution {
    public boolean checkIfExist(int[] arr) {
        for (int i = 0; i < arr.length; i++){
            for (int j = 0; j < arr.length; j++){
                int temp = arr[j] * 2;
                if (temp == arr[i]){
                    return true;
                }
            }
        }
    return false;
    }
}