Leetcode No.873 Length of Longest Fibonacci Subsequence

题目：https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/submissions/

class Solution {
    public int lenLongestFibSubseq(int[] A) {
        int N = A.length;
        int n = 0;
        Set<Integer> set = new HashSet<>();
        for (int x : A) set.add(x);
        for (int i = 0; i < N - 2; ++i) {
            for (int j = i + 1; j < N - 1; ++j) {
                int len = 2;
                int x = A[i];
                int y = A[j];
                int z = x + y;
                while (set.contains(z)) {
                    x = y;
                    y = z;
                    z = x + y;
                    ++len;
                }
                n = Math.max(n, len);
            }
        }
	return n >= 3 ? n : 0;
    }
}