873. Length of the longest Fibonacci subsequence

today leetcode My daily question , The title link is ：873. The length of the longest Fibonacci subsequence Here comes a solution ：
First, use the data HashMap recorded , Then take two numbers from the array , And judge whether the sum of these two numbers is HashMap in , If in , Then continue to recursively judge downward , And record the maximum length , The code is as follows :

class Solution {
    
    int maxTemp = -1;
    int jTmp =-1;
    int max = 0;
    public int lenLongestFibSubseq(int[] arr) {
    
        Map<Integer,Integer> map = new HashMap();
        for (int i = 0; i < arr.length; i++) {
    
            map.put(arr[i],i);
        }
        for (int i = 0; i < arr.length-2; i++) {
    
            maxTemp = -1;
            for (int j = i+1; j < arr.length-1; j++) {
    

                int a = arr[i];
                int b = arr[j];
                jTmp = j;

                getMaxTemp(map, a, b);

            }

        }
        return max;
    }

    private void getMaxTemp(Map<Integer, Integer> map, int a, int b) {
    
        int sum = a + b;

        if(map.containsKey(sum)&& map.get(sum)> jTmp){
    
            if(maxTemp ==-1){
    
                maxTemp = 2;
            }
            a = b;
            b =sum;
            jTmp = map.get(sum);
            maxTemp++;
            max = Math.max(max,maxTemp);
            getMaxTemp(map, a, b);
        }else{
    
            maxTemp=-1;
        }

    }
}