Longest Arithmetic Sequence

Given an array A of integers, return the length of the longest arithmetic subsequence in A.

Recall that a subsequence of A is a list A[i_1], A[i_2], ..., A[i_k] with 0 <= i_1 < i_2 < ... < i_k <= A.length - 1, and that a sequence B is arithmetic if B[i+1] - B[i] are all the same value (for 0 <= i < B.length - 1).

 

Example 1:

Input: [3,6,9,12]
Output: 4
Explanation: 
The whole array is an arithmetic sequence with steps of length = 3.

Example 2:

Input: [9,4,7,2,10]
Output: 3
Explanation: 
The longest arithmetic subsequence is [4,7,10].

Example 3:

Input: [20,1,15,3,10,5,8]
Output: 4
Explanation: 
The longest arithmetic subsequence is [20,15,10,5].

Note:

1. 2 <= A.length <= 2000
2. 0 <= A[i] <= 10000

思路：每个index，存一个hashmap，存到目前i为止的，所有跟前面value的diff的长度，<Integer, Integer> 代表<Diff, 长度个数>

那么递推公式为：j....i 

d = A[i] - A[j];

如果前面没有，默认就是2；dp[i].get(d) == null, put dp[i].put(d,2) ,

如果前面有: dp[i].put(d,  dp[j].get(d) + 1);

class Solution {
    public int longestArithSeqLength(int[] A) {
        if(A == null || A.length == 0) {
            return 0;
        }
        int n = A.length;
        HashMap<Integer, Integer>[] dp = new HashMap[n];
        int maxlen = 0;
        // 别忘记了初始化；
        for(int i = 0; i < n; i++) {
            dp[i] = new HashMap<Integer, Integer>();
        }
        for(int i = 1; i < n; i++) {
            for(int j = 0; j < i; j++) {
                int d = A[i] - A[j];
                int len = 2;
                if(dp[j].get(d) != null) {
                    len = dp[j].get(d) + 1;
                }
                dp[i].put(d, len);
                maxlen = Math.max(maxlen, dp[i].get(d));
            }
        }
        return maxlen;
    }
}