最长可整合子数组长度

import java.util.Arrays;
import java.util.HashSet;

/**
 * Created by lxw, liwei4939@126.com on 2017/11/2.
 * 最长可整合子数组长度
 */
public class integratedArray {

    public int getLIL1(int[] arr){
        if(arr == null || arr.length == 0){
            return 0;
        }
        int len  =0;
        for (int i=0; i<arr.length; i++){
            for (int j=i; j< arr.length; j++){
                if(isIntegrated(arr, i, j)){
                    len = Math.max(len, j-i + 1);
                }
            }
        }
        return len;
    }

    public boolean isIntegrated(int[] arr, int left, int right){
        int[] newArr = Arrays.copyOfRange(arr, left, right + 1);
        Arrays.sort(newArr);
        for (int i=1; i< newArr.length; i++){
            if(newArr[i] != newArr[i-1] + 1){
                return false;
            }
        }
        return true;
    }

    public int getLIL2(int[] arr){
        if(arr == null || arr.length == 0){
            return 0;
        }
        int len = 0;
        int max = 0;
        int min  =0;
        HashSet<Integer> set = new HashSet<Integer>();
        for (int i = 0; i< arr.length; i++){
            max = Integer.MIN_VALUE;
            min = Integer.MAX_VALUE;
            for (int j=i; j< arr.length; j++){
                if(set.contains(arr[j])){
                    break;
                }
                set.add(arr[j]);
                max = Math.max(max, arr[j]);
                min = Math.min(min, arr[j]);
                if(max - min == j -i){
                    len = Math.max(len, j-i + 1);
                }
            }
            set.clear();
        }
        return len;
    }

    public static void main(String[] args){
        integratedArray tmp = new integratedArray();
        int[] arr = {5, 5, 3, 2, 6, 4, 3};
        System.out.println(tmp.getLIL1(arr));
        System.out.println(tmp.getLIL2(arr));
    }
}