plduhoux
2/22/2018 - 6:25 PM

longestSequence

int longestSequence(int[] a) {
    if (a.length < 2) return a.length;
    int nbmax = 0;
    for (int i = 0; i < a.length; i++) {
        for (int j = i + 1; j < a.length; j++) {
            int prog = a[j] - a[i];
            int cur = 2;
            int prev = a[j];
            for (int k = j+1; k < a.length; k++) {
                if (a[k] - prev == prog) {
                    cur++;
                    prev = a[k];
                }
            }
            if (nbmax < cur) nbmax = cur;
        }
    }
    return nbmax;
}