Diffk II

Given an array A of integers and another non negative integer k, find if there exists 2 indices i and j such that A[i] - A[j] = k, i != j.

Example :

Input :

A : [1 5 3]
k : 2

Output :

1

as 3 - 1 = 2

• Return 0 / 1 for this problem.

public class Solution {
    // DO NOT MODIFY THE LIST. IT IS READ ONLY
    public int diffPossible(final List<Integer> A, int B) {
        Set<Integer> visited = new HashSet<Integer>();
        for (Integer number : A) {
            if (visited.contains(number + B) || visited.contains(number - B))
                return 1;
            visited.add(number);
        }
        return 0;
    }
}