求最长的递增子数组

package com.chinahrt.zyn.pango;

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;

public class MaxSubList {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int begin = 0;//开始序号
		int end = 0;//结束序号
		//放子数组的开始序号和长度
		Map<Integer,Integer> map = new HashMap<Integer,Integer>(); 
		int[] a = {1,5,3,4,6,10,9,8,7};
		//迭代循环a
		for(int i=1;i<a.length;i++){
			if(a[i]>=a[i-1]){
				end++;
			}else{
				map.put(begin, end-begin+1);
				begin = i;
				end = i;
			}
		}
		Set<Entry<Integer,Integer>> set = map.entrySet();
		Iterator it=set.iterator();
		int length = 0;//长度
		int maxBegin = 0;//开始序号
		//迭代map，寻找最大的长度
		while(it.hasNext()){
			Map.Entry<Integer, Integer>  entry=(Entry<Integer, Integer>) it.next();
			if((Integer.valueOf(entry.getValue()))>length){
				maxBegin = Integer.valueOf(entry.getKey());
				length = Integer.valueOf(entry.getValue()); 
			}
		}
		System.out.println("最长子数组为：从a["+maxBegin+"]开始的"+length+"个数。");
	}

}