给定一个未经排序的整数数组,找到最长且连续递增的子序列,并返回该序列的长度。
序列的下标是连续的
public class maxSeq { public static void main(String[] args) { System.out.println(findLength(new int[{1,2,3,4,2,3,4,5,6,3,4,5,6,7,8,9})); } //贪心算法寻找局部最优,求最长增长序列 public static int findLength(int[] numbs){ int start = 0; int max =0; for (int i = 1; i < numbs.length; i++) { if (numbs[i] <= numbs[i-1]){ start = i; } max = Math.max(max , i - start + 1); } return max; } }