最长连续递增子序列

题目

我的代码

package 查找与排序上.线上讲解;

public class 最长连续递增子序列 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		//int[] a = {1,9,2,5,7,3,4,6,8,0};
		int[] a = {1,9,2,5,7,3,4,6,6,7,8,19};
		int res = maxLen(a);
		System.out.println(res);
	}

	private static int maxLen(int[] a) {
		int begin = 0;
		int end = 1;
		int len = 1;
		int x =0,y=0;
		while(end < a.length-1){
			begin = end;
			//end<=a.length-1可以访问到数组最后一个;a[end]>=a[end-1],如果出现3,6,6,7类似这样的序列,也可以认为递增序列.
			while (end <= a.length - 1 && ((begin == end) || (a[end] >= a[end - 1]))) {
				end++;
			}
			if (len < end - begin ) {
				len = end - begin;
				x = begin;
				y = end-1;
			}
			//结算上一轮,开始下一轮
			begin = end;
		}
		for (int i = x; i <= y; i++) {
			System.out.print(a[i] + " ");
		}
		System.out.println();
		return len;
	}

}