public class Demo {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc= new Scanner(System.in);
int[] a = new int[6];
for (int i = 0; i < a.length; i++) {
a[i] = sc.nextInt();
}
// for (int i = 0; i < a.length; i++) {
// System.out.println(a[i]);
// }
System.out.println(f1(a));
sc.close();
}
//方法实现 使用两个指针
private static int f1(int[] a) {
// TODO Auto-generated method stub
int maxlength = 0;
int beg = 0;
int end = 1;
while (beg<=end && end<=a.length-1) {
if (a[end-1] < a[end]) {
maxlength = end-beg+1;
end++;
}else {
beg = end;
end++;
}
}
return maxlength;
}
}
递归算法---最长连续递增子序列
最新推荐文章于 2022-10-26 14:57:55 发布