How to know that a triangle triple exists in our array?

Question

I was stuck in solving the following interview practice question:
I have to write a function:

int triangle(int[] A);

that given a zero-

Answer 1

In Java:

public int triangle2(int[] A) {

    if (null == A)
        return 0;
    if (A.length < 3)
        return 0;

    Arrays.sort(A);

    for (int i = 0; i < A.length - 2 && A[i] > 0; i++) {
        if (A[i] + A[i + 1] > A[i + 2])
            return 1;
    }

    return 0;

}