lintcode 中等题：minimum adjustment cost 最小调整代价

public class Solution {
    /**
     * @param A: An integer array.
     * @param target: An integer.
     */
    public int MinAdjustmentCost(ArrayList<Integer> A, int target) {
        // write your code here
        int lenA = A.size();
        int M[][] = new int[lenA][100];
        for(int i=0;i<A.size();i++){
            for(int j=0;j< 100;j++)
                M[i][j] = Integer.MAX_VALUE;
        }
        return helper(A,new ArrayList<Integer>(A),target,0,M);
        
    }
    public int helper(ArrayList<Integer> A,ArrayList<Integer> B,int target,int index,
    int[][] M){
        int len = A.size();
        if(index >=len){
            return 0;
        }
        int diff = 0;
        int MIN = Integer.MAX_VALUE;
        for(int i=1; i<=100;i++){
            if(index !=0 && Math.abs( i - B.get(index -1)) > target)
                continue;
            if(M[index][i-1] !=Integer.MAX_VALUE){
                diff = M[index][i -1];
                MIN = Math.min(MIN,diff);
                continue;
            }
            B.set(index,i);
            diff = Math.abs(i - A.get(index));
            diff += helper(A,B,target,index + 1,M);
            MIN = Math.min(MIN,diff);
            
            M[index][i-1] = diff;
            B.set(index,A.get(index));
        }
        return MIN;
        
    }
}