LeetCode873

网址：
https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/
题目:
*A sequence X_1, X_2, …, X_n is fibonacci-like if:
n >= 3
X_i + X_{i+1} = X_{i+2} for all i + 2 <= n
Given a strictly increasing array A of positive integers forming a sequence, find the length of the longest fibonacci-like subsequence of A. If one does not exist, return 0.
(Recall that a subsequence is derived from another sequence A by deleting any number of elements (including none) from A, without changing the order of the remaining elements. For example, [3, 5, 8] is a subsequence of [3, 4, 5, 6, 7, 8].)

Example 1:
Input: [1,2,3,4,5,6,7,8]
Output: 5
Explanation:
The longest subsequence that is fibonacci-like: [1,2,3,5,8].*

Solution1: brute force
思路：斐波那契数列，关键的是前两个数，用两层for循环选定前两个数，用binary search查找第三个数

public int lenLongestFibSubseq(int[] A) {
        int len = 0;
        for (int i = 0; i < A.length; i++) {
            for (int j = i + 1; j < A.length; j++) {
                int curLen = 2;
                int a1 = i, a2 = j;
                while(binarySearch(A, a2 + 1, A[a1] + A[a2]) != -1) {
                    curLen++;
                    int a3 = binarySearch(A, a2 + 1, A[a1] + A[a2]);
                    a1 = a2;
                    a2 = a3;
                }
                if (curLen >= 3) {
                    len = Math.max(len, curLen);
                }
            }
        }
        return len;
    }
    
    private int binarySearch(int[] arr, int l, int target) {
        int r = arr.length - 1;
        while (l <= r) {
            int mid = l + (r - l) / 2;
            if (arr[mid] == target) {
                return mid;
            }
            else if (arr[mid] > target) {
                r = mid - 1;
            }
            else {
                l = mid + 1;
            }
        }
        return -1;
    }

复杂度分析：
Time: O(n ^ 2 * n * logn) = O(n ^ 3 * logn)
Space: O(1)