求数组中最长递增序列

public class maxIncrease {
    //求数组中最大的递增序列
        public static void main(String[] args) {
            int[] arr={1,5,2,4,7,9,3,6,9,1,2,3,4};
            System.out.println(Arrays.toString(maxLine(arr)));
        }
        public static int[] maxLine(int[] arr){
            int begin=0;
            int end=0;
            int oldLength=0;
            int length=1;
            int[] newArr={-1};
            while(end<arr.length){
                for (int i =begin; i < arr.length-1; i++) {
                    if(arr[i+1]>=arr[i]){
                        end++;
                        length++;
                    }else{
                        break;
                    }
                }
                System.out.println(length);
                if(length>=oldLength){
                    newArr =new int[length];
                    System.arraycopy(arr, begin, newArr, 0, length);
                    oldLength=length;
                }
                end++;
                begin=end;
                length=1;
            }
            return newArr;
        }
    }