检查整数及其两倍数是否存在

/*
 * Solution using Java Streams
 * We use streams to iterate through the array and apply similar logic as the traditional Java solution.
 * The use of `anyMatch` helps to find if any pair meets the criteria where N = 2 * M.
 */
import java.util.HashSet;
import java.util.Set;
import java.util.stream.IntStream;

public class SolutionStream {
    public boolean checkIfExist(int[] arr) {
        Set<Integer> seen = new HashSet<>();
        return IntStream.of(arr).anyMatch(num -> {
            if (seen.contains(num * 2) || (num % 2 == 0 && seen.contains(num / 2))) {
                return true;
            }
            seen.add(num);
            return false;
        });
    }
}