左右最值最大差(非贪心)

import java.util.*;

public class MaxGap {
    public int findMaxGap(int[] A, int n) {
        // write code here
        if(n == 0){
            return 0 ;
        }
        int[] arr = new int[n];
        int k = 0,left,right;
        int x;
        for(int i =0;i<n&&k<n-1;i++){
            left =getmax(A,0,k);
            right =getmax(A,k+1,n-1);
            if(left-right>0){
                x = left-right;
            }else{
                x= right-left;
            }
            arr[k++] = x;
        }
        return getmax(arr,0,arr.length-1);
    }
    public int getmax(int[] A,int m, int n) {
        int Max = 0;
        for(int i = m;i<=n;i++){
            if(A[i]>Max){
                Max = A[i];
            }
        }
        return Max;
    }
}