[java] 最长连续递增子序列 input {2,6,3,5,6,7,4,5,2,1} output {3,5,6,7}
public class Case04 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("输入数组长度:");
int length = sc.nextInt();
int[] arr = new int[length];
...
原创
2019-02-04 20:10:46 ·
442 阅读 ·
0 评论